Playing Guess Who with Your Kids

Ami Paz*, Liat Peterfreund*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Guess who is a two-player search game in which each player chooses a character from a deck of 24 cards, and has to infer the other player's character by asking yes-no questions. A simple binary search strategy allows the starting player find the opponent's character by asking 5 questions only, when the opponent is honest. Real-life observations show that in more realistic scenarios, the game is played against adversaries that do not strictly follow the rules, e.g., kids. Such players might decide to answer all questions at once, answer only part of the questions as they do not know the answers to all, and even lie occasionally. We devise strategies for such scenarios using techniques from error-correcting and erasure codes. This connects to a recent line of work on search problems on graphs and trees with unreliable auxiliary information, and could be of independent interest.

Original languageEnglish
Title of host publication11th International Conference on Fun with Algorithms, FUN 2022
EditorsPierre Fraigniaud, Yushi Uno
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772327
DOIs
StatePublished - 1 May 2022
Externally publishedYes
Event11th International Conference on Fun with Algorithms, FUN 2022 - Sicily, Italy
Duration: 30 May 20223 Jun 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume226
ISSN (Print)1868-8969

Conference

Conference11th International Conference on Fun with Algorithms, FUN 2022
Country/TerritoryItaly
CitySicily
Period30/05/223/06/22

Bibliographical note

Publisher Copyright:
© Ami Paz and Liat Peterfreund.

Keywords

  • Binary Search
  • Erasure Codes
  • Error Correcting Codes
  • Guess Who?

Fingerprint

Dive into the research topics of 'Playing Guess Who with Your Kids'. Together they form a unique fingerprint.

Cite this