An efficient algorithm for the Knight's tour problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the Knight's tour problem
zbMATH Open document ID: 0866.68079
DOI: 10.1016/S0166-218X(96)00010-8
author: Ian Parberry
published in: Discrete Applied Mathematics
publication date: 1997-07-06T00:00:00Z
full work available at URL: dam
review text: We describe a new, simple, and fast algorithm for constructing knight's tours on square boards.
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1004421
zbMATH Keywords: knight's tours
Wikidata QID: Q56069811
MaRDI profile type: Publication
cites work: Q4055298
cites work: Solution of the knight's Hamiltonian path problem on chessboards
cites work: Q4172083
cites work: Q3317138
cites work: Q5724751
cites work: Q3997326
cites work: The Knight's Tour on the 15-Puzzle
cites work: Q4385522
cites work: Q4002466
cites work: Q3484350
cites work: Which Rectangular Chessboards Have a Knight's Tour?
cites work: Mesh-Connected Computers with Broadcasting
cites work: Q4003539
cites work: Neural network computing for knight's tour problems
description: scientific article; zbMATH DE number 1004421