3.1 Getting started

There must be an initial solution. It can be a random one, but should be not too bad.
We generate our first solution by using a spanning tree. We take our first knot and expand the edges from this knot. After that we traverse the first edge. If there is no edge, or the way would be to long (infinity) we go back, remove the edge and take the next one. This is done recursivly until there is one solution. These solution is for the moment our best solution we have and will be saved. If the tree was fully expanded and there was no solution found we can stop our algorithm at this point and can say that there is no possible solution. But if there was a solution we can now look in our nearest neighborhood for a new path that is maybe better and not above the tyde (remember we are a fish and breath under water).