I am trying to find an algorithm to solve following puzzle:
I have got a list of pipes that I am allowed to use.
-I need to build a net of pipes that only has one entry/exit.
-Pipes cannot be turned
How pipes look like:
Each pipe can have an up to for ends.
ex. a pipe in the form of a T or an I or a
There are also pipes that are just an ending.
Image of those pipes: http://img.podnova.com/icons_pandroid/jpg/big/2/2982.jpg
Bruteforcing is to slow... any ideas?
Language: C#
Any idea of an algorithm that solves this problem without brute force?
No comments:
Post a Comment