迷宮算法（maze）
/* Maze * Starting point is m[0][0], need to find a PATH go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest PATH, only need to find one PATH that gets
* you to desitination.
*/
標簽：
Starting
point
means
maze
上傳時間：
2013-12-27
上傳用戶：Divine
