Strategy optimization for deductive games

European Journal of Operational Research

Volumn 183, Issue 2, 2007, Pages 757-766

  Chen, Shan Tai ^a   Lin, Shun Shii ^b   Huang, Li Te ^b   Hsu, Sheng Hsuan ^c  

^a NATIONAL DEFENSE UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

^c CHINESE CULTURE UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Bulls and cows; Mastermind; Pigeonhole principle; Search strategies

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; COMPUTER AIDED ANALYSIS; OPTIMIZATION; THEOREM PROVING;

DEDUCTIVE GAMES; PIGEONHOLE PRINCIPLE; SEARCH STRATEGIES;

GAME THEORY;

EID: 34250026665     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.08.058     Document Type: Article

References (22)

1. L. Bento, L. Pereira, A. Rosa, Mastermind by evolutionary algorithms, in: Proceedings of the International Symposium on Applied Computing, 1999, pp. 307-311.
2. J.L. Bernier, C.I. Herraiz, J.J. Merelo, S. Olmeda, A. Prieto, Solving mastermind using gas and simulated annealing: A case of dynamic constraint optimization, in: Proceedings PPSN, Parallel Problem Solving from Nature IV, in Computer Science, 1141, 1996, pp. 554-563.
3. Chen S.T., and Lin S.S. Optimal algorithms for 2 × n AB games - A graph-partition approach. Journal of Information Science and Engineering 20 1 (2004) 105-126
4. Chen S.T., and Lin S.S. Optimal algorithms for 2 × n mastermind games - A graph-partition approach. Computer Journal 47 5 (2004) 602-611
5. S.T. Chen, S.S. Lin, Novel algorithms for deductive games, in: Proceedings of the 2004 International Computer Symposium, Taipei, Taiwan, December 15-17, 2004, pp. 517-522.
6. Chen Z., and Cunha C. Finding a hidden code by asking questions, COCOON'96. Computing and Combinatorics (1996) 50-55
7. Flood M.M. Sequential search strategies with Mastermind variants-Part 1. Journal of Recreational Mathematics 20 2 (1988) 105-126
8. Irving R.W. Towards an optimum Mastermind strategy. Journal of Recreational Mathematics 11 2 (1978-79) 81-87
9. G. Kabatianski, V. Lebedev, V. Lebedev, The Mastermind game and the rigidity of the hamming space, in: Proceedings of the International Symposium on Information Theory IEEE, 2000, pp. 375-375.
10. Kalisker T., and Camens D. Solving mastermind using genetic algorithms. GECCO 2003, LNCS 2724 (2003) 1590-1591
11. Knuth D.E. The computer as Mastermind. Journal of Recreational Mathematics 9 1 (1976) 1-6
12. D.E. Knuth, The art of computer programming - sorting and searching, vol. 3, second ed., 1998.
13. Ko K.-I., and Teng S.-C. On the number of queries necessary to identify a permutation. Journal of Algorithms 7 (1986) 449-462
14. Kooi B. Yet another mastermind strategy. ICGA Journal 28 1 (2005) 13-20
15. Koyama K., and Lai T.W. An optimal Mastermind strategy. Journal of Recreational Mathematics 25 (1993) 251-256
16. S.S. Lin, 2005, Web site: .
17. J.J. Merelo, J. Carpio, P. Castillo, V.M. Rivas, G. Romero, (GeNeura Team), Finding a needle in a haystack using hints and evolutionary computation: The case of Genetic Mastermind, in: Genetic and Evolutionary Computation Conference late breaking papers books, 1999, pp. 184-192.
18. Neuwirth E. Some strategies for Mastermind. Zeitschrift fur Operations Research 26 (1982) 257-278
19. J.R. Roche, The value of adaptive questions in generalized Mastermind, in: Proceedings of the International Symposium on Information Theory IEEE, 1997, pp. 135-135.
20. Rosen K.H. Discrete Mathematics and its Applications. fifth ed. (2003), McGraw-Hill
21. Russell S., and Norvig P. Artificial Intelligence: A Modern Approach (2003), Prentice-Hall
22. Sedgewick R. Algorithms. second ed. (1988), Addison-Wesley