• Email Us: [email protected]
  • Contact Us: +1 718 874 1545
  • Skip to main content
  • Skip to primary sidebar

Medical Market Report

  • Home
  • All Reports
  • About Us
  • Contact Us

Finally, A Mathematical Algorithm For Winning At Guess Who?

August 14, 2025 by Deborah Bloomfield

If those are two ends of a spectrum, then beating your 7-year-old nibling at an elementary board game probably falls somewhere in the middle – but it’s precisely that which a new preprint, possibly written to justify a group outing to a pizza place, is tackling. “We prove[d] an optimal strategy for the children’s game Guess Who?,” the paper begins, “assuming the official rules are in use and that both players ask ‘classical’ questions with a bipartite response.”

That’s right: Guess Who?, the game in which you choose a distinctive face from a crowd of distinctive faces, and your opponent does the same, and then you each try to deduce which character the other has chosen. 

It’s “a game that probably intuitively feels very random who wins,” said Daniel Jones, a lecturer in math at the University of Birmingham who was not involved in the work. But that “is not necessarily the case,” he told New Scientist.

Indeed, by following the tactics described in the new paper, which has not been peer-reviewed, you can raise your odds of winning to almost two-thirds, assuming you start first. The idea, basically, is to target your questions so as to split the remaining figures by about half – the real number is found by a slightly more complicated formula, but it’s not that hard to work out – except in four specific cases: when you or your opponent only has one option left, and when your opponent has four possible faces left and you have either four, six, or 10. 

How you do that is up to you – though we have to warn you: people aren’t going to want to play with you if you follow this method properly. Especially if you follow the advanced techniques outlined in the paper to gain maximum advantage.

“By deploying a question containing an embedded paradox […] we can improve our chances of winning significantly,” the team write. By that, they mean asking mind-bending, non-answerable questions like “does your person have blond hair or do they have brown hair and the answer to this question is no?”

Sound complicated? That’s the point. “If we were to ask you this question and your person had blond hair, then you would say yes because the first line succeeds,” they explain. “If they had grey hair, then both parts fail and you would say no; but if they had brown hair then you would find yourself, in effect, answering: ‘Is the answer to this question no?’.”

“You cannot answer honestly, so we may assume that your head explodes,” they conclude, arguably over-dramatically. “Your head explosion can be treated as a third response.”

It’s a bit weird and complicated, but it does work. Follow this method, and you’ll have your kid niece or nephew crying at the next family get-together in record time – all you’ll need is a little mental math practice and a fair bit of step memorization.

Overall, though, “it’s not that difficult,” said software engineer Brian Rabern, who wasn’t involved in the paper, but did come up with the tricksy three-way head-explosion logic technique. 

“It […] take[s] a little bit of work and training,” he told New Scientist. “It’s just holding it all in your head at once that gets a little bit difficult, but each step is itself pretty straightforward.”

The paper, which has not been peer-reviewed, is published on the arXiv preprint server.

Deborah Bloomfield
Deborah Bloomfield

Related posts:

  1. Audi launches its newest EV, the 2022 Q4 e-tron SUV
  2. Dinosaur Prints Found Under Restaurant Table Confirmed As 100 Million Years Old
  3. Archax: Japanese Engineers Make Transformer Robot That Actually Works
  4. How Do We Know There Is Anything Beyond The Observable Universe?

Source Link: Finally, A Mathematical Algorithm For Winning At Guess Who?

Filed Under: News

Primary Sidebar

  • Watch Orcas Use “Tonic Immobility” To Suck An Enormous Liver Out Of The World’s Deadliest Shark
  • Ancient Micronesians Hunted Sharks 1,800 Years Ago, And Now We Know Which Species
  • World’s First Plasma “Fireballs” Help Explain Supermassive Black Hole Mystery
  • Why Do We Eat Chicken, And Not Birds Like Seagull And Swan?
  • How To Find Fossils? These Bright Orange Organisms Love Growing On Exposed Dinosaur Bones
  • Strange Patterns In Ancient Rocks Reveal Earth’s Tumbling Magnetic Field, Not Speeding Continents
  • Interstellar Comet 3I/ATLAS Can Now Be Seen From Earth – Even By Amateur Telescopes!
  • For 25 Years, People Have Been Living Continuously In Space – But What Happens Next?
  • People Are Not Happy After Learning How Horses Sweat
  • World’s First Generational Tobacco Ban Takes Effect For People Born After 2007
  • Why Was The Year 536 CE A Truly Terrible Time To Be Alive?
  • Inside The Myth Of The 15-Meter Congo Snake, Cryptozoology’s Most Outlandish Claim
  • NASA’s Voyager Spacecraft Found A 30,000-50,000 Kelvin “Wall” At The Edge Of Our Solar System
  • “Dueling Dinosaurs” Fossil Confirms Nanotyrannus As Own Species, Interstellar Comet 3I/ATLAS Is Back From Behind The Sun, And Much More This Week
  • This Is What Antarctica Would Look Like If All Its Ice Disappeared
  • Bacteria That Can Come Back From The Dead May Have Gone To Space: “They Are Playing Hide And Seek”
  • Earth’s Apex Predators: Meet The Animals That (Almost) Can’t Be Killed
  • What Looks And Smells Like Bird Poop? These Stinky Little Spiders That Don’t Want To Be Snacks
  • In 2020, A Bald Eagle Murder Mystery Led Wildlife Biologists To A Very Unexpected Culprit
  • Jupiter-Bound Mission To Study Interstellar Comet 3I/ATLAS From Deep Space This Weekend
  • Business
  • Health
  • News
  • Science
  • Technology
  • +1 718 874 1545
  • +91 78878 22626
  • [email protected]
Office Address
Prudour Pvt. Ltd. 420 Lexington Avenue Suite 300 New York City, NY 10170.

Powered by Prudour Network

Copyrights © 2025 · Medical Market Report. All Rights Reserved.

Go to mobile version