Solving 8 X 8 Domineering

Theoretical Computer Science

Volumn 230, Issue 1-2, 2000, Pages 195-206

  Breuker, D M ^a   Uiterwijk, J W H M ^a   Van Den Herik, H J ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Domineering; Replacement schemes; Solving games; Transposition tables

Indexed keywords

EID: 0001088106     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00082-1     Document Type: Article

References (32)

1. J. Allen, A note on the computer solution of Connect-Four, in: D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence: the First Computer Olympiad, Ellis Horwood, Chichester, 1989, pp. 134-135.
2. L.V. Allis, 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, 1988.
3. L.V. Allis, P.N.A. Schoo, Qubic solved again, in: H.J. van den Herik, L.V. Allis (Eds.), Heuristic Programming in Artificial Intelligence 3: the Third Computer Olympiad. Ellis Horwood, Chichester, 1992, pp. 192-204.
4. L.V. Allis, H.J. van den Herik, M.P.H. Huntjens, Go-Moku solved by new search techniques, Comput. Intell. 12 (1) (1996) 7-24.
5. E.R. Berlekamp, Blockbusting and Domineering, J. Combin. Theory, Series A 49 (1988) 67-116.
6. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for your Mathematical Plays, vol. 1, Games in General, Academic Press, London, 1982.
7. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for your Mathematical Plays, vol. 2, Games in Particular, Academic Press, London, 1982.
8. D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den Herik, Replacement schemes for transposition tables, ICCA J. 17 (4) (1994) 183-193.
9. D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den Herik, Replacement schemes and two-level tables, ICCA J. 19 (3) (1996) 175-180.
10. J.H. Conway, On Numbers and Games, Academic Press, London, 1986.
11. C. Ebeling, All the right moves: a VLSI architecture for chess, Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, 1986.
12. D. Fotland, personal communication, 1997.
13. M. Gardner, Mathematical games, Sci. Amer. 230 (2) (1974) 106-108.
14. R.U. Gasser, Harnessing computational resources for efficient exhaustive search, Ph.D. Thesis, Swiss Federal Institute of Technology, Zürich, 1995.
15. R.D. Greenblatt, D.E. Eastlake, S.D. Crocker, The Greenblatt chess program, Proc. AFIPS Fall Joint Computer Conf, vol. 31, 1967, pp. 801-810.
16. R.K. Guy (Ed.), Combinatorial Games, American Mathematical Society, Providence, RI, 1991.
17. R.K. Guy, Unsolved problems in combinatorial games, in: R.J. Nowakowski (Ed.), Games of No Chance, MSRI Publications, vol. 29, Cambridge University Press, Cambridge, 1996, pp. 475-491.
18. R.M. Hyatt, A.E. Gower, H.L. Nelson, Cray Blitz, in: T.A. Marsland, J. Schaeffer (Eds.), Computers, Chess, and Cognition, Springer, New York, 1990, pp. 111-132.
19. Y. Kim, New values in Domineering, Theoret. Comput. Sci. 156 (1996) 263-280.
20. D.E. Knuth, R.W. Moore, An analysis of alpha-beta pruning, Artif. Intell. 6 (4) (1975) 293-326.
21. T.A. Marsland, A review of game-tree pruning, ICCA J. 9 (1) (1986) 3-19.
22. K. Morita, personal communication, 1998.
23. H.L. Nelson, Hash tables in Cray Blitz, ICCA J. 8 (1) (1985) 3-13.
24. O. Patashnik, Qubic: 4 X 4 X 4 Tic-Tac-Toe, Math. Mag. 53 (1980) 202-216.
25. J. Schaeffer, The history heuristic and alpha-beta search enhancements in practice, IEEE Trans. Pattern Anal. Machine Intell. 11 (11) (1989) 1203-1212.
26. J. Schaeffer, personal communication, 1994.
27. J.S. Slate, L.R. Atkin, CHESS 4.5: The Northwestern University chess program, in: P.W. Frey (Ed.), Chess Skill in Man and Machine, Springer, New York, 1977, pp. 82-118.
28. J.W.H.M. Uiterwijk, H.J. van den Herik, L.V. Allis, A knowledge-based approach to Connect-Four. The game is over: white to move wins!, in: D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence: the First Computer Olympiad, Ellis Horwood, Chichester, 1989, pp. 113-133.
29. J. West, Championship-level play of Domineering, in: R.J. Nowakowski (Ed.), Games of No Chance, MSRI Publications, vol. 29, Cambridge University Press, Cambridge, 1996, pp. 85-91.
30. D. Wolfe, Snakes in Domineering games, Theoret. Comput. Sci. 119 (1993) 323-329.
31. A.L. Zobrist, A new hashing method with application for game playing, Tech. Report #88 (Computer Science Department, University of Wisconsin, Madison, 1970); reprinted in ICCA J. 13 (2) (1990) 69-73.
32. A.L. Zobrist, A new hashing method with application for game playing, Tech. Report #88 (Computer Science Department, University of Wisconsin, Madison, 1970); reprinted in ICCA J. 13 (2) (1990) 69-73.