Think you can win the 1st place at the snowman building contest?3.86 / 5.00 8,826 Views
Silly and cute VN. Part of The Somewhere Series.4.05 / 5.00 9,984 Views
How much you know about Famous Sculptures?3.96 / 5.00 10,484 Views
In this deceptively simple puzzle game, you must find the path that goes through all positions on a 2d grid, without visiting any location twice. It is inspired by a classical mathematical problem (of finding Hamiltonian paths on a graph). If you manage to complete the last puzzle, check with your doctor that you are indeed human.
Note: You *do not* have to return to where you started, you just have to visit each point exactly once.
At the start screen, press X or Enter to start the game. At any point, press R to restart the level, or Z to undo a move.
Programmed using puzzlescript. Source code is here:
UPDATE: as some people have pointed out, and as I should have stressed in the description, the problem of finding a path through a set of connected points is *not* the classical travelling salesman problem; as I say in the description above, it is the Hamiltonian path problem. However, these problems are related, and I thought "travelling salesman" was a better title than "find your own Hamiltonian path", so I used it. I hope nobody will be offended by my abuse of terminology.