Maze Solutions
The objective of this task is get the robot to travel from A to B in the either the shortest or fastest time possible. In the competition in video, the competitors must get their robot mouse to the end goal in the quickest time possible, which is not always the shortest route.
Students within the dynamic maze playground in Vex must determine how they must proceed in order to get from A to B in the fastest route possible. The primary direction is usually based on a trial and error route using a button switch or a sensor to determine the presence of walls. The difficultly comes from the dynamic nature of the maze which is refreshed each time. The solutions created in the video centre on graphing theory, which can be found in the python section of this site.
