Decidability of Tiling with One or Two Prototiles
Determine whether the plane tiling decision problem is decidable when the input consists of either one or two simple-polygon prototiles whose tiles may be placed as isometric copies (with rotations and with reflections either allowed or forbidden).
References
It remains open whether tiling with one or two given prototiles is decidable.
— Tiling with Three Polygons is Undecidable
(2409.11582 - Demaine et al., 2024) in Introduction (Constant Number of Prototiles)
R'' (green) denotes decidability,co-RE-c'' (red) denotes co-RE-completeness, and yellow marks open cases.
— Tiling 3D by Translates of a Single Polycube is Undecidable
(2610.12392 - Demaine et al., 8 Oct 2026) in Section 1, Table 1 (caption and row for two prototiles in 2D)