Exercise: Colored NxM-tile puzzle solution
-
Updated
Jun 20, 2020 - Rich Text Format
Exercise: Colored NxM-tile puzzle solution
A Java-based implementation of various search algorithms to solve a marble puzzle game. The program finds the optimal path to move colored marbles on a 3x3 board from an initial state to a goal state. The algorithms implemented: BFS, DFID, A*, IDA* and DFBnB
To associate your repository with the dfbnb topic, visit your repo's landing page and select "manage topics."