Question

If a knight starts out on square A1, can it land on every square exactly once and end on square H8?

Answer 1

I definitely want to see how this is done. I have no clue.

Answer 2

http://en.wikipedia.org/wiki/Knight%27s_tour

Answer 3

So a knight lands on a white square, then a black square, then a white square, right? Well, the board has 64 squares. If it has to end on square H8, then it has to be a white square because A1 is a black square and 64 is an even number. However, H8 is a black square. So the answer is no.

Answer 4

Mathmate, the knight can definitely visit all of the squares. But in this case, the knight is starting on a specific square and ending on a specific square :)

Answer 5

Sorry, I didn't read the constraints! I agree with your answer.

Answer 6

That is so very elegant.

Answer 7

Tracy, are you doing combinatorics?

Answer 8

wow