scientific article; zbMATH DE number 599564
From MaRDI portal
Publication:4297758
zbMath0925.90392MaRDI QIDQ4297758
Publication date: 11 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Strategy optimization for deductive games ⋮ 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 ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ Guessing bank PINs by winning a mastermind game ⋮ An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system ⋮ Conformant plans and beyond: principles and complexity ⋮ The number of pessimistic guesses in Generalized Mastermind ⋮ Efficient solutions for mastermind using genetic algorithms ⋮ 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
This page was built for publication:
