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'.
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
polyomino-0.4.2a0.tar.gz
(5.7 kB
view hashes)
Built Distribution
Close
Hashes for polyomino-0.4.2a0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 720c88970f9ca736d0fff39eb930f5f447a914a5e70b67a11cf35b2552a36130 |
|
MD5 | 9201087fc17f1ab11896db6fa777fcb7 |
|
BLAKE2b-256 | 689a7262020cc67a4598026d21972b522850f72ce3205f27d3689f5d09bda664 |