Generalized knight's tour on 3D chessboards

被引:6
作者
Bai, Sen [1 ]
Yang, Xiao-Fan [2 ]
Zhu, Gui-Bin [1 ]
Jiang, De-Lei [1 ]
Huang, Jian [1 ]
机构
[1] Chongqing Commun Inst, Dept Informat Engn, Chongqing 400035, Peoples R China
[2] Chongqing Univ, Coll Comp Sci & Engn, Chongqing 400035, Peoples R China
关键词
Generalized knight's tour; 3D chessboard; Hamiltonian graph;
D O I
10.1016/j.dam.2010.07.009
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In [G.L. Chia, Siew-Hui Ong, Generalized knight's tours on rectangular chessboards, Discrete Applied Mathematics 150 (2005) 80-98], Chia and Ong proposed the notion of the generalized knight's tour problem (GKTP). In this paper, we address the 3D GKTP, that is, the GKTP on 3D chessboards of size L x M x N, where L <= M <= N. We begin by presenting several sufficient conditions for a 3D chessboard not to admit a closed or open generalized knight's tour (GKT) with given move patterns. Then, we turn our attention to the 3D GKTP with (1, 2, 2) move. First, we show that a chessboard of size L x M x N does not have a closed GKT if either (a) L <= 2 or L = 4, or (b) L = 3 and M <= 7. Then, we constructively prove that a chessboard of size 3 x 45 x 4t with s >= 2 and t >= 2 must contain a closed GKT. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1727 / 1731
页数:5
相关论文
共 11 条
[1]  
BAI S, P 2006 INT C COMP 1, P570
[2]  
Ball W. W .R., 1974, MATH RECREATIONS ESS, P175
[3]   Generalized knight's tours on rectangular chessboards [J].
Chia, GL ;
Ong, SH .
DISCRETE APPLIED MATHEMATICS, 2005, 150 (1-3) :80-98
[4]  
Kumar A., 2006, GAMES PUZZLES J
[5]   Bounds on the number of knight's tours [J].
Kyek, O ;
Parberry, I ;
Wegener, I .
DISCRETE APPLIED MATHEMATICS, 1997, 74 (02) :171-181
[6]  
LEE KC, 1994, IEEE T SYST MAN CYB, V24, P300
[7]   Optimal algorithms for constructing knight's tours on arbitrary nxm chessboards [J].
Lin, SS ;
Wei, CL .
DISCRETE APPLIED MATHEMATICS, 2005, 146 (03) :219-232
[8]   Scalability of a neural network for the knight's tour problem [J].
Parberry, I .
NEUROCOMPUTING, 1996, 12 (01) :19-33
[9]   An efficient algorithm for the Knight's tour problem [J].
Parberry, I .
DISCRETE APPLIED MATHEMATICS, 1997, 73 (03) :251-260
[10]  
Qing Y., 2006, Congressus Numerantium, V181, P41