An (1,2,2)-Closed Knight's Tour on the 3r x 4s x 4t Chessboard, where r ≥ 1 and s, t ≥ 2
Article Sidebar
Published:
Aug 27, 2020
Keywords:
a closed knight’s tour the chessboard
Main Article Content
Abstract
In this paper, a (1, 2, 2)-closed knight’s tour on the 3r × 4s × 4t chessbpard, where r ≥1 and
s, t ≥ 2, is obtained.
Article Details
How to Cite
Singhun, S., Sinna, A., & Yensuang, P. (2020). An (1,2,2)-Closed Knight’s Tour on the 3r x 4s x 4t Chessboard, where r ≥ 1 and s, t ≥ 2. Mathematical Journal by The Mathematical Association of Thailand Under The Patronage of His Majesty The King, 65(701), 49–64. Retrieved from https://ph02.tci-thaijo.org/index.php/MJMATh/article/view/210559
Section
Research Article
References
[1] Bai, S., Yang, X.-F., Zhu, G.-B., Jiang, D.-L. and Huang, J. (2010). Generalized
knight’s tour on 3D chessboards. Discrete Applied Mathematics, 158 (16),
p. 1727-1731.
[2] Chia, G.L. and Ong, S-H. (2005). Generalized Knight’s tours on rectangular
chessboards. Discrete Applied Mathematics, 150, p. 80-98.
[3] Lin, S.-S. and Wei, C.-L. (2005). Optimal algorithms for constructing knight’s
tour on arbitrary n x m chessboards. Discrete Applied Mathematics. 146,
p. 219-232.
[4] Schwenk, A.J. (1991). Which Rectangular Chessboards Have a Knight’s Tour?
Mathematics Magezine, 64(5), p. 325-332.
knight’s tour on 3D chessboards. Discrete Applied Mathematics, 158 (16),
p. 1727-1731.
[2] Chia, G.L. and Ong, S-H. (2005). Generalized Knight’s tours on rectangular
chessboards. Discrete Applied Mathematics, 150, p. 80-98.
[3] Lin, S.-S. and Wei, C.-L. (2005). Optimal algorithms for constructing knight’s
tour on arbitrary n x m chessboards. Discrete Applied Mathematics. 146,
p. 219-232.
[4] Schwenk, A.J. (1991). Which Rectangular Chessboards Have a Knight’s Tour?
Mathematics Magezine, 64(5), p. 325-332.