Implement A* search algorithm. Upload your source code and the final grid image with the shorted path in this project report.

The following figure contains a robot, a door, and six chairs, each of them takes one grid. The figure also contains 10 by 10 = 100 grids. The robot need to avoid six chairs and find out a shortest path to the door. For each step of the A* search, the robot can only move to one neighbor grid of 8 neighbors (east, southeast, south, southwest, west, northwest, north, and northeast).

You can reference A* search algorithm: http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html

For reference code of programming languages of C++, Java, Javascript, Python, Objective C +, Lua, Ruby, C#, and Processing, you can reference the webpage:

http://theory.stanford.edu/~amitp/GameProgramming/ImplementationNotes.html#code

(Hint: can use a 10 x 10 matrix for modeling the 10 x 10 grids. Each element in the matrix is relevant to a grid in the picture. After the A* search, visualize this matrix to show the shortest path.)