Puzzle solving library, written in Rust.
Go to file
David Wang 33ed1a3dbb Add types for a single candidate and a set of candidates.
Candidates are always an i32 (rather than a generic integer type) to
more easily perform arithmetic.  The puzzles we will deal with should
always be small enough such that we do not exceed the limits of i32.

Candidate groups are separated into an enum.  This is to help us keep
it general, as we would like to include a range option in the future.
2017-02-19 08:38:58 +11:00
src Add types for a single candidate and a set of candidates. 2017-02-19 08:38:58 +11:00
.gitignore Initial commit: puzzle solver. 2017-02-18 08:21:54 +11:00
.travis.yml Add Travis CI metadata. 2017-02-18 08:28:20 +11:00
Cargo.toml Add dependency: bit-set. 2017-02-18 16:05:10 +11:00
LICENCE-MIT.txt Add licence (MIT). 2017-02-18 08:25:56 +11:00