A two-phase optimization algorithm for mastermind

Computer Journal

Volumn 50, Issue 4, 2007, Pages 435-443

  Chen, Shan Tai ^a   Lin, Shun Shii ^b   Huang, Li Te ^b  

^a NATIONAL DEFENSE UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Deductive game; Mastermind; Search strategies

Indexed keywords

CONSTRUCTIVE HEURISTIC; DEDUCTIVE GAME; SEARCH STRATEGIES; TWO-PHASE OPTIMIZATION ALGORITHM;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; GAME THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION;

COMPUTER SCIENCE;

EID: 34447499942     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm006     Document Type: Article

References (36)

1. Knuth, D.E. (1976) The computer as Mastermind. J. Recr. Math., 9, 1-6.
2. Stuckman, J. and Zhang, G.Q. (2006) Mastermind is NP-Complete. INFOCOMP J. Comput. Sci., 5, 25-28.
3. Merelo, J.J., Carpio, J., Castillo, P., Rivas, V.M. and Romero, G. (1999) Finding a needle in a haystack using hints and evolutionary computation: The case of genetic Mastermind. Genetic and Evolutionary Comput. Conf. Late Breaking Papers Books, Orlando, Florida, July, 13-17, 184-192. Morgan Kaufmann, San Francisco.
4. Irving, R.W. (1978-79) Towards an optimum Mastermind strategy. J. Recr. Math., 11, 81-87.
5. Neuwirth, E. (1982) Some strategies for Mastermind. Z. Oper. Res., 26, 257-278.
6. Koyama, K. and Lai, T.W. (1993) An optimal Mastermind strategy. J. Recr. Math., 25, 251-256.
7. Ko, K.I. and Teng, S.C. (1986) On the number of queries necessary to identify a permutation. J. Algorithms, 7, 449-462.
8. Flood, M.M. (1988) Sequential search strategies with Mastermind variants - Part 1. J. Recr. Math., 20, 105-126.
9. Bento, L., Pereira, L. and Rosa, A. (1999) Mastermind by evolutionary algorithms. Proc. 1999 ACM Symp. Applied Computing, San Antonia, Texas, 28 February-2 March. 307-311. ACM Press, New York.
10. Kalisker, T. and Camens, D. (2003) Solving Mastermind using genetic algorithms. Lect. Notes Comput. Sci., 2724, 1590-1591.
11. Roche, J. R. (1997) The value of adaptive questions in generalized Mastermind. Proc. 1997 IEEE Int. Symp. Information Theory, Ulm, Germany, 29 June-4 July. 135-135. IEEE Press, New Jersey.
12. Kabatianski, G., Lebedev, V. and Thorpe, J. (2000) The Mastermind game and the rigidity of the Hamming space. Proc. 2000 IEEE Int. Symp. Information Theory, Sorrento, Italy, 25-30 June, pp. 375-375. IEEE Press, New Jersey.
13. Chen, S.T. and Lin, S.S. (2004) Optimal algorithms for 2 × n Mastermind games - a graph-partition approach. Comput. J., 47 602-611.
14. Barteld, K. (2005) Yet another Mastermind strategy. Int. Comput. Games Assoc. J., 28, 13-20.
15. Blum, C. and Roli, A. (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35, 268-308.
16. Holland, J.H. (1975) Adaptation in Natural and Arstificial Systems University of Michigan Press, Ann Arbor.
17. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983) Optimization by simulated annealing. Science, 220, 671-680.
18. Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res., 13, 533-549.
19. Glover, F. (1990) Tabu search - Part II. ORSA J. Comput., 2, 4-32.
20. Dorigo, M. and Gambardella, L.M. (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput., 1, 53-66.
21. Ruiz, R. and St Äutzle, T. (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res., 177, 2033-2049.
22. Harvey, W.D. and Ginsberg, M.L. (1995) Limited discrepancy search. Proc. Fourteenth Int. Joint Conf. Artificial Intelligence, Québec, 20-25 August, pp. 607-613. Morgan Kaufmann, San Francisco.
23. Bresina, J.L. (1996) Heuristic-biased stochastic sampling. Proc. Thirteenth Nat. Conf. Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conf., Oregon, Portland, 4-8 August, pp. 271-278, AAAI Press, Menlo Park.
24. Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G. and Trubian, M. (1996) Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res., 3, 1-21.
25. Billings, D., Papp, D., Peña, L., Schaeffer, J. and Szafron, D. (1999) Using selective-sampling simulations in poker. Proc. AAAI Spring Symp. Search Techniques for Problem Solving under Uncertainty and Incomplete Information, Stanford, CA, USA, March, 13-18. AAAI Press, Menlo Park.
26. Juilĺe, H. and Pollack, J.B. (1998) A sampling-based heuristic for tree search applied to grammar induction. Proc. 15th Natl Conf. Artificial Intelligence, Wisconsin, 26-30 July, 776-783. American Association for Artificial Intelligence, Menlo Park.
27. Ruml, W. (2001) Incomplete tree search using adaptive probing. Proc. 17th Int. Joint Conf. Artificial Intelligence, Washington, 4-10 August, Seattle, pp. 235-241. Morgan Kaufmann, San Francisco.
28. Feo, T.A. and Resende, M. G. C. (1995) Greedy randomized adaptive search procedures. J. Glob. Optim., 6, 109-133.
29. Pitsoulis, L.S. and Resende, M.G.C. (2002) Greedy randomized adaptive search procedure. In Pardalos, P. and Resende, M. (eds), Handbook of Applied Optimization. Oxford University.
30. Helmstetter, B. and Cazenave, T. (2003) Searching with analysis of dependencies in a solitaire card game. In van den Herik, H.J., Iida, H. and Heinz, E.A. (eds), Advances in Computer Games 10, Kluwer Academic Publishers, Netherlands.
31. Coulom, R. (2006) Efficient selectivity and backup operators in Monte-Carlo tree search. Proc. Fifth Conf. Computers and Games, Italy, May, 29-31, Springer-Verlag, New York.
32. Chen, S.T. and Lin, S.S. (2004) Optimal algorithms for 2 × n AB games - a graph-partition approach. J. Inf. Sci. Eng., 20, 105-126.
33. Sedgewick, R. (1988) Algorithms (2nd edn). Addison-Wesley, Boston.
34. Chen, S.T. (2004) On the study of optimization algorithms for deductive games and related problems. PhD Dissertation, National Taiwan Normal University, Taipei, R.O.C.
35. Russell, S. and Norvig, P. (2003) Artificial Intelligence: A Modern Approach (2nd edn). Prentice-Hall, New Jersey.
36. Lin, S.S. (2005). Mastermind Games & AB Games. Available at: http:// www.csie.ntnu.edu.tw/~linss/deductivegame/index.htm.