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

I have prepared the package set-cover for solving exact set cover problems. It includes example programs for solving Sudoku, 8 Queens, Soma Cube, Tetris Cube, Cube of L's, and Logika's Baumeister puzzle. Please refer to these examples for learning how the library works. The solver is generic with respect to the representation of sets. You may either use the high-level Set type from containers package or low-level bit vectors. http://hackage.haskell.org/package/set-cover The package is simple Haskell 2010.