document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1172762>Question 1172762</A>: <I><SPAN STYLE=\"word-break: break-all;\"> On an infinite chessboard a game is played as follows. At the start <IMG STYLE=\"max-width:80%;\" SRC=/cgi-bin/plot-formula.mpl?expression=n%5E2 ALIGN=MIDDLE  ALT=\"n%5E2\"   DISABLED_style= \"max-width:90%; height:auto;\" > pieces are arranged in an<BR>\n" );
document.write( "n x n block of adjoining squares, one piece on each square. A move in the game is a jump in a horizontal or vertical direction over an adjacent occupied square to an unoccupied square immediately beyond. The piece which has been jumped over is removed. Find those values of n for which the game can end with only one piece remaining on the board. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #797919 by </B><A HREF=/tutors/aboutme.mpl?userid=ikleyn><B>ikleyn(52781)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=ikleyn><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=ikleyn><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=797919\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> .\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "See the solution under these links\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "http://people.missouristate.edu/lesreid/POW12_01.html\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "http://people.missouristate.edu/lesreid/Sol12_01.html?\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );