騎士旅行和N －皇后是非常著名的問題．傳統上，這些問題都是先將一個騎士（或皇
后）在一個 n×n 的棋盤上按照棋盤規則隨機的移動，然後當最後的步驟無法得到答
案時，便應用backtracking的技巧，求出解答．
利用上述的方法，所花費的時間將成指數般的增加．當n 變大時，這些問題幾乎無法
求得出解答．因此，在本文中我們提出一些不須要backtracking且較具智慧性的方法
，可解決大部份的騎士旅行和N －皇后問題．

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 time complexity of using this method grows almost exponentially. As n becomes large, these problems are almost impossibly solved. Therefore, in this paper we present some intelligent methods without backtracking to solve both the Knight-tour and N-Queen problems for most cases of N.

本論文主要參考文獻：
〔１〕Wirth, N., (1976) "Algorithms + Data Structures = Programs" Chapter
3, pp.137-147. Prentice-Hall, Inc.
〔２〕Ellis Horowitz and Sartaj Sahni, "Fundamentals of Computer Algorith-
ms " (1978) Chapter 7 , pp.323-339, Computer Science press, Inc.
〔３〕M,Behzad. G,Chartrand and L,Lesniak-foster "Graphs ＆ Digraphs " (1
979) Chapter 7 . Wadsworth, Inc.
〔４〕N,Deo. (1974) "Graph Theory with Applications To engineering And Co-
mputer Science " Chapter 8, Prentice-Hall, Inc.
〔５〕Wirth, N.,"program Development by Stepwise Refinement, "Comm.ACM,14,
No.4(1971),221-27.