Java - PuzzleManiac - Naive
Naive no doubles
This algorithm is very much the same as the naive
one, but with one problem fixed...
When we generate all possible rotations of the bricks (there are eight
a brick) there are many doubles among them. It's no use to use two doubles
in the puzzle: if one of them doesn't fit, the other won't either. That's
why H. Vandecasteele created a better algorithm. It will throw out all
these annoying doubles. This way a little more efficiency is attained.
Demonstration
The algorithms are written in Prolog by H. Vandecasteele.
Project verslag
PuzzleManiac page
Home