Mastermind
type: Item
instance of: scholarly article
title: Mastermind
zbMATH Open document ID: 0717.05002
DOI: 10.1007/BF02579188
author: D. Kharzeev
published in: Combinatorica
publication date: 1983-01-01T00:00:00Z
review text: In the game ``Mastermind'' a player must determine a vector \((x_ 1,...,x_ n)\), \(1\leq x_ i\leq k\). He guesses a vector \((q_ 1,...,q_ n)\) and is told the number of i for which \(q_ i=x_ i\) and the maximum number, over all permutations \(\phi\) on \(\{\) 1,...,n\(\}\), of i with \(q_ i=x_{\phi_ i}\). For \(n=4\) and \(k=6\) this is a popular commercial game. The strategy of selecting vectors q at random is examined and shown to be close to optimal in some cases.
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 4181332
zbMATH Keywords: game
zbMATH Keywords: Mastermind
MaRDI profile type: Publication
cites work: Q4132291
full work available at URL: https://doi.org/10.1007/bf02579188
OpenAlex ID: W4236316415
description: scientific article; zbMATH DE number 4181332