<p>There is a famous puzzle called the <a href="http://en.wikipedia.org/wiki/Knight%27s_tour">Knight's Tour</a> in which the aim is to visit every square exactly once.  Since this has several solutions, the answer to your question is that it can visit all 64 squares.</p>

CC BY-SA 3.0
2011-06-20T13:53:04.263Z
Questions are expected to relate to board games. (This one barely is.) They shouldn't be "too local," but chess is a global game. They are expected to have a reasonably objective answer acceptable to most people, which I believe this one does.If you want to know whether this, or any other question is on/off topic, the place to ask is on meta.
Tom Au
CC BY-SA 3.0
2011-06-20T14:19:57.537Z
Ok, thanks; I wasn't sure who to ask.  Sorry for the newbie-ness!
Daniel
CC BY-SA 3.0
2011-06-20T14:25:18.050Z
Thanks for the link!  The animated wikipedia solution is not intuitively obvious.
Daniel
CC BY-SA 3.0
2011-06-20T13:00:34.537Z
2011-06-20T13:00:34.537Z
tttppp
<p>How many Knight moves is it possible to execute on an empty chess board before the Knight lands on a square it has already landed on in its previous moves?  The most I've ever been able to land on was 54 squares, usually 50-52.</p>

CC BY-SA 3.0
2011-06-20T13:02:00.527Z
Meta discussion migrated here: http://meta.boardgames.stackexchange.com/questions/492/is-this-puzzle-on-topic
tttppp
<chess><puzzles>
How far can a knight travel without visiting the same square twice?
Daniel
# How far can a knight travel without visiting the same square twice?

(Asked by: username_0 on 2011-06-20)

How many Knight moves is it possible to execute on an empty chess board before the Knight lands on a square it has already landed on in its previous moves? The most I've ever been able to land on was 54 squares, usually 50-52.

**Tags:** chess, puzzles

> **Comments:**
> **username_1**: Meta discussion migrated here: http://meta.boardgames.stackexchange.com/questions/492/is-this-puzzle-on-topic  

---

## 1 answers

### Answer by username_1 on 2011-06-20. Score: 11 | Accepted answer

There is a famous puzzle called the [Knight's Tour](http://en.wikipedia.org/wiki/Knight%27s_tour) in which the aim is to visit every square exactly once. Since this has several solutions, the answer to your question is that it can visit all 64 squares.

> **Comments:**
> **username_2**: Questions are expected to relate to board games. (This one barely is.) They shouldn't be "too local," but chess is a global game. They are expected to have a reasonably objective answer acceptable to most people, which I believe this one does.If you want to know whether this, or any other question is on/off topic, the place to ask is on meta.  
> **username_0**: Ok, thanks; I wasn't sure who to ask.  Sorry for the newbie-ness!  
> **username_0**: Thanks for the link!  The animated wikipedia solution is not intuitively obvious.  

---

