Efficient solutions for Mastermind using genetic algorithms
Computers and Operations Research
Optimal analyses for 3×n AB games in the worst case
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
| Hi-index | 0.00 |
There have been several recent articles in the SIGART Newsletter about the game of Mastermind (T. M. Rao, #82, E. Shapiro, #85, P. Koppstein, #88). This note describes an algorithm that is different from the others in that it is specifically designed to be an approximation to the optimal strategy.