scientific article; zbMATH DE number 3559318
From MaRDI portal
Publication:4132291
zbMath0358.90075MaRDI QIDQ4132291
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
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 ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Query complexity of mastermind variants ⋮ On the metric dimension of Cartesian powers of a graph ⋮ Finding a hidden code by asking questions ⋮ Unnamed Item ⋮ The number of pessimistic guesses in generalized black-peg mastermind ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Guessing bank PINs by winning a mastermind game ⋮ Playing mastermind with constant-size memory ⋮ 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 ⋮ On the algorithmic complexity of the Mastermind game with black-peg results ⋮ Efficient solutions for mastermind using genetic algorithms ⋮ Mastermind ⋮ An Introduction to Security API Analysis ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Solving static permutation mastermind using \(O(n \log n)\) queries ⋮ The Query Complexity of Finding a Hidden Permutation ⋮ 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:
