Playing Guess Who with your kids: code-word strategy against adversaries

DOI10.1016/J.TCS.2024.114766MaRDI QIDQ6614014FDOQ6614014

Authors: Ami Paz, Liat Peterfreund 

Publication date: 7 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

erasure codeserror correcting codesbinary searchGuess Who?Rényi-Ulam games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Solution of Ulam's problem on searching with a lie
• Title not available (Why is that?)
• Locating a target with an agent guided by unreliable local advice
• Introduction to Coding Theory
• Title not available (Why is that?)
• Mastermind
• Searching games with errors -- fifty years of coping with liars
• On Databases with Incomplete Information
• Title not available (Why is that?)
• Efficient solutions for mastermind using genetic algorithms
• Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
• Ulam's searching game with two lies
• Title not available (Why is that?)
• Query complexity of mastermind variants
• Delayed binary search, or playing twenty questions with a procrastinator
• OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH
• Playing Mastermind With Many Colors
• Navigating in Trees with Permanently Noisy Advice
• A framework for searching in graphs in the presence of errors

This page was built for publication: Playing Guess Who with your kids: code-word strategy against adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614014)