Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Incubator Q&A

Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.

Are you here to participate in a specific proposal? Click on the proposal tag (with the dark outline) to see only posts about that proposal and not all of the others that are in progress. Tags are at the bottom of each post.

Comments on A knight's sightseeing tour

Parent

A knight's sightseeing tour Question

+2
−0

Puzzle

How short can you make a closed knight’s sightseeing tour?

Terminology

Standard terminology

  • A chess board is an 8 by 8 chequerboard.
  • A knight is a chess piece that moves 2 squares horizontally then 1 vertically, or 2 vertically then 1 horizontally. The knights in the following diagram can reach any of the correspondingly coloured marked squares in 1 move.
    Knight's moves shown as dots(thanks to Wikipedia)
  • A knight’s tour is a sequence of moves that visits every square exactly once.
  • A closed knight’s tour visits every square exactly once and then returns to its starting square.

Terminology specific to this puzzle

  • A square is visible to a knight if the knight can reach it in 1 move.
  • A closed knight’s sightseeing tour is a sequence of moves that visits no square more than once and then returns to its starting square, such that every square on the board is visible from at least one of the squares in the tour. (To avoid doubt: Note that the starting square is included as one of the squares in the tour.)

After completing a sightseeing tour, the knight has not necessarily visited every square, but it has seen every square. A closed knight’s tour automatically also counts as a closed knight’s sightseeing tour, but is longer than it needs to be.

You are free to choose any square on the board as the starting square.

Leaderboard

Username Shortest knight's sightseeing tour
will.octagon.gibson 20
trichoplax 26
History

0 comment threads

Post
+2
−0

My tours are inspired by trichoplax‘s answer.

Spoiler! Key idea Subdivide the 6x6 grid from trichoplax‘s answer into four 3x3 grids that will be toured one at a time.

Spoiler! Tour with 32 moves

The following tour starts at the square labeled 1 and continues 2, 3, 4, ..., 31, 32 and lastly back to 1.

Tour with 32 squares visited


After finding the above tour, I was able to reduce the number of squares visited.

Spoiler! Tour with 28 moves

The following tour starts at the square labeled 1 and continues 2, 3, 4, ..., 27, 28 and lastly back to 1.

Tour with 28 squares visited


I reduced the number of squares visited even further.

Spoiler! Tour with 20 moves

The following tour starts at the square labeled 1 and continues 2, 3, 4, ..., 19, 20 and lastly back to 1.

Tour with 20 squares visited

History

1 comment thread

Better than the best I found (3 comments)
Better than the best I found
trichoplax‭ wrote 5 months ago · edited 5 months ago

I wanted to see what others came up with before posting the best I found (which was 26), but now that you've beaten that I've included the 26 in my answer. I've also updated the leaderboard to show your answer at the top.

trichoplax‭ Thanks for the acknowledgment. I notice that your length 26 solution is the only one of our solutions whose length is not a multiple of 4.

trichoplax‭ wrote 5 months ago

Yes, all of the others have the squares in the tour arranged with 4-fold rotational symmetry (even if the paths connecting them don't all have that symmetry).

Every closed tour must have an even length since a knight's move switches between dark and light squares, so if your 20 isn't minimal then the minimal one would be at most 18. I can't imagine how to do that, but then I couldn't imagine how to get less than 26 either...

I don't know if there's a way to prove that 20 is/isn't minimal.