HackerPapers

arXiv:2501.09286math.HO

Mathematics of the NYT daily word game Waffle

S. P. Glasby

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
7 pages, 5 color figures (and 2 inline figures); clarified text in places
Journal reference
DOI
Subjects
math.HOHistory and Overview

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2025 to Jan 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.