finito: Constraint Solver for Finite Domains

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

Please see the README on GitHub at

[Skip to Readme]


Change log
Dependencies base (>=4.7 && <5), numeric-domains (==0.1.*), propeller (==0.1.*), transformers (>= && <0.6) [details]
License BSD-3-Clause
Copyright 2020 Michael Szvetits
Author Michael Szvetits
Category AI
Home page
Bug tracker
Source repo head: git clone
Uploaded by MichaelSzvetits at 2020-02-13T21:07:08Z




Maintainer's Corner

For package maintainers and hackage trustees

Readme for finito-

[back to package description]



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.