On the Problems of N-queen and Finding the Knight''s Tour
碩士 === 國立成功大學 === 應用數學研究所 === 76 === The problems of Knight''s Tour and N-Queen are well known. Traditionally these problems are solved first by moving (placing) the knight (or Queen) at random then the technique of backtracking is applied when no further moves (placing) are allowed. The...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1988
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17957027963129182943 |