To implement A* Algorithm to solve the following problems (i.e. find the goal): to select either 1) N-Queen or 2) 8-puzzle. Plus, one problem of your choice. 1) N-Queen (N should be greater than or equal to 8): 2) 8 Puzzle Problem: The 8 puzzle consists of eight numbered, movable tiles set in a 3x3 frame. One cell of the frame is always empty thus making it possible to move an adjacent numbered tile into the empty cell. Such a puzzle is illustrated in following diagram.

The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves, such as move tiles 5 to the right, move tile 7 to the left, move tile 6 to the down, etc.

need help understanding the proper code for this problem