Nonograms

Smarter, faster, bigger.

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

I had written a sudoku solver before reading Norvig's writeup. Our solvers bore a superficial resemblance, largely because neither of us like to use object-oriented features if we can help it. Like his, mine was a constraints based solver but I had missed one important feature: try the most likely guesses first. Norvig's solver works on the row with the least possibilities first. Both solvers spend their time barking up the wrong trees, but Norvig started with the smallest forest. It is an important part of the algorithm to take into consideration.

Name:
Mail: (not shown)

Please type this: