

After the appearance of a mysterious wizard, the bridges of Koni were bewitched. The king summons Sarval's wizards to help him. You are Helm, a wizard willing to solve the problem. Based on graph theory, the player needs to find the path that only passes through each bridge once.
Collect this game!
Sign up for free and add it to your collection.
Auto detects region via browser/locale (e.g. en-GB โ PAL, en-US โ NTSC).
No community data
Nicht gefunden
Keine Preisdaten fรผr NTSC gefunden.
Wechsle oben auf PAL/NTSC oder trage einen Community-Preis ein.
This game belongs in your collection
Add it and track its value automatically โ including price alerts.





