homepage: https://github.com/typedbyte/finito#readme
changelog-type: markdown
hash: 7b3e0ee5657cdc9a1229045ae28b8baef969df89bc148c56971c936a1cdb9e21
test-bench-deps:
  propeller: ==0.1.*
  split: -any
  base: ! '>=4.7 && <5'
  numeric-domains: ==0.1.*
  transformers: ! '>=0.5.2.0 && <0.6'
  finito: -any
maintainer: typedbyte@qualified.name
synopsis: Constraint Solver for Finite Domains
changelog: "# Changelog for finito\r\n\r\n## 0.1.0.0 (2020-02-13)\r\n\r\n- Initial
  release"
basic-deps:
  propeller: ! '>=0.1 && <0.2'
  base: ! '>=4.7 && <5'
  numeric-domains: ! '>=0.1 && <0.2'
  transformers: ! '>=0.5.2.0 && <0.6'
all-versions:
- 0.1.0.0
author: Michael Szvetits
latest: 0.1.0.0
description-type: markdown
description: "<p align=\"center\">\r\n<img src=\"./logo.png\">\r\n</p>\r\n\r\n# finito\r\n\r\n[![Hackage](https://img.shields.io/hackage/v/finito.svg?logo=haskell&label=finito)](https://hackage.haskell.org/package/finito)\r\n\r\nA
  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](https://github.com/typedbyte/propeller) and [numeric-domains](https://github.com/typedbyte/numeric-domains)).\r\n\r\n[Sudoku](./examples/sudoku/Main.hs)
  and the [n-queens problem](./examples/queens/Main.hs) with configurable board size
  are provided as examples on how to use the library. In addition, the [Hackage documentation](https://hackage.haskell.org/package/finito)
  is quite compact and covers all the provided types and functions."
license-name: BSD-3-Clause

Update from Hackage at 2020-02-13T21:15:50Z
Update from Hackage at 2020-02-13T21:15:50Z
