Detecting Isohedral Polyforms with a SAT Solver
Discrete Mathematics
2024-06-25 v1 Computational Geometry
Abstract
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.
Keywords
Cite
@article{arxiv.2406.16407,
title = {Detecting Isohedral Polyforms with a SAT Solver},
author = {Craig S. Kaplan},
journal= {arXiv preprint arXiv:2406.16407},
year = {2024}
}
Comments
In Proceedings GASCom 2024, arXiv:2406.14588