Neural network computing for knight's tour problems

Yoshiyasu Takefuji; Kuo Chun Lee

doi:10.1016/0925-2312(92)90030-S

Neural network computing for knight's tour problems

Yoshiyasu Takefuji, Kuo Chun Lee

Faculty of Environment and Information Studies

Research output: Contribution to journal › Article › peer-review

12 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 language	English
Pages (from-to)	249-254
Number of pages	6
Journal	Neurocomputing
Volume	4
Issue number	5
DOIs	https://doi.org/10.1016/0925-2312(92)90030-S
Publication status	Published - 1992 Aug

Keywords

Knight's tour problems
combinatorial optimization
neural networks
parallel algorithms

ASJC Scopus subject areas

Computer Science Applications
Cognitive Neuroscience
Artificial Intelligence

Access to Document

10.1016/0925-2312(92)90030-S

Cite this

@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 = "Knight's tour problems, combinatorial optimization, neural networks, parallel algorithms",

author = "Yoshiyasu Takefuji and Lee, {Kuo Chun}",

year = "1992",

month = aug,

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/8

Y1 - 1992/8

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 - Knight's tour problems

KW - combinatorial optimization

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

AN - SCOPUS:0026910751

SN - 0925-2312

VL - 4

SP - 249

EP - 254

JO - Neurocomputing

JF - Neurocomputing

IS - 5

ER -

Neural network computing for knight's tour problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this