Smarter, faster, bigger.

Comments are moderated. It may take a few minutes before your comment appears.
Markdown is supported in your comments.

The old version used a cute and simple twist on brute force. Finding multiple solution was fairly important, and brute force always will. Unlike naive brute force, it did not check every possible leaf. Instead it checked every node as it was added to the tree. Entire branches could quickly be pruned off at the first sign of total contradiction. A parent node would look at its children and prune off the contradictory children. Children could prune parents too. If nothing is possible, then it is the parent's fault and the hopeless parent is pruned.

Mail: (not shown)

Please type this: