Mathematics of the NYT daily word game Waffle
History and Overview
2026-04-13 v3
Abstract
This note investigates the combinatorics of permutations underlying the NYT daily word game Waffle. It helps to solve Waffle games and helps to understand why some games are easy to solve while others are very hard. It shows that a perfect unscrambling must have precisely 11 orbits, with at least one of length 1, on the 21 Waffle squares. It also describes practical algorithms for solving Waffle games and creating new games with extreme properties.
Keywords
Cite
@article{arxiv.2501.09286,
title = {Mathematics of the NYT daily word game Waffle},
author = {S. P. Glasby},
journal= {arXiv preprint arXiv:2501.09286},
year = {2026}
}
Comments
7 pages, 5 color figures (and 2 inline figures); clarified text in places