DocumentCode
493527
Title
An Efficient Algorithm for the Generalized (1,k)-Knight´s Tours Problem
Author
Jian, Huang ; Sen, Bai
Author_Institution
Image Commun. Lab., ChongQing Commun. Inst., ChongQing
Volume
1
fYear
2009
fDate
7-8 March 2009
Firstpage
697
Lastpage
701
Abstract
Knightpsilas tours are a fascinating subject. In [Discrete Appl. Math 150 (2005) 80-98], G.L.Chia and Siew-Hui Ong have presented generalized knightpsilas tours problem for the first time. In this paper, (i) we research the least chessboard (defined in Section 2) of (a,b)-knightpsilas tours (Section 3). (ii) we present an algorithm to (1,k)-knightpsilas tours which runs in O(nm) (Section 4).
Keywords
combinatorial mathematics; computational complexity; generalized Knight tour problem; least chessboard; Computer networks; Computer science; Computer science education; Concurrent computing; Educational technology; Electronic mail; Image communication; Laboratories; Neural networks; Parallel algorithms; k)-knight´s tours; the least chessboard (1;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-3581-4
Type
conf
DOI
10.1109/ETCS.2009.161
Filename
4958865
Link To Document