2 knight pieces of the game chess were trying to find their way to freedom, while being tied together with a small rope.
It was so small that it forced them to be placed in adjacent squares at all times, but at least they could keep their standard movement, and the rope forced them to move simultaneously.

Here's the list of moves they can do :

oo..oo  o..o
..NN..  .NN.
oo..oo  o..o

So yeah ... their movement is like placing dominoes which are touching themselves by the corners.

So now let's talk about the hazardous hazards of the following grid :

  • A yellow block is sticky. If both of the knights land on a yellow square, they get stuck forever.
  • A red block is TNT. It will tear both knights to pieces if one of them steps on it.
  • Other than that, an army of knight-eating ants are appearing on each previously stepped square (it turns dark or whatever). If either knight steps on an adjacent square to one swarmed by ants, both get eaten and it's over.

The goal is to start from the top left corner, and end by touching the bottom right corner. No knight can find himself out of bounds. Good luck.

The grid ... Is that something familiar ? :)

Text :

S : start
F : finish

Y : sticky
R : explosives


PS :

Answers may consider the tag (but of course nothing restrains you to code your own solver).
I've built up that maze without any program, and I know that even though I added a ton of walls in order to try to make the solution unique, I believe there would still be dozens (if not hundreds) of paths that would lead to victory.

  • 1
    $\begingroup$ so we have two possible starting configurations and two possible ending configurations, yes? $\endgroup$ Jul 29, 2016 at 23:16
  • 3
    $\begingroup$ Exactly, 1 knight has to step on those squares, and the other has to be in an adjacent square. $\endgroup$ Jul 29, 2016 at 23:22
  • $\begingroup$ By refusing to post a plain text version, you are only slightly inconveniencing people who want to use a computer to solve it, but you are making the puzzle totally inaccessible to vision-impaired people. $\endgroup$ Jul 30, 2016 at 20:54
  • $\begingroup$ @PeregrineRook I see... next time, I'll draw textured blocks. $\endgroup$ Jul 30, 2016 at 22:25

1 Answer 1


Here is a solution

using $22$ moves a solution

  • 1
    $\begingroup$ Although the list of moves provided in the question isn't quite what I'd have imagined. But I'm glad I got to a knights maze before it had been solved for once :D $\endgroup$ Jul 29, 2016 at 23:50
  • $\begingroup$ That solution looks difficult to improve... even though the intended solution would make the knights wander all around the grid. Might as well post it for the fun of it. $\endgroup$ Jul 30, 2016 at 8:00
  • $\begingroup$ I might, at some point, re jig my solver from the previous questions to solve this one optimally and see how well I did - unless someone else does it first... $\endgroup$ Jul 30, 2016 at 8:01
  • $\begingroup$ Never mind, my path was actually 20 moves (I accidentally counted the virtual 'start' and 'end' nodes); and there are (spoilers) exactly 3 paths of that length. $\endgroup$ Jul 30, 2016 at 15:36
  • $\begingroup$ Oh well, at least it shows I didn't use a program :D $\endgroup$ Jul 30, 2016 at 15:43

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.