[Haskell-cafe] ANN: set-cover solves Sudoku, Soma cube, 8 Queens etc.

[Johannes Waldmann]

Henning Thielemann <lemming <at> henning-thielemann.de> writes:

> .. package set-cover for solving exact set cover problems.
> http://hackage.haskell.org/package/set-cover

It's hard to evaluate whether one could use the library
because there's essentially no visible documentation.

E.g., what does Math.SetCover.Exact.search do?
Its type refers to "State" which seems implementation-dependent,
and hides the connection to the specification of the set cover problem.

Putting some text and examples into the haddocks might help.
But of course putting the specification there would be even better.

Also, care to explain what algorithm  your solver uses,
and give some performance data (e.g., N-queens for N=10,20,40,..)?

- J.W.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 261 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130908/ad45f6b6/attachment.pgp>