homepage: https://github.com/arthurl/exact-cover
changelog-type: ''
hash: c4f4943612433ee9117c853e310b9dd951ec5f03973b931621541f08642c9719
test-bench-deps:
  base: <4.10
  exact-cover: <0.2
  containers: <0.6
  tasty-hunit: <0.10
  tasty: <0.12
maintainer: me@arthur.li
synopsis: Efficient exact cover solver.
changelog: ''
basic-deps:
  base: ! '>=4.6 && <4.10'
  exact-cover: <0.2
  containers: ==0.5.*
  boxes: <0.2
  safe: <0.4
  vector: <0.12
all-versions:
- '0.1.0.0'
author: Arthur Lee
latest: '0.1.0.0'
description-type: markdown
description: ! '# The `exact-cover` package


  `exact-cover` is a Haskell library that implements a fast solver

  for [exact cover problems](https://en.wikipedia.org/wiki/Exact_cover) using

  Algorithm X as described in the

  paper [_Dancing Links_](https://arxiv.org/abs/cs/0011047), by Donald Knuth, in

  _Millennial Perspectives in Computer Science_, P159, 2000.


  See [`exact-cover` on Hackage](https://hackage.haskell.org/package/exact-cover)

  for more information.

'
license-name: BSD3

Update from Hackage at 2017-04-22T12:13:31Z
Update from Hackage at 2017-04-22T12:13:31Z
