Implementing A*, Greedy Best First, and Uniform Cost state-space search algorithms to solve the 8-puzzle game (and some variations)
-
Updated
Nov 27, 2020 - Jupyter Notebook
Implementing A*, Greedy Best First, and Uniform Cost state-space search algorithms to solve the 8-puzzle game (and some variations)
To associate your repository with the random-puzzles topic, visit your repo's landing page and select "manage topics."