%0 Journal Article %T Counting the Number of Squares Reachable in k Knight¡¯s Moves %A Amanda M. Miller %A David L. Farnsworth %J Open Journal of Discrete Mathematics %P 151-154 %@ 2161-7643 %D 2013 %I Scientific Research Publishing %R 10.4236/ojdm.2013.33027 %X

Using geometric techniques, formulas for the number of squares that require k moves in order to be reached by a sole knight from its initial position on an infinite chessboard are derived. The number of squares reachable in exactly k moves are 1, 8, 32, 68, and 96 for k = 0, 1, 2, 3, and 4, respectively, and 28k ¨C 20 for k ¡İ 5. The cumulative number of squares reachable in k or fever moves are 1, 9, 41, and 109 for k = 0, 1, 2, and 3, respectively, and 14k2 ¨C 6k + 5 for k ¡İ 4. Although these formulas are known, the proofs that are presented are new and more mathematically accessible then preceding proofs.

%K Counting %K Knight¡¯s Moves %K Infinite Chessboard %K Geometric Argument %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=34513