- Challenge
- Would you be able to produce all possible solutions for a given n
by slightly modifying our n-queen program?
- Homework -- The maze problem
- A maze is a m x n grid with blocked cells (walls are all blocked
cells too).
- A mouse is to enter the maze at (0,0) and exit at (m-1,n-1)
- A mouse can go either one of four possible directions(up, down,
left, right)
- This problem can be nicely done with recursion.
附圖略(太難畫了 哈哈)
--
浪漫的故事..
像是倒映在淡水的夜景...
一幕幕的..就此展開..浮散...
--
※ 發信站: 批踢踢實業坊(ptt.twbbs.org)
◆ From: 140.112.249.159