I need to solve an N-Puzzle using a list of different search methods: A*, uniform cost, breadth-first, depth-first, and greedy-best first (tree and graph search for each typ
