Computer Science – Neural and Evolutionary Computing
Scientific paper
2009-12-12
Computer Science
Neural and Evolutionary Computing
Accepted at the NICSO'10 conference
Scientific paper
The art of solving the Mastermind puzzle was initiated by Donald Knuth and is already more than 30 years old; despite that, it still receives much attention in operational research and computer games journals, not to mention the nature-inspired stochastic algorithm literature. In this paper we try to suggest a strategy that will allow nature-inspired algorithms to obtain results as good as those based on exhaustive search strategies; in order to do that, we first review, compare and improve current approaches to solving the puzzle; then we test one of these strategies with an estimation of distribution algorithm. Finally, we try to find a strategy that falls short of being exhaustive, and is then amenable for inclusion in nature inspired algorithms (such as evolutionary or particle swarm algorithms). This paper proves that by the incorporation of local entropy into the fitness function of the evolutionary algorithm it becomes a better player than a random one, and gives a rule of thumb on how to incorporate the best heuristic strategies to evolutionary algorithms without incurring in an excessive computational cost.
Merelo-Guervos Juan J.
Runarsson Tomas Philip
No associations
LandOfFree
Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-533182