>
> > Assume the following map grid:
> >
> > A B
> > -------
> > 1 | | a|
> > |--|--|
> > 2 | b| |
> > -------
> >
> > Unit [a] is in location 1B.
> > Unit [b] is in location 2A.
> > Unit [a] wants to travel to location 1B by the most direct route.
> > Unit [b] wants to travel to location 2A by the most direct route.
> >
> > Intuition suggests that, under most circumstance, they should pass each other.
> > Our real life experiences reinforce this. However, given the current movement
> > rules in Olympia, unit [a] could move West then South, while unit [b] moves East
> > then North -- thus exchanging places yet not encountering each other.
>
> Actually, this does not match my intuition or real life experience.
> It is seldom possible in real life to go from point A to point B in
> a straight line. At the scale of a province there are simply too
> many things in the way. Trees, buildings, hills, rocks, streams, etc.
>
> And (again at the scale of the province) with so many meandering paths
> between two points, it seems unlikely to me that travellers _would_
> actually encounter each other.
Good point. In fact, if the grid scale were closer to -- say -- 100 meters or
less, then orthogonal movement would be a much better approximation. As it
stands, however, orthogonal movement at the scale of a province does not -- by
any stretch of the imagination -- simulate having to side-step trees, buildings,
hills, rocks, streams, etc....
As far as encounters go, i think the current system is FAR too lenient. Assuming
a walking rate of 25 miles per day in a Plains province, each province would
be about 175 miles across. Yet, my unit is somehow able to spot each and every
unit in the entire area -- even those which have been traveling for days.
-joel