If you can't read please download the document
Upload
juan-j-merelo
View
1.394
Download
0
Embed Size (px)
Citation preview
Comparing evolutionary algorithms to solve the game of
MasterMind
J. J. Merelo, A. M. Mora, P. A. Castillo, C. Cotta, M. Valdez
UGR, UMA, ITT
Combination playedConsistent! Not consistent! Always play consistent!
Optimization algorithm based on distance to consistency (for all combinations played)
D = 2
Not all consistent combinations are the same: use partitions
Most parts. Score = 5
Best worst case. Score = -3
1.31
0.96
0.96
1.58
1.52
1.67
1.42
1.52
1.67
Entropy. Score = 1.67
We use entropy for scoring.
Check the size of the consistent set needed for good and fast
solutions.
0b-0w0b-1w0b-2w0b-3w1b-0w1b-1w1b-2w2b-0w
AAA20303
BBB4040
CCC4040
ABC0141
CBA01203020
AAB1020103
AAC1020104
AAD20103
BCA01213010
???Pgina ??? (???)26/06/2010, 19:38:49Pgina /