Cart (Loading....) | Create Account
Close category search window
 

Assessing efficiency of different evolutionary strategies playing MasterMind

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Merelo, J.J. ; Dept. of Archit. & Comput. Technol., Univ. of Granada, Granada, Spain ; Mora, A.M. ; Runarsson, T.P. ; Cotta, C.

A MasterMind player must find out a secret combination (set by another player) by playing others of the same kind and using the hints obtained as a response (which reveal how close the played combination is to the secret one) to produce new combinations. Despite having been researched for a number of years, there are still many open issues: finding a strategy to select the next combination to play that is able to consistently obtain good results at any problem size, and also doing so in as little time as possible. In this paper we cast the solution of MasterMind as a constrained optimization problem, introducing a new fitness function for evolutionary algorithms that takes that fact into account, and compare it to other approaches (exhaustive/heuristic and evolutionary), finding that it is able to obtain consistently good solutions, and in as little as 30% less time than previous evolutionary algorithms.

Published in:

Computational Intelligence and Games (CIG), 2010 IEEE Symposium on

Date of Conference:

18-21 Aug. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.