Formula for Squares Reachable by a Knight with (2, b)–Knight’s Move for b ∈ {2 ,4, 6, 8}

Main Article Content

Ratinan Boonklurb Aimboon Niamnoy Ratree Theprod


The m x n chessboard is an array with squares arranged in m rows and n columns. If m -> \infty and n -> \infty , then it is called an infinite chessboard. An (a, b)-knight’s move is a move from square to square by moving a knight passing a squares vertically or a squares horizontally and then passing b squares at 90 degrees angle. In this article, we consider the (2, b)-knight’s move where b \in \{2, 4, 6, 8\} and obtain formula for the number of squares reachable by a knight with the (2, b)-knight’s move where b \in \{2, 4, 6, 8\} on an infinite chessboard and the cumulative number of squares that the knight can reach in k moves.


Article Details

How to Cite
Research Article


[1] Chai, G.L. and Ong, S.-H. (2005). Generalized Knight’s tours on rectangular chessboard, Discrete Applied Math, 150, p. 80-89.
[2] Miller, A.M. and Farnsworth, D.L. (2013). Counting the number of squares reachable in k knight’s move, Open J. of Discrete Math, 3, p. 151-154.
[3] Theprod, R. (2018). Formula for Number of squares Reachable by a Knight [Master Thesis] Bangkok : Ramkhamhaeng university.