This program solves the 8-puzzle problem using heuristics and the following search algorithms: A* , IDA and Branch and Bound.
-
Updated
Apr 15, 2019 - Java
This program solves the 8-puzzle problem using heuristics and the following search algorithms: A* , IDA and Branch and Bound.
Add a description, image, and links to the brach-and-bound topic page so that developers can more easily learn about it.
To associate your repository with the brach-and-bound topic, visit your repo's landing page and select "manage topics."