|
|
Invited Speaker
MasterMind or finding a needle in a haystack algorithmically
Juan Julián Merelos Guervos
Granada University
Granada, Spain
Abstract
MasterMind is a game that, despite its simplicity, poses a challenge to algorithmic solvers. It's NP-hard and, in fact, even finding bounds to the number of turns needed to find the solution is a hard challenge. In this talk we will explain how, from the first approach by none other than Donald Knuth, MasterMind has been approached using several type of exhaustive search, heuristic, and metaheuristic methods.
