The number of pessimistic guesses in Generalized Mastermind
References (12)
Isomorph-free exhaustive generation
J. Algorithms
(1998)- et al.
Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary Mastermind
Appl. S. Comput.
(2006) - et al.
Mastermind by evolutionary algorithms
- et al.
Optimal algorithms for Mastermind games – a graph partition approach
Comput. J.
(2004) - et al.
A two-phase optimization algorithm for Mastermind
Comput. J.
(2007) Static Mastermind
J. Combin. Math. Combin. Comput.
(2003)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2009 Elsevier B.V. All rights reserved.