Finding better solutions to the mastermind puzzle using evolutionary algorithms

Authors:
Juan J. Merelo-Guervós;Thomas Philip Runarsson
Affiliations:
Department of Architecture and Computer Technology, ETSIIT, University of Granada, Spain;School of Engineering and Natural Sciences, University of Iceland
Venue:
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Year:
2010

Citing 3
Cited 1

Solving Master Mind Using GAs and Simulated Annealing: A Case of Dynamic Constraint Optimization

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Efficient solutions for Mastermind using genetic algorithms

Computers and Operations Research
Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind

Applied Soft Computing

Improving evolutionary solutions to the game of mastermind using an entropy-based scoring method

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The art of solving the Mastermind puzzle was initiated by Donald Knuth and is already more than thirty 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 revisit the application of evolutionary algorithms to solving it and trying some recently-found results to an evolutionary algorithm. The most parts heuristic is used to select guesses found by the evolutionary algorithms in an attempt to find solutions that are closer to those found by exhaustive search algorithms, but at the same time, possibly have better scaling properties when the size of the puzzle increases.