The number of pessimistic guesses in Generalized Mastermind
From MaRDI portal
Publication:987843
DOI10.1016/j.ipl.2009.02.016zbMath1197.91064OpenAlexW2086094029MaRDI QIDQ987843
Marcin Peczarski, Gerold Jäger
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.016
Related Items (8)
On the query complexity of black-peg AB-mastermind ⋮ Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ Bounds for the static permutation mastermind game ⋮ Guessing bank PINs by winning a mastermind game ⋮ The worst case number of questions in generalized AB game with and without white-peg answers ⋮ Bounding memory for Mastermind might not make it harder
Cites Work
This page was built for publication: The number of pessimistic guesses in Generalized Mastermind
