抄録
This paper presents the first algorithm for finding a knight's tour on the general chessboard where the proposed algorithm is based on neural network computing. In the knight's tour problem a knight must traverse all of the squares on an m × n chessboard but visit every square once and only once and return to the originated square where the knight moves in an L-shape route.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 249-254 |
| ページ数 | 6 |
| ジャーナル | Neurocomputing |
| 巻 | 4 |
| 号 | 5 |
| DOI | |
| 出版ステータス | Published - 1992 8月 |
ASJC Scopus subject areas
- コンピュータ サイエンスの応用
- 認知神経科学
- 人工知能