Question: you will implement the a algorithm to solve the sliding...
you will implement the A* algorithm to solve the sliding tile puzzle game. Your goal is to return the instructions for solving the puzzle and show the configuration after each move.
You are to create a program in Python 3 that performs the following:
- Loads the mp1input.txt file from the current directory. This
represents the starting state of the sliding puzzle. The format of
this file is composed of 3 rows of 3 values, each value separated
by a single space. The values are the integers 0 through 8 that
represent the puzzle. The 0 integer represents an empty space (no
tile). Here is an example of the input file contents:
3 1 2
4 7 5
0 6 8
- Displays heading information to the screen:
MP1: A* for Sliding Puzzle
SEMESTER: [put semester and year here]
NAME: [your name here]
- Executes the A* algorithm with the Manhattan distance heuristic
(as discussed in the textbook). The goal state is this
0 1 2
3 4 5
6 7 8
- Shows the solution in form of the puzzle configurations after each move, the move number, and the action taken. This format should match the sample output shown on the last page.
Displays the number of states that A* had to visit in order to get to the solution
- The name of your source code file should be mp1.py. All your code should be within a single file.
- You can only import numpy and queue packages.
- Your code should follow good coding practices, including good use of whitespace and use of both inline and block comments.
- You need to use meaningful identifier names that conform to standard naming conventions.
- At the top of each file, you need to put in a block comment with the following information: your name, date, course name, semester, and assignment name.
- The output should exactly match the sample output shown on the last page. Note that for a different input state, the output may be different. I will be testing on a different input than shown in the sample.