Analytical Study of the A* Heuristic Search Algorithm Used to Solve Efficiently a Puzzle Game
Polyhedra (prisms, pyramids, or pyramidal frustums) can be moved using the available open spaces in the puzzle game given in this paper. The challenge necessitates determining the smallest number of movements required for the game to go from its original configuration to a goal configuration. The main difficulty in addressing the problem is due to…
Read more