Mastermind (Q753814): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132291 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02579188 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4236316415 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:33, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mastermind |
scientific article |
Statements
Mastermind (English)
0 references
1983
0 references
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.
0 references
game
0 references
Mastermind
0 references