Solving static permutation mastermind using \(O(n \log n)\) queries

DOI10.37236/10280zbMath1482.91054arXiv2103.02527OpenAlexW4229014360MaRDI QIDQ2073315

Anders Martinsson, Angelika Steger, Maxime Larcher

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.02527

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Mastermind
• On the query complexity of black-peg AB-mastermind
• Bounds for the static permutation mastermind game
• On the metric dimension of Cartesian powers of a graph
• Playing Mastermind With Many Colors

This page was built for publication: Solving static permutation mastermind using \(O(n \log n)\) queries