Modules
Framework for algorithms that solve the MasterMind game
Solver using a Canonical GA
Tries to compute new solution from last
Class for handling the set of consistent combinations
Solver using an Estimation of Distribution Algorithm
Solver using an EDA plus partitions
New evolutionary algorithms solving MM - Evo* version
Evolutionary algorithm with the partition method and ranked fitness, prepared for GECCO 2010
Tries to compute new solution from last
Base class for evolutionary-based algorithms
Tries to compute new solution from last
Evolutionary algorithm with the partition method
Solver using an Estimation of Distribution Algorithm
Base class for exhaustive partion-based methods
Uses "most partitions" criterium to play
Plays combination with the highest number of partitions
Plays by Knuth's playbook
Plays random consistent combinations
Minimal framework for MM secrets
Tests each combination in turn.
Tests each combination in turn, alternating with the beginning and end of the sequence.
Mock class used for testing algorithms by hand
Utility functions for testing solvers