A globe-trotter wants to travel from Amsterdam (A) to Berlin (B), then to Copenhagen (C), then to Delft (D), then to Edinburgh (E), then to Frankfurt (F), then back to Amsterdam. However, the poor guy gets lost in the traffic chaos in Europe, which consists of one big heap of one-way streets and blocked roads. Can you help him?
 
First click Amsterdam (A) to place your Man. Then find your way to 'B', ...,'F' and back to 'A'.
 
The orange dots symbolize the towns and villages which you may visit on the way. The connections between the towns are painted half red and half blue. You can traverse any connection only from the blue end towards the red end, but not the other way round.
 
You have to visit your destinations in the correct order. E.g. you cannot go to Copenhagen (C) before you have been to Berlin (B). Also you can enter each destination A,...,F only once.
 
You might have to unselect the 'View/Search Progress' option if you have problems to fit the Globetrotter board on a 800x600 screen.
 
 
Sometimes it is possible to make a puzzle design 'complete' in a mathematical sense. The Globetrotter Maze is such a puzzle. It uses all 163 ways to connect 4 given towns with one-way streets or blocked roads. One example of such a four-point connection is given at the right border of the board. Together with six destinations the 163 square tiles fill a 13x13 board.
 
A one-way street is symbolized by a connection which is half blue and half red because colours are easier to see than tiny arrows. The blocked roads are represented by the missing links between the towns.
 
More freeware as well as real puzzles and games at my homepage http://karl.kiwi.gen.nz.