Bibliography

1

Donald E. Knuth.
The computer as Master Mind.
J. Recreational Mathematics, (9):1-6, 1976-77.

2

José Mira and Francisco Sandoval, editors.
From Natural to Artificial Neural Computation, number 930 in LNCS. Springer Verlag, June 1995.

3

Charles Garrett Eric B. Baum, Dan Bomeh.
On genetic algorithms.
In Procs. COLT'95. ACM Inc., 1995.
Expanded version: "Where Genetic Algorithms Excel".

4

M. Mitchell, S. Forrest, and J. H. Holland.
The royal road for genetic algorithms: fitness landscapes and GA performance.
In F. J. Varela and P. Bourgine, editors, Proceedings of the First European Conference on Artificial Life. Toward a Practice of Autonomous Systems, pages 245-254, Paris, France, 11-13 December 1991. MIT Press, Cambridge, MA.

5

Zhixiang Chen and Carlos Cunha amd Steven Homer.
Finding a hidden code by asking questions.
In COCOON'96, Computing and Combinatorics, pages 50-55, 1996.

6

sci.math FAQ maintainer.
Master mind.
Available as sci-math-faq/mastermind from the FAQ archives, such as http://www.faqs.org/faqs.

7

J. J. Merelo.
Genetic Mastermind, a case of dynamic constraint optimization.
GeNeura Technical Report G-96-1, Universidad de Granada, 1996.

8

Steve Pope.
Re: Basic mastermind decryption.
Posting in the sci.math and sci.crypt newsgroups, available from http://www.math.niu.edu/~rusin/uses-math/games/mastermind/usenet.posts and from http://www.deja.com.

9

Kenji Koyama; T. W. Lai.
An optimal Mastermind strategy.
J. Recreational Mathematics, 1994.

10

Wolfgang Strobl.
How to build a calculator for master minds.
Web page, at http://ntklotz.gmd.de/pic/mm47.

11

R. W. Irving.
Towards an optimum mastermind strategy.
Journal of Recreational Mathematics, 11(2):81-87, 1978-79.

12

E. Neuwirth.
Some strategies for mastermind.
Zeitschrift fur Operations Research. Serie B, 26(8):B257-B278, 1982.

13

V. Chvatal.
Mastermind.
Combinatorica, 3(3-4):325-329, 1983.

14

Azer Bestavros and Ahmed Belal.
Mastermind, a game of diagnosis strategies.
Bulletin of the Faculty of Engineering, Alexandria University, December 1986.

15

M. M. Flood.
Mastermind strategy.
Journal of Recreational Mathematics, 18(3):194-202, 1985-86.

16

K.-I. Lo and S.-C. Teng.
On the number of queries necessary to identify a permutation.
Journal of Algorithms, (7):449-462, 1986.

17

J. L. Bernier, C. Ilia Herráiz, J. J. Merelo, S. Olmeda, and A. Prieto.
Solving mastermind using GAs and simulated annealing: a case of dynamic constraint optimization.
In Proceedings PPSN, Parallel Problem Solving from Nature IV, number 1141 in Lecture Notes in Computer Science, pages 554-563. Springer-Verlag, 1996.

18

Luis Bento, Luisa Pereira, and Agostinho Rosa.
Mastermind by evolutionary algorithms.
In Procs SAC 99, 1999.

19

J. J. Merelo, J. Carpio, P. Castillo, V. M. Rivas, and G. Romero.
Evolving objects.
In GECCO-99 late breaking papers, available also from http://geneura.ugr.es/~jmerelo/EOpaper, 1999.

20

Radu T. Rosu.
Mastermind.
Master's thesis, NCSU, Found at http://www.csc.ncsu.edu/degrees/undergrad/Reports/rtrosu/heuristic.htm, 1999.