All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
Can you do it? (Posted on 2020-06-08) Difficulty: 2 of 5
Imagine a 10x10 chessboard with a fictitious King who can move in three possible directions: up, left and diagonally down-right,
- one step to adjacent square only.
Your task is to devise a route starting at a square of your choice and returning to the same square including in your itinerary each square of the board exacty once.

Present your solution or prove that it can't be done.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution solution | Comment 1 of 4
To make the tour of the 100 squares in a closed loop requires 100 moves. As each row and column must be visited the same number of times, and the King visits each one once on the way up and once on the way down (same for left and right column-wise), the number of up moves must equal the number of diagonal moves, but also the number of left moves must equal the number of diagonal moves.

So there are to be an equal number of each of the three types of move. But 100 is not divisible by 3, so the task is impossible.

  Posted by Charlie on 2020-06-08 21:40:37
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information