Solving the NY Times "Pips" game with F#

Dev cracks NYT’s new puzzle in seconds — commenters cry “robot mode” and app drama ensues

TLDR: A dev used F# to crack NYT’s Pips puzzle fast, showing off a smart trial-and-error solver with pruning. Commenters split between tooling wars and real-world gripes: some want Python or fancier math solvers, others can’t even find the game in the Android app—proof puzzles are now tech battlegrounds.

NYT’s newest brainteaser, Pips, just got speedrun: a developer used F# and a clever “try it, undo it” method to place dominoes and slice dead ends, solving even hard boards in seconds. Cool math party, right? The comments turned it into a cage match. One tinkerer shared a rival Python take, bragging they chase just one solution while this code hunts them all. Another chimed in with “did this in C#,” fanning the language pride. Meanwhile, the biggest plot twist: an Android subscriber says Pips doesn’t even show up in their NYT app, kicking off “Why is this hiding behind another app?” gripes and platform angst. The meme of the day is “I feel like a human SAT solver” — that’s a logic checker, not the college exam — while puzzle diehards pitch alternatives like SMT (heavy-duty math solvers) and CP (constraint programming) to judge difficulty and maybe beat the clock. There’s even a cheeky wink at the NYT posting puzzle data early if you peek at their JSON, which commenters treated like a secret backdoor. The vibe: half wowed by the engineering flex, half annoyed they can’t even find the game, and everyone itching to automate their late-night frustration.

Key Points

  • Pips is a New York Times puzzle that involves covering a grid with dominoes under pip-sum and placement constraints, with three daily difficulties.
  • The solver is implemented in F# on .NET using a backtracking algorithm that can find the first or all solutions.
  • Optimization techniques include using geometric tiling heuristics and aggressive pruning to cut the search space.
  • The article illustrates tiling logic (e.g., 2×3 rectangles, avoiding odd-cell leftovers) and structures tilings as a forest of trees to guide search.
  • Hard puzzles can have many solutions (some >100, one with 2,764,800), and an example solution was found in about 1 second (00:00:01.0045242).

Hottest takes

"it doesn't appear on the games page in my (Android) NY Times app" — eszed
"I quite like this game but it does feel a little like I'm a human SAT solver." — IshKebab
"considering an SMT or CP approach instead of backtracking" — sunrunner
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.