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

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

Mazing problem 0 1 0 2 0 1 1 0 1 0 1 0 0 2 1 2 1 0 2 1 0 1 0 1 1 2 0 2 1 0 1 0 2 1 0 1 2 0 2 0 0 2 2 0 2 1 1 0 1 0 0 1 1 0 2 0 2 1 2 2 1 2 0 1 0 1 0 1 0 0 0 2 0 1 1 2 1 0 1 2 1 0 1 0 1 2 2 0 1 2 2 1 2 0 2 0 1 1 2 0

Mazing problem 3 1 0 2 0 1 1 0 1 0 1 3 0 2 1 2 1 0 2 1 3 1 0 1 1 2 0 2 1 0 1 3 2 1 0 1 2 0 2 0 0 2 3 3 2 1 1 0 1 0 0 1 1 0 3 0 2 1 2 2 1 2 0 1 3 1 0 1 0 0 0 2 0 1 1 3 1 0 1 2 1 0 1 0 1 2 3 3 1 2 2 1 2 0 2 0 1 1 3 3

Mazing problem 3 * * * * * * * * * * 3 * * * * * * * * * * 3 3 * * * * * * * * * * 3 * * * * * * * * * * 3 * * * * * * * * * * 3 3 * * * * * * * * * * 3 3

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

Mazing problem Send code and result (printscreen) Deadline 11/2 21:00 nchuwccclab@gmail.com Deadline 11/2 21:00 (在職專班)(HW1) 學號 名字

The end Thanks for your time