For this problem set you will implement, in NetLogo, the 8-puzzle along with its automatic solution. You can either solve it using asynchronous dynamic programming or LRTA*, your choice.
Your program should have a graphical display of the tiles as they move around as well as a way to show the agents' local variable values. You can use the "label" turtle variable, the monitors, or the text output area, as you see fit. Your main goal is to make it look pretty for the user so that he can understand how the algorithm is working.
Hint: You can look at my n-queens netlogo programs to see how I did the queens. Basically, I reduced the size of the grid, which made the turtles much bigger.
Bonus: 5 extra points if you implement the n-puzzle, for grids from 2x2 to 20x20.
As will all the problem sets, you will hand them in using our department's dropbox. You are to hand only one .nlogo file. Your file should contain:Name: