Neural network computing for knight's tour problems

Yoshiyasu Takefuji, Kuo Chun Lee

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

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
JournalNeurocomputing
Volume4
Issue number5
DOIs
Publication statusPublished - 1992

Fingerprint

Neural networks

Keywords

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

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cellular and Molecular Neuroscience

Cite this

Neural network computing for knight's tour problems. / Takefuji, Yoshiyasu; Lee, Kuo Chun.

In: Neurocomputing, Vol. 4, No. 5, 1992, p. 249-254.

Research output: Contribution to journalArticle

Takefuji, Yoshiyasu ; Lee, Kuo Chun. / Neural network computing for knight's tour problems. In: Neurocomputing. 1992 ; Vol. 4, No. 5. pp. 249-254.
@article{f397936d989842d387c2700608d3dec6,
title = "Neural network computing for knight's tour problems",
abstract = "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.",
keywords = "combinatorial optimization, Knight's tour problems, neural networks, parallel algorithms",
author = "Yoshiyasu Takefuji and Lee, {Kuo Chun}",
year = "1992",
doi = "10.1016/0925-2312(92)90030-S",
language = "English",
volume = "4",
pages = "249--254",
journal = "Neurocomputing",
issn = "0925-2312",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Neural network computing for knight's tour problems

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

KW - combinatorial optimization

KW - Knight's tour problems

KW - neural networks

KW - parallel algorithms

UR - http://www.scopus.com/inward/record.url?scp=0026910751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026910751&partnerID=8YFLogxK

U2 - 10.1016/0925-2312(92)90030-S

DO - 10.1016/0925-2312(92)90030-S

M3 - Article

VL - 4

SP - 249

EP - 254

JO - Neurocomputing

JF - Neurocomputing

SN - 0925-2312

IS - 5

ER -