Skip to content

A maze generator and solver written in Java, which uses the Prim algorithm and BFS/DFS algorithm.

License

Notifications You must be signed in to change notification settings

samuelbenichou/ChampionsLeague-Maze

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

80 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Champions League Maze

alt text

Build Status Price GitHub

Genral info

The Champions League Maze is a game in which the purpose of the game is for the player to make their way from the start point to the end point. The layout of the maze is such that the player must follow a series of narrow winding corridors with many false turns and dead-ends until they eventually reach the finish point. We implemented many programming principles such as design patterns, multiThreading programming, Server/Client, Gui and JavaFX and SOLID coding guidelines. We also practice use with Maven repositories manager include log4j2 LogManager.

Maze Creation Algorithm

To create the mazes, I used the Prim algorithm, this algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.

Maze Solver Algorithm

To solve the mazes, I implemented 3 algorithms :

  • Breadth-first search (BFS) which is an algorithm for traversing or searching tree or graph data structures.
  • Depth-first search (DFS) which is an algorithm for traversing or searching tree or graph data structures.
  • Best-first search which is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule.

Design Pattern

  • Strategy pattern which is a behavioral software design pattern that enables selecting an algorithm at runtime.
  • Observer pattern which is a software design pattern in which an object, called the subject, maintains a list of its dependents, called observers, and notifies them automatically of any state changes, usually by calling one of their methods.

LICENSE

Copyright (c) 2020 Samuel Benichou

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

About

A maze generator and solver written in Java, which uses the Prim algorithm and BFS/DFS algorithm.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Languages