domingo, 28 de septiembre de 2014
Tuesday, September 23rd, 2014
SDP03 Exercise 03
By: Eduardo Zavala Ramírez
We solved the exercise 03 of the iCarnegie course. It was not necessary either to use a computer nor a write a only code line. The fact is that the objective of the exercise was to practice algorithms to solve a maze applying some rules to move the point. The most important rules were that if the object goes a place ahead or backwards, it has to leave a mark (footprint) which is really a number to be able to count how many times the maze runner passed over each place.
The document, already solved, looks like this:
DIAGRAMA 1: UN LABERINTO
+------------G--+--+
| | |
| +--+ +-+------++ |
| | | | |
| |
| | ++ | | +---+ | |
| | ++ | | | | | |
| | | | | | | | |
| +--+-+ | +-+ | | |
| | |
| | | |
| +- | + +-----+ | |
| | |
| |
+--- | | +-----+ | |
| | | |
| | |
| +- | | | ----+ | |
| | | | |
| |
| +--+ | | ------+ |
| | |
| |
+------+ +-------+ |
| |
+S-----------------+
En el siguiente espacio, escriba los pasos de cada uno
de los procedimientos probados.
Ejemplo:
1. Entrar al laberinto avanzando a la celda de arriba
2. Girar a la derecha, avanzar 18 celdas
3. Girar hacia arriba y avanzar 5 celdas
4. <continuar describiendo la trayectoria>
Por cada procedimiento, integrar la figura del
laberinto en la que se muestren los valores de las marcas de tiza.
Para hacer las pruebas, puede imprimir el formato que
he preparado con una mejor y clara representación de las celdas, paredes y
posiciones de la entrada y la meta.
Resultados
Procedimiento 1:
1. …↑
2. …→
3. …←
4. …↓
Procedimiento 2:
1. …←
2. …↑
3. …→
4. …↓
Procedimiento 3:
1. …→
2. …↑
3. …↓
4. …←
We designed the structure of directions to solve the maze, we also tested them and we found the second procedure like the most efficient set of steps to solve it.
