Search results for "module:Algorithm::MasterMind::Partition::Most"
Algorithm::MasterMind::Partition::Most - Uses "most partitions" criterium to play
Solves the algorithm by issuing each time a combination with a particular score; the computation of that score is delegated to subclasses....
JMERELO/Algorithm-MasterMind-v0.4.5 - 19 Jul 2012 18:06:25 UTC
Algorithm::MasterMind::Partition_Most - Plays combination with the highest number of partitions
Solves the algorithm by issuing each time a combination that maximizes the number of non-null partitions. This intends to maximally reduce the search space each time; I wouldn't advice using it for sizes over 4-6. In fact, it will probably take a lot...
JMERELO/Algorithm-MasterMind-v0.4.5 - 19 Jul 2012 18:06:25 UTC
Algorithm::MasterMind::EvoRank - Evolutionary algorithm with the partition method and ranked fitness, prepared for GECCO 2010
The partition method was introduced in a 2010 paper, and then changed by Runarsson and Merelo to incorporate it in the genetic search. It was prepared for a conference paper, this one: @INPROCEEDINGS{mm:cig, author={Merelo, J.J. and Mora, A.M. and Ru...
JMERELO/Algorithm-MasterMind-v0.4.5 - 19 Jul 2012 18:06:25 UTC
Algorithm::MasterMind::Consistent_Set - Class for handling the set of consistent combinations
The consistent set in Mastermind contains the set of strings that could possibly be a solution, that is, those that meet all partitions made so far....
JMERELO/Algorithm-MasterMind-v0.4.5 - 19 Jul 2012 18:06:25 UTC