Chess problem

Topic

New Reply

Yes it can…

Reply | Quote

Replies

Well go on smarty pants, prove it

Reply | Quote

Actually, no I don’t think you can- you end up leaving one of the grey squares in the centre…

At least I know ONE of my answers is correct!

Reply | Quote

You’ve got it – more or less.
The knight starts out on a white square; whatever move he makes, he will land on a grey square, then on a white square again etc.
So squares 1, 3, 5, .. will be white and squares 2, 4, 6, … will be grey. After 14 steps, he would have been on 8 white squares (including the starting point) and 7 grey squares, but the board contains 7 white and 8 grey squares. Contradiction!

Reply | Quote

The attached image depicts a miniature chess board. The happy face is a knight ( sorry couldn’t find a suitable image for a horse)

Using standard rules on how a knight moves on a board, make the knight visit every square on the board once and only once. Currently he is on square 1, the next square he lands on will be 2…etc

Can this be done?

I have changed the image over. My apologies, I was going to use the other one for a different puzzle

Reply | Quote

Jezza

Is this not a cut-down version of the standard Knight’s Tour?

John

PS which is said here not to be possible for a 3×5 board…

Reply | Quote

Hi John

Grrrr… Yes it is. You stole my fun for Chess problem 2 which was the 5 x 5

Reply | Quote

No, sorry — if you believe several websites which say that the knight’s tour for a 3 x n board is possible only for n >= 7…

John

Reply | Quote

i got it down to the last grey square (mid right)

Reply | Quote

(Edited by Rudi on 13-Apr-05 16:10. Only to find out that it ain’t possible…(that was nasty!)= Grrrrrrrrrrrr)

After about 20 attempts, the closest I’ve come is 3 squares open

Reply | Quote