Some strategies for mastermind

@article{Neuwirth1982SomeSF,
  title={Some strategies for mastermind},
  author={E. Neuwirth},
  journal={Zeitschrift f{\"u}r Operations Research},
  year={1982},
  volume={26},
  pages={B257-B278}
}
  • E. Neuwirth
  • Published 1982
  • Computer Science
  • Zeitschrift für Operations Research
  • SummaryThe aim of this paper is to present some methods of construction for strategies for the game “Mastermind”.Some of these methods were already published before by other authors, but in this paper an approach unifying most of these methods is used. Numerical results for expectation and maximum number of questions needed to finish the game are presented for different versions of the game. By combining some of these methods a strategy slightly better than all strategies published by other… CONTINUE READING
    46 Citations

    Topics from this paper

    Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach
    • 16
    • Highly Influenced
    Strategy optimization for deductive games
    • 10
    Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie
    • 2
    • Highly Influenced
    Assessing efficiency of different evolutionary strategies playing MasterMind
    • 9
    • PDF
    An experimental study of exhaustive solutions for the Mastermind puzzle
    • 6
    • PDF
    Analyzing Games of Information
    • Highly Influenced
    Methoden der Denk- und Problemlöseforschung
    • 6
    • PDF
    Optimal Algorithms for 2xn AB Games - A Graph-Partition Approach
    • 12
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    Une formalisation du jeu de Mastermind
    • 4
    • PDF
    The Computer as Master Mind
    • 101
    Dynamic Programming
    • 77
    Information Theory and Statistics
    • 3,607