An 8 Puzzle Solver Using Informed and Uninformed Search Algorithms.
Given an initial state of the board, the search problem is to find a sequence of moves that
transitions this state to the goal state; that is, the configuration with all tiles arranged in ascending
order 0,1,2,3,4,5,6,7,8. - BFS
- DFS
- A*(a) path to goal
(b) cost of path
(c) nodes expanded
(d) search depth
(e) running time