Be a Supporter!

Travelling salesman

rated 3.19 / 5 stars
Share Links:
Puzzles - Other

Credits & Info

Apr 2, 2014 | 9:07 PM EDT

If you liked this, check these out!

Author Comments

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.



Rated 5 / 5 stars

Great way to demonstrate that a minimalist game can be both challenging and enjoyable. And you hired the best musicians ;)


Rated 3.5 / 5 stars

I liked it but its too short. It needs more levels like the last one. Great choice of music too.


Rated 2.5 / 5 stars

This is a repetitive, but fun puzzle game. Will there be a sequel?

RabbitFromHell responds:

Possibly; watch this space :)


Rated 3.5 / 5 stars

simple idea, i like puzzle game, but.. i think it's need more cute graphic, and more stuff..

you get you stars :)


Rated 4 / 5 stars

Fun little time waster! it wasn't too challenging for me and I managed to beat the last level too!

RabbitFromHell responds:

Thanks, and well done!