NEW VERSION http://scratch.mit.edu/projects/nextstorm/1902159 -=MUST READ=- This maze solves itself. The smiley can eventually solve the maze, unless the maze is impossible (I don't really recommend making an impossible maze. Mr.Smiley can use karma against you.) Post your time in comments! THe longest time wins. -=INSTRUCTIONS=- On the panel to the right, there is a box that has white and black sections. Click on the sections to change its colour, and click in the middle of the box to change the tile type. Mr.Smiley will start from the green square, and will try to get to the red square. The colour in the middle of the box will change whether the tile placed will be a start or a finish tile, and the white and black lines will change the walls surrounding the tile. Press "GO" to release Mr.Smiley. To restart, click the green flag. -=HOW IT WORKS=- Mr.Smiley retrieves values from a list containing the number of times he has visited each tile, and he will go to the nearest tile with the least visits. It two or more tiles have the same amount of visits, he will go to the tiles in this order of preference: Down Right Left Up So be nice to Mr.Smiley. Added awesome SFX
