Pipe Game

[lelldorin]

Do you have any idea how to proof if the user have a complete connection from the sztart to the end?



I have no idea how to proof this. The playground is ready. This game is written in yab (yet another basic on Haiku operating system)

[ZXDunny]

There are many ways to do this, check Wiki: https://en.wikipedia.org/wiki/Pathfinding

A* is efficient and will determine if a path between two points on your grid exists. If you're not terribly worried about speed (or memory consumption) then a simple flood fill will be more than equal to the task - if it completes and the goal position has not been visited, then no path exists.

[lelldorin]

Thanks a lot, i will take a look