EventHorizon Posted June 19, 2008 Report Share Posted June 19, 2008 Show that a knight can move on a chessboard to every space exactly once. (you do not need to end on the space you begin on....but bonus points if you can!) Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 ummmm. . . someone go first Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 uhh i somewhat can show but i dont no how to make a chess board on the computer to show Quote Link to comment Share on other sites More sharing options...
0 EventHorizon Posted June 19, 2008 Author Report Share Posted June 19, 2008 uhh i somewhat can show but i dont no how to make a chess board on the computer to show Yeah....it would definitely take an uploaded picture to show it. A sequence of moves would simply be too long and hard to tell if it is correct. Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 u can make a chess board from excel and indicate the moves as shown below. 3 5 2 14 switch to rich text editor to post Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 u can make a chess board from excel and indicate the moves as shown below. 3 5 2 14 switch to rich text editor to post opps sorry, didnt work hehehe Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 (edited) Edited June 19, 2008 by Chuck Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 touche chuck Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 Can you prove from starting anywhere to cover all squares - it does work no mater where you start ie there are sixty four answers Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 Can you prove from starting anywhere to cover all squares - it does work no mater where you start ie there are sixty four answers Actually that one answer works for all 64. Since it starts and ends in the same place, it is a loop, and therefore you could start anywhere along that loop. That means the knight could start on any of the 64 squares and follow that same path and end on the same square. So the previous answer does cover all squares, you only need one answer that loops. Quote Link to comment Share on other sites More sharing options...
0 EventHorizon Posted June 19, 2008 Author Report Share Posted June 19, 2008 Very nice...though it seems you didn't come up with it yourself. Nice googleing though Quote Link to comment Share on other sites More sharing options...
0 Guest Posted June 19, 2008 Report Share Posted June 19, 2008 Actually that one answer works for all 64. Since it starts and ends in the same place, it is a loop, and therefore you could start anywhere along that loop. That means the knight could start on any of the 64 squares and follow that same path and end on the same square. So the previous answer does cover all squares, you only need one answer that loops.True - what was i thinking ??? Loosing it in space will have to be my new name Quote Link to comment Share on other sites More sharing options...
Question
EventHorizon
Show that a knight can move on a chessboard to every space exactly once. (you do not need to end on the space you begin on....but bonus points if you can!)
Link to comment
Share on other sites
11 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.