The direction they will take at an intersection depends on two things - the tile itself and the number of tiles the walker has passed since he began the "random" part of the walk.

Knowing this is of no use for helping the walker choose the correct direction when he passes through the intersection for the first time, but should he choose a dead end it is possible to drastically raise the chance of him going in the right way the second time!

How it works:
At an intersection, the algorithm makes a calculation and outputs a direction which the walker should take, it can be NE SE SW or NW. If there is no road towards that direction and/or it is the road the walker is coming from the next clockwise direction is chosen.
If the walker comes back to the intersection after he has travelled one tile forth and back, the algorithm will output the next clockwise direction to the one it previously output.
If the walker comes back after travelling two tiles, he will be supposed to take the opposite direction (two times clockwise)
If the walker comes back after three tiles he will be supposed to take the counterclockwise direction (three times clockwise)
If he comes back after four tiles he will be supposed to take the same direction he was originally supposed to take.
Five tiles is the same as one, six as two and so on.

In the following example adding the two road tiles right from the granary ensures that the labor seeker from the farm heads towards the houses by eliminating the chance that he takes a dead end and then the road he came from.

[This message has been edited by Trurl (edited 05-01-2006 @ 09:53 AM).]