I've just been listening to Quentin Cooper discussing mathematical problems, with special reference to chess. One problem was called the 'Knight's Tour', but it was not said (or I missed it) whether it could be done or indeed has been solved. Does anyone know of an answer?
Problem:
Place a knight onto an empty standard chess board on any square. Move the knight in the usual way. Every square must be landed on, but no square can be visited twice. The knight should also end up on the square it started from!
Originally posted by Crush Stationhow about-get some domino's, and place the domino's so that one covers two squares. only one domino per square (well-one half 😛)-and they can only do vertically and horizontally-like a rook moves-not diagonally-like a bishop...
I've just been listening to Quentin Cooper discussing mathematical problems, with special reference to chess. One problem was called the 'Knight's Tour', but it was not said (or I missed it) whether it could be done or indeed has been solved. Does anyone know of an answer?
Problem:
Place a knight onto an empty standard chess board on any square ...[text shortened]... but no square can be visited twice. The knight should also end up on the square it started from!
can this be done. if so, how. and if not, why not?