On the number of queries necessary to identify a permutation
Journal of Algorithms
Sequential circuit test generation in a genetic algorithm framework
DAC '94 Proceedings of the 31st annual Design Automation Conference
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Mastermind by evolutionary algorithms
Proceedings of the 1999 ACM symposium on Applied computing
Decision Support Systems and Intelligent Systems
Decision Support Systems and Intelligent Systems
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
Finding a Hidden Code by Asking Questions
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Evolving Objects: A General Purpose Evolutionary Computation Library
Selected Papers from the 5th European Conference on Artificial Evolution
Solving mastermind using genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Efficient solutions for Mastermind using genetic algorithms
Computers and Operations Research
The number of pessimistic guesses in Generalized Mastermind
Information Processing Letters
Entropy-driven evolutionary approaches to the mastermind problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Improving and scaling evolutionary approaches to the mastermind problem
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Finding better solutions to the mastermind puzzle using evolutionary algorithms
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Optimal analyses for 3×n AB games in the worst case
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
The number of pessimistic guesses in Generalized Black-peg Mastermind
Information Processing Letters
Comparing evolutionary algorithms to solve the game of mastermind
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle
Applied Intelligence
Hi-index | 0.00 |
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.