The number of pessimistic guesses in generalized black-peg mastermind

DOI10.1016/j.ipl.2011.06.009zbMath1260.68288OpenAlexW2119265122MaRDI QIDQ1944171

Marcin Peczarski, Gerold Jäger

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.009

zbMATH Keywords

algorithmscombinatorial problemscomputer-aided proofmastermindlogic game

Mathematics Subject Classification ID

2-person games (91A05) Combinatorics in computer science (68R05) Combinatorial games (91A46)

Related Items (10)

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 ⋮ Query complexity of mastermind variants ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the static permutation mastermind game ⋮ Playing mastermind with constant-size memory ⋮ 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

• Mastermind
• The number of pessimistic guesses in Generalized Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• Isomorph-Free Exhaustive Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of pessimistic guesses in generalized black-peg mastermind