The number of pessimistic guesses in generalized black-peg mastermind
type: Item
instance of: scholarly article
title: The number of pessimistic guesses in generalized black-peg mastermind
zbMATH Open document ID: 1260.68288
author: Gerold Jäger
author: Marcin Peczarski
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 6150466
zbMATH Keywords: combinatorial problems
zbMATH Keywords: algorithms
zbMATH Keywords: mastermind
zbMATH Keywords: logic game
zbMATH Keywords: computer-aided proof
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.009
OpenAlex ID: W2119265122
cites work: Mastermind
cites work: Q4457558
cites work: Q4660333
cites work: On the algorithmic complexity of the Mastermind game with black-peg results
cites work: Q4426304
cites work: The number of pessimistic guesses in Generalized Mastermind
cites work: Q4449752
cites work: Q4132291
cites work: Q4297758
cites work: Isomorph-Free Exhaustive Generation
cites work: Q4426305
DOI: 10.1016/J.IPL.2011.06.009
description: scientific article; zbMATH DE number 6150466