Counting crossword puzzle grids with sufficiently long answers
Ars Combinatoria · 17.06.2026 · 167 · 159-180
DOI: 10.61091/ars167-11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 17.06.2026. Verfasst von Ben Coté und 3 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, we explore the enumerative combinatorics of American-style crossword puzzle grids under modified answer length requirements. While standard American-style crossword rules have a minimum answer length of three cells, we generalize this constraint to a minimum length \(m\) for an \(n\times n\) grid. We define \(\lvert Puz (n,m)\rvert\) as the number of such grids satisfying the standard structural rules of connectivity, \(180^\circ\) rotational symmetry, keyed squares, and full dimensionality. We prove that for \(m>\frac{n}{2}\), the number of valid grids is invariant under the transformation \(\lvert Puz (n,m)\rvert=\lvert Puz (n+1,m+1)\rvert\). Furthermore, we establish a closed-form formula for \(\lvert Puz (n,m)\rvert\) when \(m>\frac{n}{2}\). We also verify some counts for smaller grid dimensions verifying previously conjectured values.
Zitieren
APA
Coté, B., Flesch, B., Hiebert, J., & Merrill, L. (2026). Counting crossword puzzle grids with sufficiently long answers. Ars Combinatoria, 167, 159-180. https://doi.org/10.61091/ars167-11
Vancouver
Coté B, Flesch B, Hiebert J, Merrill L. Counting crossword puzzle grids with sufficiently long answers. Ars Combinatoria. 2026;167:159-180. doi:10.61091/ars167-11
BibTeX
@article{Cot2026,
author = {Coté, Ben and Flesch, Breeann and Hiebert, Jasmine and Merrill, Leanne},
title = {Counting crossword puzzle grids with sufficiently long answers},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {159--180},
doi = {10.61091/ars167-11}
}
EUVIMED