## Welcome to BrainDen.com - Brain Teasers Forum

 Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-)
Guest Message by DevFuse

# The King takes a long walk

Best Answer bonanova, 21 June 2014 - 05:22 AM

Spoiler for Putting this puzzle to bed

Go to the full post

14 replies to this topic

### #11 plasmid

plasmid

Senior Lolcat

• VIP
• 1462 posts
• Gender:Male

Posted 09 May 2014 - 02:11 PM

Ok, asking for the solution for an 8x2 grid seemed that you were suggesting he repeat this four times, minus one move at the end, to visit every square with only eight non-diagonal moves. But since I have yet to encounter a cylindrical chess board, this won't fly.
Spoiler for not it

• 0

### #12 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 09 May 2014 - 05:49 PM

yeah, everything you said. the comment was to suggest the obtainable degree of diagonal moves.

• 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

### #13 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 17 May 2014 - 10:35 AM

Assuming that

1) The king starts from e8 (the normal starting position for the black King) and

2) Every square is to be visited only once

Spoiler for the longest path I could find so far

Four fewer lateral moves is possible.

• 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

### #14 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 20 May 2014 - 02:50 PM

Ok, asking for the solution for an 8x2 grid seemed that you were suggesting he repeat this four times, minus one move at the end, to visit every square with only eight non-diagonal moves. But since I have yet to encounter a cylindrical chess board, this won't fly.

Spoiler for not it

But it is the right idea.

The minimum number (8) of adjacent steps can be maintained as small parts of

the four rectangles are minimally changed to effectively stitch them together.

• 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

### #15 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 21 June 2014 - 05:22 AM   Best Answer

Spoiler for Putting this puzzle to bed

• 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users