按年被提到
20252025 · 1 次2026
算法与数据结构›游戏复杂度与博弈论·arXiv:2509.10846 · cs.CC

Man, these New York Times games are hard! A computational perspective

Alessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini, Daniele Muscillo, Alessandro Panconesi, Erasmo Tani · 2025
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2025-12-21 · 最近 2026-01-23
2不同的人
2活跃月份
2讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

The New York Times (NYT) games have found widespread popularity in recent years and reportedly account for an increasing fraction of the newspaper's readership. In this paper, we bring the computational lens to the study of New York Times games and consider four of them not previously studied: Letter Boxed, Pips, Strands and Tiles. We show that these games can be just as hard as they are fun. In particular, we characterize the hardness of several variants of computational problems related to these popular puzzle games. For Letter Boxed, we show that deciding whether an instance is solvable is in general NP-Complete, while in some parameter settings it can be done in polynomial time. Similarly, for Pips we prove that deciding whether a puzzle has a solution is NP-Complete even in some restricted classes of instances. We then show that one natural computational problem arising from Strands is NP-Complete in most parameter settings. Finally, we demonstrate that deciding whether a Tiles puzzle is solvable with a single, uninterrupted combo requires polynomial time.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

没有评论直接链到它;下面是它被提交的讨论串里回复最多的评论(不计入统计)
讨论串评论tianqi · 2026-01

“They are difficult. As I'm not a native English speaker, I didn't know many of the obscure words or usages, so I actually played these games from a purely computational perspective. I discovered early on that there were a lot of at least NPC problems in them. As my English improved (partially thanks to these games), intuitions began to help me take shortc…”

Man, these New York Times games are hard A computational perspective原评论 ↗
讨论串评论lelanthran · 2026-01

“I do wordle, strands and, when available (once a week) I do the midi. Wordle and strands together usually take less than 5m. The midi ranges from 3m30 (my best time) to ~12m (my worst). Not done Letterbox, Pips and Tiles, but I figured that all their puzzles are at the same level of difficulty. It's interesting, to me, that (from my reading of the pape…”

Man, these New York Times games are hard A computational perspective原评论 ↗
讨论串评论kitd · 2026-01

“I do Wordle, Pips, Strands, Connections & Sudoku. Of all of them, I find Connections definitely the hardest, even without the occasional US cultural references that I miss.”

Man, these New York Times games are hard A computational perspective原评论 ↗
被提交为 story · 2 次