Man, these New York Times games are hard! A computational perspective
Summary
The paper analyzes four NYT games—Letter Boxed, Pips, Strands, and Tiles—from a computational perspective, showing that solving many instances is NP-Complete and identifying parameter ranges where problems become tractable. It demonstrates formal hardness results and discusses implications for puzzle design and algorithmic problem-solving.