1. J. D. Allen, D. N. L. Levy, and D. F. Beal, 1989 . A note on the computer solution of connect-four . Heuristic programming in artificial intelligence 1: the First Computer Olympiad. Ellis Horwood, London, pp.134 -135 .
2. L. V. Allis, 1988 . A knowledge-based approach to connect-four. The game is solved: white wins . M.Sc. thesis , Faculty of Mathematics and Computer Science, Vrije Universiteit, Amsterdam.
3. L. V. Allis, H. J. Herik, I. S. Herschberg, D. N. L. Levy, and D. F. Beal . 1990 . Which games will survive . Heuristic Programming in Artificial Intelligence 2: the Second Computer Olympiad. Edited byEllis Horwood, London, pp.232 -243 .
4. L. V. Allis, H. J. Herik, and M. P. H. Huntjens. 1993 . Go-Moku solved by new search techniques. InProceedings of the 1993 AAAI Fall Symposium on Games: Planning and Learning.
5. G. Balz, 1994 . Verification of state databases . Diploma thesis , ETH Zurich, Switzerland.