Solve polyomino tiling problems.
Project description
POLYOMINO - a Python package for polyomino tiling problems
This is a package for manipulating polyominos and in particular, solving tiling problems. It uses the 'exact-cover' python package as the main engine for solving cover problems.
To solve a tiling problem, you need to create a 'board', the set of squares to be covered, and a 'tileset', the collection of polyominos which can be used. There are examples of the syntax to do this in examples/fluid.md The example file examples/gardner.md uses the package to solve a number of problems from the chapter on polyominos from Martin Gardner's book 'Mathematical Puzzles and Diversions'.
Design
Both polyominos and boards are represented internally as lists of integer tuples (x, y). There are constants defined for all polyominos up to pentominos in polyomino.constant
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for polyomino-0.4.3a0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | ff4c41f57fb068acb5df6a0dd8d6abfd624a623a2121a69fbcc27a4ff31a3edf |
|
MD5 | 786073c5a273049b6381e282301daeff |
|
BLAKE2b-256 | 117be0affa198d0b5f1267b25a9d1e33f36f0314b8f97ca8f8639b1db3b66464 |