<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJDM</journal-id><journal-title-group><journal-title>Open Journal of Discrete Mathematics</journal-title></journal-title-group><issn pub-type="epub">2161-7635</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojdm.2013.33027</article-id><article-id pub-id-type="publisher-id">OJDM-34513</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Counting the Number of Squares Reachable in k Knight’s Moves
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>manda</surname><given-names>M. Miller</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>David</surname><given-names>L. Farnsworth</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Mathematical Sciences, Rochester Institute of Technology, Rochester, USA</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>amm2838@alum.rit.edu(MMM)</email>;<email>DLFSMA@rit.edu(DLF)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>02</day><month>07</month><year>2013</year></pub-date><volume>03</volume><issue>03</issue><fpage>151</fpage><lpage>154</lpage><history><date date-type="received"><day>April</day>	<month>30,</month>	<year>2013</year></date><date date-type="rev-recd"><day>May</day>	<month>31,</month>	<year>2013</year>	</date><date date-type="accepted"><day>June</day>	<month>15,</month>	<year>2013</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
   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 – 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 14k<sup>2</sup> – 6k + 5 for k ≥ 4. Although these formulas are known, the proofs that are presented are new and more mathematically accessible then preceding proofs. 
 
</p></abstract><kwd-group><kwd>Counting; Knight’s Moves; Infinite Chessboard; Geometric Argument</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Besides the game of chess, applications of knight’s moves include creating magic squares [1,2, pp. 53-63], recognizing patterns [<xref ref-type="bibr" rid="scirp.34513-ref3">3</xref>], identifying chemically similar elements in the periodic table [4,5, pp. 272-275, 325], and digital distance measurement [3,6,7].</p><p>We obtain formulas for the number of squares reachable by a knight on an infinite chessboard in a minimum of k moves and for the cumulative number of squares that the knight can reach in k moves. Our arguments are mainly geometric and have the advantage of being relatively elementary. These formulas are known, but our proofs are new and more mathematically accessible then currently available proofs, which are referenced in Section 3.</p><p>The knight moves in a way that is much different from the other chess pieces. A valid move is two squares left, right, up, or down, followed by one square in a direction perpendicular to the two squares. The eight squares that are available in one move to the knight K are indicated with 1s in <xref ref-type="fig" rid="fig1">Figure 1</xref>. Coordinates can be imposed on the infinite chessboard. Let r be the row coordinate and c be the column coordinate of the squares. The coordinates are integers. Each knight’s move consists of adding or subtracting 2 from one coordinate and adding or subtracting 1 from the other coordinate. The knight is initially at<img src="8-1200157\8e71d25b-d5b9-428a-bd92-30bf1de67e86.jpg" />.</p><p>By coloring the squares alternatively white and black, starting with black in<img src="8-1200157\4ca80d62-d6a5-4133-89a9-f557b45c48e9.jpg" />, parity arguments can be made, since a knight always moves to a square of a color different from the color of the square upon which it resides. For a knight initially at<img src="8-1200157\3d9300d6-0503-4ad7-be78-f43d3da4d0e8.jpg" />, if r + c is even, then the square is black and the square’s value of k is even. If r + c is odd, then the square is white and the square’s value of k is odd.</p><p><xref ref-type="fig" rid="fig2">Figure 2</xref> contains rows and columns –12 to 12 of the infinite chessboard. The entries are the minimum number of knight’s moves that are required by the knight K to reach each square. The numbers were obtained by counting and are easily checked. In addition to the symmetries with respect to row 0 and to column 0, the two main diagonals are lines of symmetry on the whole board. The shading of the squares in <xref ref-type="fig" rid="fig2">Figure 2</xref> is used in Section 2.</p></sec></body><back><ref-list><title>References</title><ref id="scirp.34513-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">B. A. Balof and J. J. Watkins, “Knight’s Tours and Magic Squares,” Congressus Numerantium, Vol. 120, No. 1, 1996, pp. 23-32.</mixed-citation></ref><ref id="scirp.34513-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">J. J. Watkins, “Across the Board: The Mathematics of Chessboard Problems,” Princeton University Press, Princeton, 2004.</mixed-citation></ref><ref id="scirp.34513-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">P. P. Das and B. N. Chatterji, “Knight’s Distance in Digital Geometry,” Pattern Recognition Letters, Vol. 7, No. 4, 1988, pp. 215-226. doi:10.1016/0167-8655(88)90105-5</mixed-citation></ref><ref id="scirp.34513-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">W. M. Hexana and N. J. Coville, “Indium as a Chemical Promoter in Fe-Based Fischer-Tropsch Synthesis,” Applied Catalysis A: General, Vol. 377, No. 1, 2010, pp. 150-157. doi:10.1016/j.apcata.2010.01.031</mixed-citation></ref><ref id="scirp.34513-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">E. R. Scerri, “The Periodic Table: Its Story and Its Significance,” Oxford University Press, Oxford, 2007.</mixed-citation></ref><ref id="scirp.34513-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">P. P. Das, “An Algorithm for Computing the Number of the Minimal Paths in Digital Images,” Pattern Recognition Letters, Vol. 9, No. 2, 1989, pp. 107-116.  
doi:10.1016/0167-8655(89)90043-3</mixed-citation></ref><ref id="scirp.34513-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">J. Mukherjee, P. P. Das, M. Aswatha Kumar and B. N. Chatterji, “On Approximating Euclidean Metrics by Digital Distances in 2D and 3D,” Pattern Recognition Letters, Vol. 21, No. 6-7, 2000, pp. 573-582.  
doi:10.1016/S0167-8655(00)00022-2</mixed-citation></ref><ref id="scirp.34513-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">M. Katzman, “Counting Monomials,” Journal Algebraic Combinatorics, Vol. 22, No. 3, 2005, pp. 331-341.  
doi:10.1007/s10801-005-4531-6</mixed-citation></ref><ref id="scirp.34513-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">N. J. A. Sloane, “On-Line Encyclopedia of Integer Sequences,” 2013. http://www.oeis.org</mixed-citation></ref></ref-list></back></article>