以線性時間在10×n及其衍生之矩形棋盤上建構(1,4)-開放騎士路徑之演算法
碩士 === 國立臺灣師範大學 === 資訊工程研究所 === 98 === The knight’s tour problem has been studied for a very long period of time. The main purpose of the knight’s tour problem is to find out a series of moves made by a knight visiting every square of a chessboard exactly once. The knight’s tour problem has been sol...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93442785267946545630 |