Mathematics of the NYT daily word game Waffle
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914461936254976 |
|---|---|
| author | Glasby, S. P. |
| author_facet | Glasby, S. P. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09286 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Mathematics of the NYT daily word game Waffle Glasby, S. P. History and Overview 00A08 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. |
| title | Mathematics of the NYT daily word game Waffle |
| topic | History and Overview 00A08 |
| url | https://arxiv.org/abs/2501.09286 |