Description

To travel from source station (A) to final station (Z) a bus must pass through several stations, the path between each station and the following one is assigned a value, this value may be the cost of travel, the distance, or the time needed to travel between these 2 stations, or whatever a person may think of, your mission - if you are clever enough - is to construct the best route for the bus in terms of this value, call it cheapest path, fastest route, shortest path, whatever you like to call. The point is, find that route by tapping stations one by one from (A) to (Z). The "GAME" is endless, you have 10 maps, for each map whenever you "shuffle" the map you get new random values, there is no "I finished the final level".

The game is based on a real scientific algorithm for finding shortest paths, sometimes there may exist more than one (best route) with the same values.