Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Knight moves

  1. Jun 26, 2003 #1
    Hi all,
    I found this problem in a Martin Gardner book. You have a chess board of n x n squares. How many moves m(n) can a chess knight make on this board without crossing or touching its own path?

    m(0) = 0
    m(1) = 0
    m(2) = 0
    m(3) = 2
    m(4) = 5
    m(5) = 10
    m(6) = 17
    m(7) = 24
    m(8) = 35

    [​IMG]

    Anyone know how to continue this? Thanks!
     
    Last edited: Jun 26, 2003
  2. jcsd
  3. Jun 26, 2003 #2
    Make a 9x9 board, and try it. You should be able to make more than 35 moves.
     
  4. Jun 27, 2003 #3
    How does it change also for a m x n board?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Knight moves
  1. Chess Moves (Replies: 8)

  2. A moving orbit ? (Replies: 5)

  3. Moving exponent (Replies: 2)

Loading...