Asian Tour Puzzle
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Object: visit as many cities (numbered positions) as possible.
[more]
Contributed by: Karl Scherer (April 2014)
Open content licensed under CC BY-NC-SA
Snapshots
Details
The man always starts at city number 1.
In the challenges with fixed setup, you win if the number of cities you visited is as high or higher than the target given in the control area at the top.
Only the most simple line crossings are allowed; each position can only have up to two straight lines going through it.
The fixed setups get progressively harder to solve.
In the challenges with random setup, try to visit as many cities as possible.
Controls
"cities visited"
Counts the number of cities you have visited.
"target"
Best known count of cities visited.
"moves"
Number of moves played.
"back"
Click to go back one move.
"reset"
Reset the game to the starting position.
History
This game was originally published as the Zillions game "Asian Tour" by the author.
Permanent Citation
"Asian Tour Puzzle"
http://demonstrations.wolfram.com/AsianTourPuzzle/
Wolfram Demonstrations Project
Published: April 28 2014