working without collissions

The algorithm works now in theory. It will always solve the problem on
the first move because no collission detection is implemented.

When more than one move is needed or a large search space is used, the
program crashes because the WaitHandle.WaitAll can only deal with 64
items. Perhaps we should use a semafoor?