Constraint Solver for Finite Domains.

Please see the README on GitHub at https://github.com/typedbyte/finito#readme

finito

A constraint solver for finite domains, written in Haskell. The implementation is based on propagators and cells holding ranges of possible integer values (using the packages propeller and numeric-domains).

Sudoku and the n-queens problem with configurable board size are provided as examples on how to use the library. In addition, the Hackage documentation is quite compact and covers all the provided types and functions.