Abstract
Mastermind is a well-known board game in which one player must discover a hidden color combination set up by an opponent, using the hints the latter provides (the number of places –or pegs– correctly guessed, and the number of colors rightly guessed but out of place in each move). This game has attracted much theoretical attention, since it constitutes a very interesting example of dynamically-constrained combinatorial problem, in which the set of feasible solutions changes with each combination played. We present an evolutionary approach to this problem whose main features are the seeded initialization of the population using feasible solutions discovered in the previous move, and the use of an entropy-based criterion to discern among feasible solutions. This criterion is aimed at maximizing the information that will be returned by the opponent upon playing a combination. Three variants of this approach, respectively based on the use of a single population and two cooperating or competing subpopulations are considered. It is shown that these variants achieve the playing level of previous state-of-the-art evolutionary approaches using much lower computational effort (as measured by the number of evaluations required).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, S.T., Lin, S.S., Huang, L.T.: A two-phase optimization algorithm for mastermind. Computer Journal 50(4), 435–443 (2007)
Goodrich, M.: On the algorithmic complexity of the Mastermind game with black-peg results. Information Processing Letters 109(13), 675–678 (2009)
Merelo-Guervós, J.J., Castillo, P., Rivas, V.: Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind. Applied Soft Computing 6(2), 170–179 (2006)
Stuckman, J., Zhang, G.Q.: Mastermind is NP-complete. INFOCOMP J. Comput. Sci. 5, 25–28 (2006)
Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA Journal 31(1), 13–34 (2008)
Merelo, J.J.: Genetic Mastermind, a case of dynamic constraint optimization. GeNeura Technical Report G-96-1, Universidad de Granada (1996)
Bernier, J.L., Herráiz, C.I., Merelo-Guervós, J.J., Olmeda, S., Prieto, A.: Solving mastermind using GAs and simulated annealing: a case of dynamic constraint optimization. In: Voigt, H.M., et al. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 553–563. Springer, Heidelberg (1996)
Berghman, L., Goossens, D., Leus, R.: Efficient solutions for Mastermind using genetic algorithms. Computers and Operations Research 36(6), 1880–1885 (2009)
Knuth, D.E.: The computer as Master Mind. J. Recreational Mathematics 9(1), 1–6 (1976-77)
Irving, R.W.: Towards an optimum Mastermind strategy. Journal of Recreational Mathematics 11(2), 81–87 (1978-79)
Neuwirth, E.: Some strategies for Mastermind. Zeitschrift fur Operations Research 26(8), B257–B278 (1982)
Bestavros, A., Belal, A.: Mastermind, a game of diagnosis strategies. Bulletin of the Faculty of Engineering, Alexandria University (December 1986)
Kooi, B.: Yet another Mastermind strategy. ICGA Journal 28(1), 13–20 (2005)
Bento, L., Pereira, L., Rosa, A.: Mastermind by evolutionary algorithms. In: Procs SAC 1999, pp. 307–311 (1999)
Kalisker, T., Camens, D.: Solving Mastermind using genetic algorithms. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1590–1591. Springer, Heidelberg (2003)
Runarsson, T.P., Merelo, J.J.: Adapting heuristic Mastermind strategies to evolutionary algorithms. In: González, J., et al. (eds.) Nature Inspired Cooperative Strategies for Optimization 2010, Granada, Spain. Studies in Computational Intelligence, vol. 284, pp. 255–267. Springer, Heidelberg (2010)
Merelo, J.J., Runarsson, T.P.: Finding better solutions to the mastermind puzzle using evolutionary algorithms. In: Di Chio, C., et al. (eds.) EvoApplicatons 2010. LNCS, vol. 6024, pp. 120–129. Springer, Heidelberg (2010)
Angeline, P., Pollack, J.: Competitive environments evolve better solutions for complex tasks. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 264–270. Morgan Kaufmann, San Francisco (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotta, C., Merelo Guervós, J.J., Mora Garćia, A.M., Runarsson, T.P. (2010). Entropy-Driven Evolutionary Approaches to the Mastermind Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)