Java - PuzzleManiac - Coroutining
Coroutining
This algorithm should be a lot faster than the Naive
one. It puts the bricks one by one on the board making sure each brick
fits. If it doesn't, it will create another combination by moving the one
that doesn't fit. This way it solves the problem where the problem lays
and not where it probably doesn't lay like the Naive algorithm. It's already
much faster, but we aren't happy yet. Here are the better ones.
So why is the Coroutining algorithm in here then? To be complete!
Demonstration
The algorithm is written in Prolog by H. Vandecasteele.
Project verslag
PuzzleManiac page
Home