Optimal strategies for the static black-peg AB game with two and three pegs
type: Item
instance of: scholarly article
title: Optimal strategies for the static black-peg AB game with two and three pegs
author: Gerold Jäger
author: Frank Drewes
published in: Discrete Mathematics, Algorithms and Applications
publication date: 2024-11-13T00:00:00Z
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 7942953
zbMATH Keywords: game theory
zbMATH Keywords: mastermind
zbMATH Keywords: AB game
zbMATH Keywords: optimal strategy
MaRDI profile type: Publication
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: Mastermind
cites work: Playing Mastermind With Many Colors
cites work: On the query complexity of black-peg AB-mastermind
cites work: Q5731202
cites work: Computing the metric dimension for chain graphs
cites work: Guessing bank PINs by winning a mastermind game
cites work: Q4198056
cites work: Bounds for static black-peg AB mastermind
cites work: Bounds for the static permutation mastermind game
cites work: Q4457558
cites work: An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs
cites work: An optimal strategy for static black-peg mastermind with three pegs
cites work: The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
cites work: The number of pessimistic guesses in Generalized Mastermind
cites work: The worst case number of questions in generalized AB game with and without white-peg answers
cites work: On the number of queries necessary to identify a permutation
cites work: Solving static permutation mastermind using \(O(n \log n)\) queries
cites work: The metric dimension of strong product graphs
cites work: A Combinatory Detection Problem
cites work: On the metric dimension of corona product graphs
DOI: 10.1142/S1793830923500490
description: scientific article; zbMATH DE number 7942953