Detecting errors in searching games
type: Item
instance of: scholarly article
title: Detecting errors in searching games
zbMATH Open document ID: 0671.90100
DOI: 10.1016/0097-3165(89)90075-7
author: Andrzej Pelc
published in: Journal of Combinatorial Theory. Series A
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 94A24
zbMATH DE Number: 4099083
zbMATH Keywords: Ulam's problem
zbMATH Keywords: two-person searching games
zbMATH Keywords: erroneous information
zbMATH Keywords: Responder
zbMATH Keywords: Questioner
zbMATH Keywords: optimal winning strategies
zbMATH Keywords: k-error detecting code
MaRDI profile type: Publication
full work available at URL: 0097-3165(89)90075-7
OpenAlex ID: W2038204127
cites work: Ulam's searching game with two lies
cites work: Q4146667
cites work: Solution of Ulam's problem on searching with a lie
cites work: Coping with errors in binary search procedures
cites work: Q4121861
description: scientific article; zbMATH DE number 4099083