Finding a needle in a haystack using hints and evolutionary computation: the case of Genetic Mastermind

J. J. Merelo, J. Carpio, P. Castillo, V. M. Rivas, G. Romero
GeNeura Team
todos@geneura.ugr.es, http://geneura.ugr.es

Abstract:

In this paper we present a new evolutionary algorithm that finds the hidden combination in the game of MasterMind by using the hints provided by the other player. The evolutionary algorithm finds the hidden combination in an optimal number of guesses, does not need a lot of memory, and examines only a minimal part of the search space. The algorithm is fast, and indeed plays in real time on the World Wide Web.