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」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル