Klondine return

Klondine return

We are searching data for your request:

Forums and discussions:
Manuals and reference books:
Data from registers:
Wait the end of the search in all databases.
Upon completion, a link will appear to access the found materials.

Euler, the great mathematician, discovered a rule to solve all kinds of labyrinthine riddles that, as all good fans know, consists of working backwards, that is, from the end to the beginning.

The riddle we present here, however, was deliberately conceived to disqualify Euler's rule and among many other attempts he may be the only one who questions his method.

Start from the center. Advance three steps in any of the eight directions: north (N), south (S), east (E), west (O), or diagonally, northeast (NE), northwest (NO), southeast (SE) or southwest (SW).

When you have advanced three squares in a straight line you will arrive at a numbered square that indicates the second day of travel and that will be as many steps in a straight line in any of the eight directions as indicated by the box number.

From this new point, move forward again according to the indication of the number and continue like this until you reach a square whose number makes you take a step, just one, beyond the edge. Then he will have left the forest and will be able to shout everything he wants, because he will have solved the riddle!

What sequence of movements allows you to exit the maze?


To the consolation of those who could not escape the endless swirl of numbers, we will say that the only possible way out is through a curious sequence of advances and setbacks along a single diagonal.

The movements are: SO at 4, SO at 6, NE at 6, NE at 2, NE at 5, SO at 4, SO at 4 and then a bold jump to the NO or SE towards freedom.