%0 Journal Article %1 Merelo:2006:ASC %A Merelo-Guervos, J. J. %A Castillo, P. %A Rivas, V. M. %D 2006 %J Applied Soft Computing %K Evolutionary MasterMind algorithm, %N 2 %P 170--179 %R doi:10.1016/j.asoc.2004.09.003 %T Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind %V 6 %X In this paper we present a new version of an evolutionary algorithm that finds the hidden combination in the game of MasterMind by using hints on how close is a combination played to it. The evolutionary algorithm finds the hidden combination in an optimal number of guesses, is efficient in terms of memory and CPU, and examines only a minimal part of the search space. The algorithm is fast, and indeed previous versions can be played in real time on the world wide web. This new version of the algorithm is presented and compared with theoretical bounds and other algorithms. We also examine how the algorithm scales with search space size, and its performance for different values of the EA parameters.

@article{Merelo:2006:ASC, abstract = {In this paper we present a new version of an evolutionary algorithm that finds the hidden combination in the game of MasterMind by using hints on how close is a combination played to it. The evolutionary algorithm finds the hidden combination in an optimal number of guesses, is efficient in terms of memory and CPU, and examines only a minimal part of the search space. The algorithm is fast, and indeed previous versions can be played in real time on the world wide web. This new version of the algorithm is presented and compared with theoretical bounds and other algorithms. We also examine how the algorithm scales with search space size, and its performance for different values of the EA parameters.}, added-at = {2008-06-19T17:46:40.000+0200}, author = {Merelo-Guervos, J. J. and Castillo, P. and Rivas, V. M.}, biburl = {https://www.bibsonomy.org/bibtex/2c639f9022c6bd28d716c62d28ac6691e/brazovayeye}, doi = {doi:10.1016/j.asoc.2004.09.003}, interhash = {2d37a338a8303b919a62e803997898e9}, intrahash = {c639f9022c6bd28d716c62d28ac6691e}, issn = {1568-4946}, journal = {Applied Soft Computing}, keywords = {Evolutionary MasterMind algorithm,}, month = {January}, notes = {cf GP mailing list about Thu, 08 Mar 2007 22:22:37 +0100}, number = 2, pages = {170--179}, timestamp = {2008-06-19T17:46:53.000+0200}, title = {Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind}, volume = 6, year = 2006 }