Code for Breadth first search, uniform cost search, greedy best first search and A* algorithms to solve the 8 puzzles 3 x 3