Using Uninformed & Informed Search Algorithms to Solve 8-Puzzle (n-Puzzle) in Python

An instance of the n-puzzle game consists of a board holding n 2-1 distinct movable tiles, plus an empty space. The tiles are numbers from the set 1,..,n 2-1. For any such board, the empty space may be legally swapped with any tile horizontally or vertically adjacent to it. In this assignment, the blank space is going to be represented with the number 0. Given an initial state of the board, the combinatorial 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,…,n 2 1. The search space is the set of all possible states reachable from the initial state.