scientific article; zbMATH DE number 599564
From MaRDI portal
Publication:4297758
Cited in
(14)- Efficient solutions for mastermind using genetic algorithms
- On the query complexity of black-peg AB-mastermind
- The number of pessimistic guesses in generalized black-peg mastermind
- An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system
- 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
- Strategy optimization for deductive games
- 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
- Taking complete finite prefixes to high level, symbolically
- Mastermind with a linear number of queries
- Guessing bank PINs by winning a mastermind game
- Conformant plans and beyond: principles and complexity
- The number of pessimistic guesses in Generalized 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 Q4297758)
