July 28, 2026

52-card pickup, comment-section edition

Can LLMs identify 16 cards in 45 bit-queries?

AI tackles a card puzzle, but the comments are busy calling out errors and math drama

TLDR: An AI-assisted effort aimed at a hard card puzzle got attention for pushing at the edge of math research, but the loudest reaction was readers questioning whether the example and simulator even work as claimed. The comments turned into a mini-trial over bugs, missing explanations, and whether the flashy claim adds up.

A shiny new post about using an artificial intelligence chatbot to attack a fiendish card puzzle should have been a victory lap for math-meets-machine hype. Instead, the real spectacle broke out in the replies, where readers instantly turned into fact-checking detectives, skeptics, and chaos gremlins. The puzzle sounds simple enough for non-math people to follow: hidden cards, yes-or-no questions, and the challenge of figuring everything out in fewer moves than the obvious brute-force method. But the moment the article claimed the smaller version could be solved in under 5 questions, the comment section smelled blood.

One reader flatly declared the simulator looked busted, accusing it of spitting out the same weird answer pattern and dropping the insult “vibe slop” like a gauntlet. Another came in with the cooler-but-deadlier energy of a person doing the arithmetic on a napkin and saying, hold on, there are 24 possible arrangements here, so why is this being sold as always solvable in under five questions? Translation for everyone at home: the community wasn’t just debating the big AI achievement — they were questioning whether the demo itself was playing fair.

That’s what makes this such delicious internet drama. On one side: wonder about whether large language models, or AI text systems, can help crack real unsolved math problems. On the other: commenters basically yelling, “Before we crown the robot, can someone fix the toy?” It’s part math flex, part bug hunt, part public trust exercise — and the crowd clearly thinks the details matter as much as the headline.

Key Points

  • The article presents a 16-card generalization of a simpler 4-card query puzzle and frames it as an open mathematical problem.
  • In the 16-card version, each card encodes a 4-bit value, and each query reveals one bit by checking one property of one card.
  • A brute-force strategy requires 64 queries, while the article asks whether the arrangement can be recovered in under 50 worst-case queries.
  • The problem is formalized as identifying a hidden permutation adaptively, with a minimum query count denoted as T(4).
  • The article says its broader analysis includes an LLM-agent search process, fifty iterations of performance evolution, and links to a related conjecture by Donald Knuth.

Hottest takes

"vibe slop?" — pxx
"something is wrong with your first simulator" — pxx
"Is there a technique I am missing?" — mcphage
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.