Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.16407 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909230211006464 |
|---|---|
| author | Kaplan, Craig S. |
| author_facet | Kaplan, Craig S. |
| contents | I show how to express the question of whether a polyform tiles the plane isohedrally as a Boolean formula that can be tested using a SAT solver. This approach is adaptable to a wide range of polyforms, requires no special-case code for different isohedral tiling types, and integrates seamlessly with existing software for computing Heesch numbers of polyforms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16407 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Detecting Isohedral Polyforms with a SAT Solver Kaplan, Craig S. Discrete Mathematics Computational Geometry G.2.0; G.1.6 I show how to express the question of whether a polyform tiles the plane isohedrally as a Boolean formula that can be tested using a SAT solver. This approach is adaptable to a wide range of polyforms, requires no special-case code for different isohedral tiling types, and integrates seamlessly with existing software for computing Heesch numbers of polyforms. |
| title | Detecting Isohedral Polyforms with a SAT Solver |
| topic | Discrete Mathematics Computational Geometry G.2.0; G.1.6 |
| url | https://arxiv.org/abs/2406.16407 |