Can you Solve the Knight's Tour Math Problem?

  • 3 years ago · Quote · #2


    I solved this a while ago too, even for bigger boards:

    In a 15x15 board:



  • 3 years ago · Quote · #3


    Very cool

  • 3 years ago · Quote · #4


    Thanks, not going to bed until I do this.

  • 3 years ago · Quote · #5


    Thanks Gerry! Awesome.

    (Disclaimer: did start trying before my first message).

  • 3 years ago · Quote · #6


    Sounds fun, don't know if I have time.

  • 3 years ago · Quote · #7


    Another idea is when breaking the board down into quadrants, is to also devise patterns based on easily recognizable shapes and then determine a pattern based on those shapes.

    Here is an example:

    You can envision the Knights making a diamond-shaped pattern by the moves from a8-b6-d5-c7 and a square being made from the moves a6-b8-d7-c5. Now, if these could be repeated in a particular way, you could travel in all four quadrants and reach all 64 squares from starting on a8 and ending on h6 having to familiarize yourself with only four moves at a time.

    Next think of the upper left quadrant as 1, the lower left 2, lower right 3, and upper right as 4 and the most complex of these patterns is the formation of Diamond, Square, Square, Diamond followed by Square, Diamond, Diamond, Square.

    Putting the two concepts together we get:


    D1, S1, S2, D2, S3, D4, D3, S3, D2, S2, S1, D1, S4, D3, D4, S4.

    Here is the pattern over the board:

    This is the most complex of the patterns I have found aside from the Euler's Square. I was able to work out 3 other patterns as well, those being:




    See if you can find the patterns of the Knights moves into the quadrants in these.

  • 3 years ago · Quote · #8


    Nice way to understand it, thanks CN :-)

  • 3 years ago · Quote · #9


    no idea!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Back to Top

Post your reply: