Requirements

You are to create a program in Python 3 only import numpy and queue that performs the following:

1. 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
2. Executes the A* algorithm with the Manhattan distance heuristic (as discussed in the textbook). The goal state is this configuration: 0 1 2 3 4 5 6 7 8
3. Displays the number of states that A* had to visit in order to get to the solution.