Neural network computing for knight's tour problems

Yoshiyasu Takefuji, Kuo Chun Lee

研究成果: Article

11 引用 (Scopus)

抜粋

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

  • Computer Science Applications
  • Cognitive Neuroscience
  • Artificial Intelligence

フィンガープリント Neural network computing for knight's tour problems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用