miércoles, 1 de octubre de 2014
September 30th, 2014
iCarnegie Project 01
Maze Runner
Today's activity was to solve the iCarnegie Project 01 in which the aim was to make the maze runner to leave the start line in order to get to the finish line. This will be solved through the algorithm that specifies the directions (upwards, downwards, left, and right) that the maze runner will follow.
The code lines were already started by iCarnegie developers, our task was to complete the code so that the application works properly.
- The first thing we do was to analyze the code lines and to run the application to see the result and discover what we could do to improve it.
- Then, we opened our four exercise projects to identify the methods that we might use in order to solve the errors and to add the functionality.
- According to the instructions, we placed our code lines in the pointed places.
- We ran the program several times and we could get the aim, that the maze runner (in a three-asterisk form) would walk through the paths and, finally, could get the finish line.
- We verified that the order of the movement methods was indispensable to determinate how fast or how slow the maze runner solved the maze. So, we tried different ways to order the direction methods and, finally, we found a very useful algorithm that goes from the start line up to the finish line without returning or walking onto the same place more than once.
Throughout the activity, we discovered how to use the methods and apply the logical structure to solve the problem.
