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,651
42 votes
Accepted

Trapping The Knight

I can get the knight trapped in 15 moves: $$\begin{array} {ccccccccc} \cdot & \cdot & \cdot & \cdot & 5 & \cdot & \cdot & \cdot & \cdot\\ \cdot & 3 & \cdot &...
Deusovi's user avatar
  • 146k
31 votes
Accepted

Desegregate the Knights

Give these names to all the squares: 163 4 8 725 Each number can only be accessed by way of the numbers before and after it (where 8 wraps around to 1). That ...
Deusovi's user avatar
  • 146k
27 votes

Switch The Knights

I found a solution that uses 16 moves. After exhaustively checking that there is no solution in 14 moves, I conclude that 16 moves is optimal, because after any odd number of moves the number of ...
GOTO 0's user avatar
  • 13.5k
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
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
22 votes
Accepted

Switch The Knights

You need at least 16 Moves. Let's make the task visually more simple. The initial board is: a4 b4 c4 a3 b3 c3 a2 b2 c2 a1 b1 c1 We cut it into 12 cells ...
klm123's user avatar
  • 16.2k
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,270
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.7k
19 votes
Accepted

Knight Checker Puzzle

I think this works: The key realisation is that
Rand al'Thor's user avatar
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.1k
16 votes

Switch The Knights

Edit: Now that @GOTO 0 got it in 16, I can at least prove that his solution is optimal. Proof: My best was:
Zerris's user avatar
  • 4,671
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,034
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.2k
12 votes
Accepted

Create an impossible knight transformation

All 64 knights are needed, in which case any setup is stuck. We prove that with 63 knights, any position is reachable from any other position. With 63 knights, the puzzle is much like a sliding ...
xnor's user avatar
  • 26.4k
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
  • 146k
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
  • 22.8k
10 votes
Accepted

Closed knight tour on 7x7 board

Why?
ffao's user avatar
  • 21.7k
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

The Knight and the Maze 2

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

Knight on a rectangular chessboard

Besides the starting square, The images below show one possible tour: This tour uses the "domino pattern" from this paper: K. McGown and A. Leininger. "Knight's Tour." REU at Oregon State ...
Miles's user avatar
  • 1,197
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
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.2k

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