On the algorithmic complexity of the Mastermind game with black-peg results
type: Item
instance of: scholarly article
title: On the algorithmic complexity of the Mastermind game with black-peg results
zbMATH Open document ID: 1197.91063
author: Michael T. Goodrich
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 5773775
zbMATH Keywords: algorithms
zbMATH Keywords: NP-completeness
zbMATH Keywords: mastermind
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.02.021
OpenAlex ID: W2045496672
cites work: Mastermind
cites work: Q4198056
cites work: Q4132291
DOI: 10.1016/J.IPL.2009.02.021
Recommended article: On the query complexity of black-peg AB-mastermind
Recommended article: The number of pessimistic guesses in generalized black-peg mastermind
Recommended article: The query complexity of a permutation-based variant of mastermind
Recommended article: An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs
Recommended article: Bounds for the static permutation mastermind game
Recommended article: Query complexity of mastermind variants
Recommended article: Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
Recommended article: An optimal strategy for static black-peg mastermind with three pegs
Recommended article: On the Complexity of Master Problems
description: scientific article; zbMATH DE number 5773775