1. 105-1 Data Structure Homework 1
2016/10/18

2. Mazing problem 0 : though path 2 : though path 1 : blocked path
N、W、S、E、NW、SW、SE、NE
2 : though path
N、W、S、E
1 : blocked path
You can’t walk this road

3. Mazing problem

4. Mazing problem

5. Mazing problem
3 * * * * * * * * * * 3 * * * * * * * * * * 3 3 * * * * * * * * * * 3 * * * * * * * * * * 3 * * * * * * * * * * 3 3 * * * * * * * * * * 3 3

6. Mazing problem Design a maze (15x15) Find the path to exit (80%)
Random
Find the path to exit (80%)
Print the original array (1)
Print the result array with the path (2)
Replace the value on the path to 3
Replace remained element to *
If it is the shortest path (20%)
Show the shortest path length (3)
Use stack
Do not use recursive function

7. Mazing problem Send code and result (printscreen) Deadline 11/1 18:00
Deadline 11/1 18:00
(HW1) 學號 系級 名字

8. The end
Thanks for your time