Implemented Breadth First Search, Depth First Search, Greedy Breadth First Search, and A* to search for a solution to the sliding puzzle given various sizes and starting states. All starting states given are ensured to be solvable. 

The snippet of output to the right shows some test cases and displays the n x n size of the board, the initial state, the goal state, the search method, and some stats about the search tree.

These search tree stats in order are the depth of the solution found, the number of nodes created, the number of nodes expanded, and the highest encountered number of nodes in the fringe.