Sharp packing bounds for Poly-5 and Handy-Octs

Primarily AI-generated textHuman understanding: some partsmath.CO — Combinatorics

Contributed by William Howe ↗, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

On the 89-square Poly-5 board, distinct pentominoes can cover at most 26 of the 28 boundary squares and 56 of the 60 exterior unit edges. Both maxima occur in a full tiling. For the five Handy-Octs octiamonds, the least area of a convex triangular-grid enclosure is 43 unit triangles. There is one optimal enclosure and it has precisely five packings, up to lattice symmetries. We prove the bounds by finite enumeration.

Provenance statement

OpenAI Codex drafted the manuscript, wrote and ran the exhaustive enumerations and independent checks, and generated the figures from the placements. The contributors report that some parts have been checked and understood by a human. The paper credits the earlier constructions of Kate Jones and Nathan Gilbert and the impossibility result of George Sicherman.

Tools used

OpenAI
Codex

References

  1. K. Jones and Kadon Enterprises, Poly-5 (https://www.gamepuzzles.com/polycub2.htm#P5).link
  2. Kadon Enterprises, Poly-5: rare solutions (https://www.gamepuzzles.com/p5rare.htm).link
  3. Kadon Enterprises, Handy-Octs (https://www.gamepuzzles.com/handy-octs.htm).link

Version history

  1. v1 · 4 pagesSubmitted by William HoweInitial depositCurrentNov 19, 2026