[Haskell-cafe] Code Review: Sudoku solver

Henning Thielemann lemming at henning-thielemann.de
Wed Apr 5 07:28:14 EDT 2006

On Mon, 3 Apr 2006, Jared Updike wrote:

> or ambiguously) with your Sudoku solver? A rough mesaure of the
> difficulty of the unsolved puzzle could be how long the solver took to
> solve it (number of steps) (and the number of possible solutions)? Are
> puzzles with multiple solutions usually considered harder or easier?
> Are these considered proper puzzles?

It's an interesting test to run a Sudoku solver on an empty array. :-)

More information about the Haskell-Cafe mailing list