scientific article; zbMATH DE number 3559318
From MaRDI portal
Publication:4132291
zbMATH Open0358.90075MaRDI QIDQ4132291FDOQ4132291
Publication date: 1977
Title of this publication is not available (Why is that?)
Cited In (27)
- The Query Complexity of Finding a Hidden Permutation
- On the algorithmic complexity of the Mastermind game with black-peg results
- Finding a hidden code by asking questions
- Guessing bank PINs by winning a mastermind game
- Title not available (Why is that?)
- The number of pessimistic guesses in Generalized Mastermind
- Solving static permutation mastermind using \(O(n \log n)\) queries
- Bounding memory for Mastermind might not make it harder
- An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system
- On the query complexity of black-peg AB-mastermind
- Query complexity of mastermind variants
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
- Playing Guess Who with your kids: code-word strategy against adversaries
- The number of pessimistic guesses in generalized black-peg mastermind
- Taking complete finite prefixes to high level, symbolically
- Playing mastermind with constant-size memory
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- Conformant plans and beyond: principles and complexity
- Mastermind with a linear number of queries
- Efficient solutions for mastermind using genetic algorithms
- On the metric dimension of Cartesian powers of a graph
- The exact query complexity of yes-no permutation mastermind
- Strategy optimization for deductive games
- The worst case number of questions in generalized AB game with and without white-peg answers
- An Introduction to Security API Analysis
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Mastermind
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132291)