Be a Supporter!

Credits & Info

Uploaded
Apr 2, 2014 | 9:07 PM EDT

Related Stuff

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:

http://www.puzzlescript.net/editor.html?hack=9950856

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.

Reviews


kantfailkantfail

Rated 3.5 / 5 stars April 17, 2014

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



DoctorStrongbadDoctorStrongbad

Rated 2.5 / 5 stars April 4, 2014

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


RabbitFromHell responds:

Possibly; watch this space :)


leeafingleeafing

Rated 3.5 / 5 stars April 3, 2014

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

you get you stars :)



nemoisacutefishnemoisacutefish

Rated 4 / 5 stars April 3, 2014

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!


XileboXilebo

Rated 3 / 5 stars April 3, 2014

I was really excited when I read the title "travelling salesman" and thought the travelling salesman problem had been made into a game. I was a little disappointed when I realised that was not the case.
travelling salesman
n
1. (Professions) a salesman who travels within an assigned territory in order to sell merchandise or to solicit orders for the commercial enterprise he represents by direct personal contact with customers and potential customers.

This game has little in common with travelling salesmen at all.

It was enjoyable anyways so you get you stars. ;)


RabbitFromHell responds:

Hi, thanks for playing the game. You are right that this is not the travelling salesman problem; I started off with the idea of making a game of that in puzzlescript, but once I learned the limitations of the language, I changed course and ended up building a game based on Hamiltonian paths in graphs. But I thought the title was catchier, and so I kept it. The description is updated to address this possible confusion. I am happy you enjoyed the game anyway.