Thursday, May 25th, 2006

Peter Norvig on solving every Sudoku puzzle

Filed under: — Daniel Lemire @ 17:33

Peter Norvig shows us how to solve every Sudoku problem in 100 lines of code using constraint propagation and search.

No Comments »

No comments yet.

RSS feed for comments on this post.

Leave a comment

Warning: When entering a long comment, please ensure that you make copy of your text prior to submitting it. If the server should fail or if you hit a bug, you might lose your work. I am not responsible for your lost effort.

To spammers: I carefully review every single post and make sure that spam gets deleted. You are wasting your time if you are manually entering spam using this form. Read my terms of use to see what I consider to be abusive.

Example: I + II + IX= XII. Yes, you have to enter a roman numeral. (Answer must be in upper case.)

« Blog's main page

26 queries. 0.321 seconds. Valid XHTML

Powered by WordPress

Subscribe to this blog in a reader or by Email.