Repository files navigation

N-puzzle solver with Search Algorithms including: BFS, DFS (with limited depth), Greedy and A*

There are 2 heuristics for Greedy and A* algorithms. The first one evaluates states with manhattan distance and the second one evaluates states with number of misplaced tiles.

First n should be entered and then the initial state of puzzle would be a list of numbers from 0 to (n*n)-1. An example of 8-puzzle with n = 3 is:

 initial_state = [1, 8, 2, 0, 4, 3, 7, 6, 5]

Note that if you want to work with n > 3, goal should be changed in State class.

Output of each search algorithm will be the puzzle solution, number of explored nodes and spent time for search.

BFS Solution is  ['Right', 'Up', 'Right', 'Down', 'Down', 'Left', 'Up', 'Right', 'Down']Number of explored nodes is  224BFS Time: 0.005887031555175781