Peter Norvig on solving every Sudoku puzzle
Peter Norvig shows us how to solve every Sudoku problem in 100 lines of code using constraint propagation and search.
Peter Norvig shows us how to solve every Sudoku problem in 100 lines of code using constraint propagation and search.
No comments yet.
RSS feed for comments on this post.
26 queries. 0.321 seconds. Valid XHTML
Powered by WordPress
© 2004-2008, Daniel Lemire (lemire at acm dot org). This work is licensed under a Creative Commons License.
Subscribe to this blog
in a reader or
by Email.