Granada & Málaga (Spain) http://geneura.wordpress.com http://twitter.com/geneura Finding an evolutionary solution to the game of Mastermind with good scaling behavior Image from Just a Prairie Boy at http://www.flickr.com/photos/justaprairieboy/4565153930/in
play mastermind? It's not easy to do, since possible branches are many more than for Sudoku or even chess. In fact, this is the kind of game that can be played more easily by a machine than by a person. CC picture from http://www.flickr.com/photos/unloveable/239993254 9/
the same There's at least one better than the others (the solution). Some will reduce the remaining search space more. But scoring them is an open issue. Like the birds. They look the same, but one of them has a bad hair day. Or rather a bad feather day. Let's just say that what we do is, once a solution is consistent, we find a scoring based on how the set of consistent solutions is partitioned by comparing consistent solutions with each other. In other papers we tested different ways of doing it, and we're fixing it here. Ideally, anyways, the solution should have always the maximum fitness, but I'm not sure it does (it will have to be checked)
before before Minimize Minimize consistent set consistent set size to speed up size to speed up solutions solutions Creative commons image from Okinawa Soba at http://www.flickr.com/photos/24443965@N08/3606831198/ This was published in NICSO, Evostar, CIG, GECCO (as a póster) and eventually PPSN
smaller (and unique) consistent-set size over a range of problem sizes CC Picture from San Diego Shooter http://www.flickr.com/photos/nathaninsandiego/375898830 New is always better. And better is also always better. Mostly.
up to 70%! #Evaluations decreased up to 70%! (Game performance more or less the same for (Game performance more or less the same for smaller sizes) smaller sizes) Image from John Traynor at http://www.flickr.com/photos/trainor/3028243647/in/photost
data sets, experiment results for this paper are available from Sourceforge (in fact, they were while we were doing it). Source is also available from the CPAN Perl module server worldwide, in two separate modules: the algorithm itself as the module Algorithm::Mastermind (along with other algorithms; for instance, Knuth's algorithm), and the EA in the shape of the Evolutionary Algorithm library.