Neural network computing for knight's tour problems

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticlepeer-review

12 Citations (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.

Original languageEnglish
Pages (from-to)249-254
Number of pages6
Issue number5
Publication statusPublished - 1992 Aug


  • Knight's tour problems
  • combinatorial optimization
  • neural networks
  • parallel algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Cognitive Neuroscience
  • Artificial Intelligence


Dive into the research topics of 'Neural network computing for knight's tour problems'. Together they form a unique fingerprint.

Cite this