As opposed to #17 it should be possible to store how fast a node connection from A->B is reached. Given that we could influence the path finding by using that in addition to Checked. Now bots will vary their paths because they don't want to re-pick the same nodes. However, we could remove that and basically add this 'how easy is it reachable' so that bots will prefer the better connections over those harder connections.
A caveat is that this can also be seen as the 'fast' or a 'slower' route. If implemented too strictly and bots will not vary anymore (always prefer the most fastest path). This should be avoided to keep the bots randomized enough so the play differs from round to round.