- A reference guide and manual in Russian for Heroes 3.

We select point A (the starting point) and point B (the final destination).
Stage one

1. Hex A is assigned the label "0".
2. All adjacent free hexes are assigned the label "1".
3. We continue to number the hexes until hex B receives its label (the label is the distance of the hex from hex A).

Stage two
Let's say, for example, that hex B receives the label "9".

4. Among the hexes adjacent to hex B (the destination), we select those that have the label "8".
5. Among the selected hexes, we will be interested in the hex with the highest priority based on the following scheme:

--4--3--
-5----2-
--6--1--

For example, if the upper right and lower right hexes have the label 8, then we select the lower hex, as it has the highest priority of 1 (and the upper right only has 3). The hex found will be the second to last in the A-B route.

6. Now we look for hexes adjacent to the found hex and having the label "7", and so on.
7. We repeat the described procedure until we reach the hex with the label "0".

The route is built.