Be a Supporter!

Credits & Info

Uploaded
Oct 7, 2008 | 2:18 PM EDT

Related Stuff

If you liked this, check these out!


Author Comments

Hashi is a classic Japanese puzzle game. Each game of Hashi presents a map of circles containing numbers, called "islands". The number within each island determines how many lines, called "bridges", must be connected to the island. To win, all of the islands must be interconnected with the correct number of bridges in one continuous chain.

* Bridges may not be diagonal.
* Bridges may not cross another bridge.
* One or two bridges may connect a pair of islands.

Reviews


DrNenaDrNena

Rated 5 / 5 stars October 19, 2008

I'm addicted D:

I've been playing this since I voted for it in the portal... I'm just so hopelessly addicted to this game. Very good.



BadimBadim

Rated 5 / 5 stars October 8, 2008

awesome

it takes a while to beat 32*32 =) great game. i hope you will win FSF!


DigitalMachina responds:

Thanks, Badim I'm glad you enjoyed it!


CursedSeishiCursedSeishi

Rated 3 / 5 stars October 7, 2008

Definately requires something to check solutions..

I've reached a solution several times, but it refused to acknowledge it, so it definately needs a way to actually check for one much better than it can now. If it could, this would definately be a blue game right now.

best score btw was 1:30 on beginners lol, im content with that


People find this review helpful!
DigitalMachina responds:

All of the islands must be connected in a continuous chain. On some puzzles, it's possible to connect all of the islands with the correct number of bridges, but they may not be connected in one continuous chain.


bugginbuggin

Rated 3.5 / 5 stars October 7, 2008

I agree, you really should check solutions

For the first few times this game was a lot of fun, but once I got to the higher levels, I stopped getting the right solutions. Its really frustrating not to get a correct solution. An algoriithm that's simple to implement could go something like this:
1: Number all nodes.
2: Makes two lists, one for nodes checked, and one for nodes connected.
3. Start at node 1.
4. Put node 1 in the checked list.
5. Put node 1 and any connected nodes on to the connected node list.(Only add to the connected list if its an unique value).
6. Start at the lowest numbered node on the connected list not on the checked list.
7-9: Repeat steps 3-5 for this node instead of node 1.
10. Once the the size of the connected list equals the size of the checked list, you have one island. If the number of nodes in the island equals the number of nodes in the game, the answer is right.
There should be a simpler recursive solution, but this should be relatively easy to code.
Otherwise great game!


DigitalMachina responds:

You will always get a correct solution, it just might not be the only solution.

It's hard to follow the algorithm you've presented. But, I don't believe it works. It seems to describe how to check if the puzzle is complete, which is already implemented in the game.

What is needed, is an algorithm that checks if there is at least one solution given the current state of the puzzle. It would involve writing an algorithm that knows how to logically solve any hashi puzzle. This is not a trivial task.


jpuroilajpuroila

Rated 3 / 5 stars October 7, 2008

should check solutions

Apparently it doesn't check if the solution is correct, but just compares to a premade one. You should be aware that there may be multiple correct solutions.


People find this review helpful!
DigitalMachina responds:

I am aware that there are multiple correct solutions to some puzzles. I had to make a game design decision about trying to check against all possible solutions, or just the pre-made one as you said. I decided that the pre-made one should suffice for most players, and the time spent trying to build an algorithm to solve for all possible solutions was not worth it (and may not be possible running in a browser).

I hope that you will consider a higher score in light of this.

Sincerely,
Jeff M
Digital Machina