Solver for the Rush Hour Game based on the Breadth First Search algorithm
-
Updated
Feb 28, 2017 - Python
Solver for the Rush Hour Game based on the Breadth First Search algorithm
Build a Graph Data Structure using adjacency list. the Graph Includes different Mtheods like add Node, addEdge, Print, DepthFirstTraversal both recursive and iterative using a stack , Breadth First search using a queue , topological sorting and hasCycle
Solves mazes using the breathfirst algo. Utilizes javaFX for the GUI and incorporated SetArray and QueueArray.
This game solver implements DFS and BFS to generate step-by-step solutions for puzzles.
Add a description, image, and links to the breathfirstsearch topic page so that developers can more easily learn about it.
To associate your repository with the breathfirstsearch topic, visit your repo's landing page and select "manage topics."