Finding an evolutionary solution to the game of Mastermind with good scaling behavior

As important as finding a solution to the game of MasterMind that is better than anyone else is to find one that can be applied to a wide range of sizes. In this paper we get rid of a parameter, the limit size of the consistent set we use for scoring every combination. This makes a faster algorithm, and not always worse than the optimal consistent set size.

This was the paper presented at LION by Antonio Fernández using this presentation

One thought on “Finding an evolutionary solution to the game of Mastermind with good scaling behavior

  1. Pingback: Is entropy good for solving the game of MasterMind? | GeNeura Team

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s