In article <>, Mark van Hoeij <> wrote:

There exists a city where all streets are exactly north-south or east-west. Because of that there are often many different routes from A to B with the same length.

In the included postscript file [pictured below here] you see the map of a part of this city. How many shortest routes are there from A to B?

Mark van Hoeij

To the solution; to the puzzles list; to the home page