Skip to main content
47 votes
Accepted

The Knight and the Maze

If my Python programming is to be believed, the minimum number of moves required is 41:
r3mainer's user avatar
  • 9,771
25 votes

The Knight's Romp

I have a computer program for solving packing problems, and found a way to use it to solve this problem. One of the solutions it found is below: Note that this is very close to the attempted solution ...
Jaap Scherphuis's user avatar
24 votes
Accepted

How can the knight traverse a chessboard to make a path that sums to 100

The path is as follows: I found this path after
AxiomaticSystem's user avatar
22 votes
Accepted

Conway's Game of Knights

Here is my answer in text form. It's long, so I stored it on pastebin: 19 steps I don't have time to convert it to png (thanks @TheDarkTruth, see comments to the question), so maybe later. Gif ...
Verence's user avatar
  • 1,311
20 votes

Knight Checker Puzzle

Another solution, besides Rand al'Thor's accepted one, involves White can play After which Indeed With touchdown in each case.
Evargalo's user avatar
  • 6,290
19 votes
Accepted

Knight Checker Puzzle

I think this works: The key realisation is that
Rand al'Thor's user avatar
19 votes
Accepted

The Knight and the Maze 2

Here are all 48 solutions to the maze with no repeated squares (shortest first): The maze actually has some isolated or unreachable components, and one component that is isolated unless you pass ...
2012rcampion's user avatar
  • 18.9k
17 votes

On an 8x8 board, a knight is on the second square of the last row. Only moving upwards, how many routes to the top?

The easiest way to do this, I think, is The answer is and here are the calculations:
Gareth McCaughan's user avatar
17 votes
Accepted

Knight's Tour on a 7x7 Board starting from D5

Here is my answer:
athin's user avatar
  • 34.2k
17 votes

How can the knight traverse a chessboard to make a path that sums to 100

Retudin's user avatar
  • 9,218
16 votes
Accepted

A thirsty king and his knights

It's possible to do it in
hagfy's user avatar
  • 6,208
15 votes

The Knight and the Maze

It's relatively easy if you start at the exit and try to reach the starting point. (Apologies for my bad paint skills)
The Dark Truth's user avatar
14 votes
Accepted

Knight tour on a racetrack

First, since we need to do four laps, then we need to make spaces for four routes since we cannot repeat squares. This means there should be four initial squares that would be the first square for ...
justhalf's user avatar
  • 6,043
13 votes

The Knight and the Maze 2

If you take the directions on a clock as the possible moves, 1,2,4,5,7,8,10,11: Will do it Which is 34 moves in total.
Arth's user avatar
  • 3,350
13 votes
Accepted

The Knight's Romp

First things first: let's check the divisibility. There are 64 squares, and the knight is standing in one of them. That leaves 63 squares to cover, and each move covers 3 squares, so that seems to ...
Bass's user avatar
  • 77.7k
12 votes
Accepted

A knight chased by three knights

Observation: Implication: Conclusion:
Daniel Mathias's user avatar
11 votes
Accepted

2 Knights tied together in a dangerous maze

Here is a solution
Jonathan Allan's user avatar
11 votes
Accepted

Seven Impatient Knights

The trick is to place them Full list:
Deusovi's user avatar
  • 147k
11 votes
Accepted

4-dimensional Knight's Tour

This puzzle can be broken down relatively easily. Start with So now we can put it together to finish the whole thing:
Dr Xorile's user avatar
  • 23.7k
10 votes
Accepted

Closed knight tour on 7x7 board

Why?
ffao's user avatar
  • 21.8k
10 votes
Accepted

Spell out your moves and reach the exit

Full solution with explanation Of the numbers from one to nine: ONE, TWO, and SIX have three letters; we already know which region is ONE, and TWO and SIX are then also given by the W and X already ...
Rand al'Thor's user avatar
9 votes
Accepted

A Knight's Kuromasu

Coded b1 as initial position, bn as position before n'th jump As for methodology, I started by deducing the following: From there it seemed as if there were three points of high tension, From this ...
Sconibulus's user avatar
  • 19.7k
9 votes

The Knight and the Maze 2

Here is a solution to the maze:
The Dark Truth's user avatar
8 votes
Accepted

A Pawn is riding this Knight on his Tour

Jaap Scherphuis's user avatar
8 votes
Accepted

A knight chased by four knights

This should be more or less First of all, Secondly, if black can ever reach this position with white to move, then it's ggs on any finite sized board: black is guarding the marked squares, so white ...
Bass's user avatar
  • 77.7k
7 votes
Accepted

The Trials of Sir PacMan

There are some unreachable pellets, and there are safe squares for the ghosts.
Penguino's user avatar
  • 14k
7 votes
Accepted

Gimped Knight on a Torus

Suppose the knight's permitted moves are $u$ and $v$. (These are two-dimensional "vectors" on the torus.) Then Thus:
Gareth McCaughan's user avatar
7 votes
Accepted

Camel-eon 8x8 tour

After much effort, I have managed to tame this beast. Here it is, with the red/blue color scheme: And here is more colorful version which should make following the path a bit easier: Of course, ...
Daniel Mathias's user avatar
7 votes
Accepted

A Knight's Tour

Parcly Taxel's user avatar
  • 7,720
6 votes
Accepted

Knight's Tour on a cube surface

2x2x2 is easily solved like this: Behold my mighty Gimp skillz: For the general case of a $N^3$ cube, Rigorous proof for the above claim will have to be supplied by someone more proficient in graph ...
Bass's user avatar
  • 77.7k

Only top scored, non community-wiki answers of a minimum length are eligible