# Tag Info

Accepted

### The Knight and the Maze

If my Python programming is to be believed, the minimum number of moves required is 41:
• 9,771

### 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 ...
• 53.7k
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
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 ...
• 1,311

### Knight Checker Puzzle

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

### Knight Checker Puzzle

I think this works: The key realisation is that
• 117k
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 ...
• 18.9k

### 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:
• 120k
Accepted

• 34.2k

• 9,218
Accepted

### A thirsty king and his knights

It's possible to do it in
• 6,208

### 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)
• 5,906
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 ...
• 6,043

### 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.
• 3,350
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 ...
• 77.7k
Accepted

### A knight chased by three knights

Observation: Implication: Conclusion:
Accepted

### 2 Knights tied together in a dangerous maze

Here is a solution
• 21.1k
Accepted

### Seven Impatient Knights

The trick is to place them Full list:
• 147k
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:
• 23.7k
Accepted

Why?
• 21.8k
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 ...
• 117k
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 ...
• 19.7k

### The Knight and the Maze 2

Here is a solution to the maze:
• 5,906
Accepted

• 53.7k
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 ...
• 77.7k
Accepted

### The Trials of Sir PacMan

There are some unreachable pellets, and there are safe squares for the ghosts.
• 14k
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:
• 120k
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, ...
Accepted

### A Knight's Tour

• 7,720
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 ...