Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

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

http://home.t-online.de/home/b_c.kuss/mgard.JPG

Anyone know how to continue this? Thanks!

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Knight moves

**Physics Forums | Science Articles, Homework Help, Discussion**