Y by Adventure10, Mango247, Mango247, Mango247
In a
board, a piece called dragon moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board.
The draconian distance between two squares is defined as the least number of moves a dragon needs to move from one square to the other.
Let
be a corner square, and
the square neighbor of
that has only a point in common with
. Show that there exists a square
of the board, such that the draconian distance between
and
is greater than the draconian distance between
and
.

The draconian distance between two squares is defined as the least number of moves a dragon needs to move from one square to the other.
Let








