Bibliography

1

Adelson-Velsky, G.M. and Arlazarov, V.L. and Donskoy, M.V. (1979). Algorithms of adaptive search. Machine Intelligence 9, J.E. Hayes and D. Michie and L.I. Mikulich (eds.), pp. 373-384, Ellis Horwood, ISBN 0-470-26714-3/0-853-12112-5.

2

Adelson-Velsky, G.M. and Arlazarov, V.L. and Bitman, A.R. and Zhivotovsky, A.A. and Uskov, A.V. (1969). Programming a computer to play chess. 1st Summer School on Mathematical Programming, Proceedings Vol. II, pp. 216-252 [another translation of the Russian original appeared in Russian Mathematical Surveys, Vol. 25, pp. 221-262, London Mathematical Society, 1970].

3

Akl, S.G. and Newborn, M.M. (1977). The principal continuation and the killer heuristic. ACM '77 National Conference, Proceedings, pp. 466-473, ACM Press.

4

Althöfer, I. (1991). Data compression using an intelligent generator: The storage of chess games as an example. Artificial Intelligence, Vol. 52, No. 1, pp. 109-114.

5

Althöfer, I. (1990). Compressing chess games with the help of a fast deterministic chess program. ICCA Journal, Vol. 13, No. 4, pp. 200-203.

6

Anantharaman, T.S. (1997). Evaluation tuning for computer chess: Linear discriminant methods. ICCA Journal, Vol. 20, No. 4, pp. 224-242.

7

Anantharaman, T.S. (1991). Extension heuristics. ICCA Journal, Vol. 14, No. 2, pp. 47-65.

8

Anantharaman, T.S. and Campbell, M.S. and Hsu, F.-H. (1988). Singular extensions: Adding selectivity to brute-force searching. ICCA Journal, Vol. 11, No. 4, pp. 135-143.

9

Arlazarov, V.L. and Futer, A.L. (1979). Computer analysis of a Rook end-game. Machine Intelligence 9, J.E. Hayes and D. Michie and L.I. Mikulich (eds.), pp. 361-371, Ellis Horwood, ISBN 0-470-26714-3/0-853-12112-5 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 330-336, Springer, 1989, ISBN 0-387-91331-9].

10

Bain, M. and Srinivasan, A. (1995). Inductive logic programming with large-scale unstructured data. Machine Intelligence 14, K. Furukawa and D. Michie and S. Muggleton (eds.), pp. 233-267, Oxford University Press, ISBN 0-198-53860-X.

11

Bain, M. (1994). Learning Logical Exceptions in Chess. Ph.D. Thesis, University of Strathclyde [printed as Thesis No. 7866, Department of Statistics and Modelling Science, University of Strathclyde].

12

Bain, M. and Muggleton, S. (1994). Learning optimal chess strategies. Machine Intelligence 13, K. Furukawa and D. Michie and S. Muggleton (eds.), pp. 291-309, Oxford University Press, ISBN 0-198-53850-2.

13

Barth, W. (1995). Combining knowledge and search to yield infallible endgame programs. ICCA Journal, Vol. 18, No. 3, pp. 149-159.

14

Barth, W. and Barth, S. (1992). Validating a range of endgame programs. ICCA Journal, Vol. 15, No. 3, pp. 132-139.

15

Baxter, J. and Tridgell, A. and Weaver, L. (1998). Experiments in parameter learning using temporal differences. ICCA Journal, Vol. 21, No. 2, pp. 84-99.

16

Beal, D.F. and Smith, M.C. (1996). Multiple probes of transposition tables. ICCA Journal, Vol. 19, No. 4, pp. 227-233.

17

Beal, D.F. and Smith, M.C. (1995). Quantification of search extension benefits. ICCA Journal, Vol. 18, No. 4, pp. 205-218.

18

Beal, D.F. (editor). (1991). Advances in Computer Chess 6. Ellis Horwood, ISBN 0-130-06537-4.

19

Beal, D.F. (editor). (1989). Advances in Computer Chess 5. Elsevier Science, ISBN 0-444-87159-4.

20

Beal, D.F. (1989). Experiments with the null move. Advances in Computer Chess 5, D.F. Beal (ed.), pp. 65-79, Elsevier Science, ISBN 0-444-87159-4.

21

Beal, D.F. (editor). (1986). Advances in Computer Chess 4. Pergamon, ISBN 0-080-29763-3.

22

Beal, D.F. (1986). Selective search without tears. ICCA Journal, Vol. 9, No. 2, pp. 76-80.

23

Beal, D.F. (1984). Mixing heuristic and perfect evaluations: Nested minimax. ICCA Journal, Vol. 7, No. 1, pp. 10-15.

24

Beal, D.F. and Clarke, M.R.B. (1980). The construction of economical and correct algorithms for King and Pawn against King. Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 1-30, Edinburgh University Press, ISBN 0-852-24377-4.

25

Beal, D.F. (1977). Discriminating Wins from Draws in King+Pawn versus King Chess Endgames. Unpublished Report, Queen Mary College.

26

Berliner, H.J. and McConnell, C. (1996). B* probability based search. Artificial Intelligence, Vol. 86, No. 1, pp. 97-156.

27

Berliner, H.J. and Ebeling, C. (1990). HITECH. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 79-109, Springer, ISBN 0-387-97415-6/3-540-97415-6.

28

Berliner, H.J. and Goetsch, G. and Campbell, M.S. and Ebeling, C. (1990). Measuring the performance potential of chess programs. Artificial Intelligence, Vol. 43, No. 1, pp. 7-21.

29

Berliner, H.J. (1987). Some innovations introduced by HITECH. ICCA Journal, Vol. 10, No. 3, pp. 111-117.

30

Berliner, H.J. and Campbell, M. (1984). Using chunking to solve chess Pawn endgames. Artificial Intelligence, Vol. 23, No. 1, pp. 97-120.

31

Berliner, H.J. (1979). The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence, Vol. 12, No. 1, pp. 23-40.

32

Bettadapur, P. (1986). Influence of ordering on capture search. ICCA Journal, Vol. 9, No. 4, pp. 180-188.

33

Birmingham, J.A. and Kent, P. (1980). Mate at a glance. Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 122-130, Edinburgh University Press, ISBN 0-852-24377-4 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 258-265, Springer, 1989, ISBN 0-387-91331-9].

34

Birmingham, J.A. and Kent, P. (1977). Tree-searching and tree-pruning techniques. Advances in Computer Chess 1, M.R.B. Clarke (ed.), pp. 89-107, Edinburgh University Press, ISBN 0-852-24292-1 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 123-128, Springer, 1989, ISBN 0-387-91331-9].

35

Björnsson, Y. and Marsland, T.A. (1998). Risk management in game-tree pruning. Technical Report TR 98-07, Department of Computing Science, University of Alberta.

36

Björnsson, Y. and Marsland, T.A. and Schaeffer, J. and Junghanns, A. (1998). Searching with uncertainty cut-offs. Advances in Computer Chess 8, H.J. van den Herik and J.W.H.M. Uiterwijk (eds.), pp. 167-179, University of Maastricht, ISBN 9-062-16234-7 [reprinted in ICCA Journal, Vol. 20, No. 1, pp. 29-37].

37

Bramer, M.A. (editor). (1983). Computer Game-Playing: Theory and Practice. Ellis Horwood, ISBN 0-470-27466-2/0-853-12488-4.

38

Bramer, M.A. (1982). Refinement of correct strategies for the endgame in chess. SIGART Newsletter, Vol. 80, pp. 155-163 [reprinted in Computer Game-Playing: Theory and Practice, M.A. Bramer (ed.), pp. 106-124, 1983, Ellis Horwood, ISBN 0-470-27466-2/0-853-12488-4].

39

Bramer, M.A. (1980). Correct and optimal strategies in game-playing programs. Computer Journal, Vol. 24, No. 4, pp. 347-352.

40

Bramer, M.A. (1980). An optimal algorithm for King and Pawn against King using pattern knowledge. Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 82-91, Edinburgh University Press, ISBN 0-852-24377-4.

41

Bramer, M.A. and Clarke, M.R.B. (1979). A model for the representation of pattern-knowledge for the endgame in chess. International Journal of Man-Machine Studies, Vol. 11, No. 5, pp. 635-649.

42

Bratko, I. (1982). Knowledge-based problem solving in AL3. Machine Intelligence 10, J.E. Hayes and D. Michie and Y.-H. Pao (eds.), pp. 73-100, Ellis Horwood, ISBN 0-470-27323-2/0-853-12431-0.

43

Bratko, I. and Michie, D. (1980). A representation of pattern knowledge in chess endgames. Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 31-56, Edinburgh University Press, ISBN 0-852-24377-4.

44

Bratko, I. and Niblett, T. (1979). Conjectures and refutations in a framework for chess endgame knowledge. Expert systems in the micro-electronic age, D. Michie (ed.), pp. 83-102, Edinburg University Press, ISBN 0-852-24381-2.

45

Bratko, I. and Kopec, D. and Michie, D. (1978). Pattern-based representation of chess end-game knowledge. Computer Journal, Vol. 21, No. 2, pp. 149-153.

46

Brockington, M.G. (1997). KEYANO unplugged - The construction of an Othello program. Technical Report TR 97-05, Department of Computing Science, University of Alberta.

47

Brockington, M.G. (1996). A taxonomy of parallel game-tree search algorithms. ICCA Journal, Vol. 19, No. 3, pp. 162-174.

48

Brudno, A.L. (1963). Bounds and valuations for abridging the search of estimates. Problems of Cybernetics, Vol. 10, pp. 225-241.

49

Buro, M. (1997). Experiments with MULTI-PROBCUT and a new high-quality evaluation function for Othello. Technical Report No. 96, NEC Research Institute, 1997.

50

Buro, M. (1995). PROBCUT: An effective selective extension of the alpha-beta algorithm. ICCA Journal, Vol. 18, No. 2, pp. 71-76.

51

Campbell, M.S. and Marsland, T.A. (1983). A comparison of minimax tree search algorithms. Artificial Intelligence, Vol. 20, No. 4, pp. 347-367.

52

Clarke, M.R.B. (editor). (1982). Advances in Computer Chess 3. Pergamon, ISBN 0-080-26898-6.

53

Clarke, M.R.B. (editor). (1980). Advances in Computer Chess 2. Edinburgh University Press, ISBN 0-852-24377-4.

54

Clarke, M.R.B. (editor). (1977). Advances in Computer Chess 1. Edinburgh University Press, ISBN 0-852-24292-1.

55

Clarke, M.R.B. (1977). A quantitative study of King and Pawn against King. Advances in Computer Chess 1, M.R.B. Clarke (ed.), pp. 30-59, Edinburgh University Press, ISBN 0-852-24292-1.

56

Coles, L.S. (1994). Computer chess: The drosophila of AI. AI Expert, Vol. 9, No. 4, pp. 25-31.

57

Condon, J.H. and Thompson, K. (1983). BELLE. Chess Skill in Man and Machine, P.W. Frey (ed.), pp. 82-118, Springer, 2nd ed. 1983, ISBN 0-387-90790-4/3-540-90790-4.

58

Condon, J.H. and Thompson, K. (1983). BELLE chess hardware. Advances in Computer Chess 3, M.R.B. Clarke (ed.), pp. 45-54, Pergamon, ISBN 0-080-26898-6 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 286-292, Springer, 1989, ISBN 0-387-91331-9].

59

Coplan, K.P. (1998). Synthesis of chess and chess-like endgames by recursive optimization. ICCA Journal, Vol. 21, No. 3, pp. 169-182.

60

Cracraft, S.M. (1984). Bitmap move generation in chess. ICCA Journal, Vol. 7, No. 3, pp. 146-153.

61

Dale, E. and Michie, D. (editors). (1971). Machine Intelligence 2. Edinburgh University Press (reprint), ISBN 0-852-24205-0.

62

Donninger, C. (1993). Null move and deep search: Selective search heuristics for obtuse chess programs. ICCA Journal, Vol. 16, No. 3, pp. 137-143.

63

Ebeling, C. (1986). All the Right Moves: A VLSI Architecture for Chess. MIT Press, ISBN 0-262-05035-8.

64

Edwards, S.J. (1995). Comments on Barth's article ``Combining knowledge and search to yield infallible endgame programs''. ICCA Journal, Vol. 18, No. 4, pp. 219-225.

65

Edwards, S.J. (1994). Tablebase documentation. Electronic document from URL <ftp://chess.onenet.net/pub/chess/TB/README-TB/>.

66

Elcock, E.W. and Michie, D. (editors). (1977). Machine Intelligence 8. Ellis Horwood, ISBN 0-470-99059-7/0-853-12058-7.

67

Forthoffer, D. and Rasmussen, L. and Dekker, S. (1989). A correction to some KRKB-database results. ICCA Journal, Vol. 12, No. 1, pp. 25-27.

68

Frey, P.W. and Atkin, L.R. (1988). Creating a chess player. Computer Games I, D.N.L. Levy (ed.), pp. 226-324, Springer, ISBN 0-387-96496-4/3-540-96496-4.

69

Frey, P.W. (editor). (1983). Chess Skill in Man and Machine. Springer, 2nd ed., ISBN 0-387-90790-4/3-540-90790-4.

70

Furukawa, K. and Michie, D. and Muggleton, S. (editors). (1995). Machine Intelligence 14. Oxford University Press, ISBN 0-198-53860-X.

71

Furukawa, K. and Michie, D. and Muggleton, S. (editors). (1994). Machine Intelligence 13. Oxford University Press, ISBN 0-198-53850-2.

72

Gasser, R.U. (1995). Harnessing Computational Resources for Efficient Exhaustive Search. Dissertation (Ph.D. Thesis), Swiss Federal Institute of Technology Zürich [printed as ETH Dissertation No. 10927, Swiss Federal Institute of Technology Zürich].

73

Gasser, R.U. (1992). Endgame database compression for humans and machines. Heuristic Programming in Artificial Intelligence 3, H.J. van den Herik and L.V. Allis (eds.), pp. 180-191, Ellis Horwood, ISBN 0-133-88265-9.

74

Gasser, R.U. (1991). Applying retrograde analysis to Nine Men's Morris. Heuristic Programming in Artificial Intelligence 3, D.N.L. Levy and D.F. Beal (eds.), pp. 161-173, Ellis Horwood, ISBN 0-133-82615-5.

75

Gillogly. J.J. (1978). Performance Analysis of the Technology Chess Program. Ph.D. Thesis, Carnegie-Mellon University [printed as Technical Report CMU-CS-78-189, Computer Science Department, Carnegie-Mellon University].

76

Gillogly, J.J. (1972). The technology chess program. Artificial Intelligence, Vol. 3, No. 1-3, pp. 145-163 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 67-79, Springer, 1989, ISBN 0-387-91331-9].

77

Goetsch, G. and Campbell, M.S. (1990). Experiments with the null-move heuristic. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 159-168, Springer, ISBN 0-387-97415-6/3-540-97415-6.

78

Good, I.J. (1977). Dynamic probability, computer chess, and the measurement of knowledge. Machine Intelligence 8, E.W. Elcock and D. Michie (eds.), pp. 139-150, Ellis Horwood, ISBN 0-470-99059-7/0-853-12058-7.

79

Good, I.J. (1968). A five-year plan for automatic chess. Machine Intelligence 2, E. Dale and D. Michie (eds.), pp. 89-118, Edinburgh University Press, 1971, ISBN 0-852-24205-0 [excerpts reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 118-121, Springer, 1989, ISBN 0-387-91331-9].

80

de Groot, A.D. and Gobet, F. (1996). Perception and Memory in Chess. Van Gorcum, ISBN 90-232-2949-5.

81

de Groot, D. (1965). Thought and Choice in Chess. Mouton, The Hague.

82

Hamlen, T. and Feist, M. (1997). Report on the 15th World Microcomputer Chess Championship. ICCA Journal, Vol. 20, No. 4, pp. 254-256.

83

Hammilton, S. and Garber, L. (1997). DEEP BLUE's hardware-software synergy. IEEE Computer, Vol. 30, No. 10, pp. 29-35.

84

Hayes, J.E. and Michie, D. and Tyugu, E. (editors). (1991). Machine Intelligence 12. Oxford University Press, ISBN 0-198-53823-5.

85

Hayes, J.E. and Michie, D. and Richards, J. (editors). (1988). Machine Intelligence 11. Oxford University Press, ISBN 0-198-53718-2.

86

Hayes, J.E. and Michie, D. and Pao, Y.-H. (editors). (1982). Machine Intelligence 10. Ellis Horwood, ISBN 0-470-27323-2/0-853-12431-0.

87

Hayes, J.E. and Michie, D. and Mikulich, L.I. (editors). (1979). Machine Intelligence 9. Ellis Horwood, ISBN 0-470-26714-3/0-853-12112-5.

88

Heinhold, J. and Gaede, K.-W. (1964). Ingenieur-Statistik. Oldenbourg, 3rd ed. 1972, ISBN 3-486-31743-1.

89

Heinz, E.A. (1999). Scalable Search in Computer Chess. Vieweg, ISBN 3-528-05732-7.

90

Heinz, E.A. (1999). Adaptive null-move pruning. ICCA Journal, Vol. 22, No. 3, pp. 123-132.

91

Heinz, E.A. (1999). Knowledgeable encoding and querying of endgame databases. ICCA Journal, Vol. 22, No. 2, pp. 81-97.

92

Heinz, E.A. (1999). Endgame databases and efficient index schemes. ICCA Journal, Vol. 22, No. 1, pp. 22-32.

93

Heinz, E.A. (1998). DARKTHOUGHT goes deep. ICCA Journal, Vol. 21, No. 4, pp. 228-244.

94

Heinz, E.A. (1998). Efficient interior-node recognition. ICCA Journal, Vol. 21, No. 3, pp. 156-167.

95

Heinz, E.A. (1998). Extended futility pruning. ICCA Journal, Vol. 21, No. 2, pp. 75-83.

96

Heinz, E.A. (1997). How DARKTHOUGHT plays chess. ICCA Journal, Vol. 20, No. 3, pp. 166-176.

97

van den Herik, H.J. (1997). Surpassing the speed limit of 1,000,000 nodes per second (photograph of DARKTHOUGHT versus TOLEDO 2000). ICCA Journal, Vol. 20, No. 4, p. 273.

98

van den Herik, H.J. and Uiterwijk, J.W.H.M. (editors). (1997). Advances in Computer Chess 8. University of Maastricht, ISBN 9-062-16234-7.

99

van den Herik, H.J. and Herschberg, I.S. and Uiterwijk, J.W.H.M. (editors). (1994). Advances in Computer Chess 7. University of Maastricht, ISBN 9-062-16101-4.

100

van den Herik, H.J. and Allis, L.V. (editors). (1992). Heuristic Programming in Artificial Intelligence 3. Ellis Horwood, ISBN 0-133-88265-9.

101

van den Herik, H.J. and Herschberg, I.S. and Nakad, N. (1987). A six-men-endgame database: KRP(a2)KbBP(a3). ICCA Journal, Vol. 10, No. 4, pp. 163-180.

102

van den Herik, H.J. and Herschberg, I.S. (1986). A data base on data bases. ICCA Journal, Vol. 9, No. 1, pp. 29-34.

103

van den Herik, H.J. and Herschberg, I.S. (1985). The construction of an omniscient endgame data base. ICCA Journal, Vol. 8, No. 2, pp. 66-87.

104

van den Herik, H.J. (1983). Representation of experts' knowledge in a subdomain of chess intelligence. 8th International Joint Conference on Artificial Intelligence, Proceedings Vol. I, A. Bundy (ed.), pp. 252-255, Kaufmann, ISBN 0-865-76064-0.

105

van den Herik, H.J. (1982). Strategy in chess endgames. SIGART Newsletter, Vol. 80, pp. 145-154 [reprinted in Computer Game-Playing: Theory and Practice, M.A. Bramer (ed.), pp. 87-105, 1983, Ellis Horwood, ISBN 0-470-27466-2/0-853-12488-4].

106

van den Herik, H.J. (1980). Goal-directed search in chess endgames. Delft Progress Report, Vol. 5, No. 4, pp. 253-279, Delft University of Technology [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 316-329, Springer, 1989, ISBN 0-387-91331-9].

107

Herschberg, I.S. and van den Herik, H.J. and Schoo, P.N.A. (1989). Verifying and codifying strategies in the KNNKP(h) endgame. ICCA Journal, Vol. 12, No. 3, pp. 144-154 [reprinted in Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 183-196, Springer, 1990, ISBN 0-387-97415-6/3-540-97415-6].

108

Horacek, H. (1983). Knowledge-based move selection and evaluation to guide the search in chess Pawn endings. ICCA Journal, Vol. 6, No. 3, pp. 20-37.

109

Horacek, H. (1982). Construction of planned move tress for chess Pawn endings. SIGART Newsletter, Vol. 80, pp. 163-168 [reprinted in Computer Game-Playing: Theory and Practice, M.A. Bramer (ed.), 1983, Ellis Horwood, ISBN 0-470-27466-2/0-853-12488-4].

110

Hsu, F.-h. (1998). Designing a single-chip chess grandmaster while knowing nothing about chess. Hot Chips 10, Proceedings (slides of presentations), pp. 59-69.

111

Hsu, F.-h. and Anantharaman, T.S. and Campbell, M.S. and Nowatzyk, A. (1990). A grandmaster chess machine. Scientific American, Vol. 263, No. 4, pp. 44-50.

112

Hsu, F.-h. and Anantharaman, T.S. and Campbell, M.S. and Nowatzyk, A. (1990). DEEP THOUGHT. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 55-78, Springer, ISBN 0-387-97415-6/3-540-97415-6.

113

Hsu, F.-h. (1990). Large-scale parallelization of alpha-beta search: An algorithmic and architectural study with computer chess. Ph.D. Thesis, Carnegie-Mellon University [printed as Technical Report CMU-CS-90-108, Computer Science Department, Carnegie-Mellon University].

114

Hyatt, R.M. and Newborn, M.M. (1997). CRAFTY goes deep. ICCA Journal, Vol. 20, No. 2, pp. 79-86.

115

Hyatt, R.M. (1997). The dynamic tree-splitting parallel search algorithm. ICCA Journal, Vol. 20, No. 1, pp. 3-19.

116

Hyatt, R.M. and Gower, A.E. and Nelson, H.L. (1990). CRAY BLITZ. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 111-130, Springer, ISBN 0-387-97415-6/3-540-97415-6.

117

Hyatt, R.M. and Suter, B.W. and Nelson, H.L. (1989). A parallel alpha-beta tree searching algorithm. Parallel Computing, Vol. 10, No. 3, pp. 299-308.

118

Hyatt, R.M. (1984). Using time wisely. ICCA Journal, Vol. 7, No. 1, pp. 5-9.

119

Junghanns, A. (1998). Are there practical alternatives to alpha-beta? ICCA Journal, Vol. 21, No. 1, pp. 14-32.

120

Junghanns, A. and Schaeffer, J. (1997). Search versus knowledge in game-playing programs revisited. 15th International Joint Conference on Artificial Intelligence, Proceedings Vol. I, pp. 692-697, Morgan Kaufmann, ISBN 1-558-60480-4.

121

Junghanns, A. and Schaeffer, J. and Brockington, M. and Björnsson, Y. and Marsland, T.A. (1997). Diminishing returns for additional search in chess. Advances in Computer Chess 8, H.J. van den Herik and J.W.H.M. Uiterwijk (eds.), pp. 53-67, University of Maastricht, ISBN 9-062-16234-7.

122

Kaindl, H. (1990). Tree searching algorithms. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 133-158, Springer, ISBN 0-387-97415-6/3-540-97415-6.

123

Kaindl, H. (1982). Quiescence search in computer chess. SIGART Newsletter, Vol. 80, pp. 124-131 [reprinted in Computer Game-Playing: Theory and Practice, M.A. Bramer (ed.), 1983, Ellis Horwood, ISBN 0-470-27466-2/0-853-12488-4].

124

Knuth, D.E. and Moore, R.W. (1975). An analysis of alpha-beta pruning. Artificial Intelligence, Vol. 6, No. 4, pp. 293-326.

125

Kopec, D. and Bratko, I. (1983). The Bratko-Kopec experiment: A comparison of human and computer performance in chess. Advances in Computer Chess 3, M.R.B. Clarke (ed.), pp. 57-72, Pergamon, ISBN 0-080-26898-6.

126

Kopec, D. and Niblett, T.B. (1980). How hard is the play of the King-Rook-King-Knight ending? Advances in Computer Chess 2, M.R.B. Clarke (ed.), pp. 57-81, Edinburgh University Press, ISBN 0-852-24377-4.

127

Korf, R.E. (1985). Iterative deepening: An optimal admissible tree search. Artificial Intelligence, Vol. 27, No. 1, pp. 97-109.

128

Kuszmaul, B.C. (1995). The STARTECH massively parallel chess program. ICCA Journal, Vol. 18, No. 1, pp. 3-19.

129

Lake, R. and Schaeffer, J. and Lu, P. (1994). Solving large retrograde-analysis problems using a network of workstations. Advances in Computer Chess 7, H.J. van den Herik and I.S. Herschberg and J.W.H.M. Uiterwijk (eds.), pp. 135-162, University of Maastricht, ISBN 9-062-16101-4.

130

Levy, D.N.L. (1997). Crystal balls: The meta-science of prediction in computer chess. ICCA Journal, Vol. 20, No. 2, pp. 71-78.

131

Levy, D.N.L. and Newborn, M.M. (1991). How Computers Play Chess. Computer Science Press, ISBN 0-716-78121-2/0-716-78239-1.

132

Levy, D.N.L. and Beal, D.F. (editors). (1991). Heuristic Programming in Artificial Intelligence 2. Ellis Horwood, ISBN 0-133-82615-5.

133

Levy, D.N.L. (1991). Straight on to Kasparov. ICCA Journal, Vol. 17, No. 2, p. 111.

134

Levy, D.N.L. and Beal, D.F. (editors). (1989). Heuristic Programming in Artificial Intelligence 1. Ellis Horwood.

135

Levy, D.N.L. and Broughton, D.C. and Taylor, M. (1989). The SEX algorithm in computer chess. ICCA Journal, Vol. 12, No. 1, pp. 10-21.

136

Levy, D.N.L. (editor). (1988). Computer Games I. Springer, ISBN 0-387-96496-4/3-540-96496-4.

137

Levy, D.N.L. (editor). (1988). Computer Chess Compendium. Springer, ISBN 0-387-91331-9.

138

Levy, D.N.L. (1986). When will brute force programs beat Kasparov? ICCA Journal, Vol. 9, No. 2, pp. 81-86.

139

Levy, D.N.L. (1971). Computer chess - A case study on the CDC 6600. Machine Intelligence 6, B. Meltzer and D. Michie (eds.), pp. 255-265, Edinburgh University Press, ISBN 0-852-24195-X.

140

Marris, C.A. (1989). Compressing a chess-endgame database. ICCA Journal, Vol. 12, No. 1, pp. 22-24.

141

Marsland, T.A. (1992). Computer chess and search. Encyclopedia of Artificial Intelligence, S.C. Shapiro (ed.), pp. 224-241, Wiley & Sons, 2nd ed. 1992, ISBN 0-471-50305-3.

142

Marsland, T.A. and Schaeffer J. (editors). (1990). Computers, Chess, and Cognition. Springer, ISBN 0-387-97415-6/3-540-97415-6.

143

Marsland, T.A. (1990). The Bratko-Kopec test revisited. ICCA Journal, Vol. 13, No. 1, pp. 15-19 [reprinted in Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 217-223, Springer, ISBN 0-387-97415-6/3-540-97415-6].

144

Marsland, T.A. (1986). A review of game-tree pruning. ICCA Journal, Vol. 9, No. 1, pp. 3-19.

145

Marsland, T.A. (1983). Relative efficiency of alpha-beta implementations. 8th International Joint Conference on Artificial Intelligence, Proceedings Vol. II, A. Bundy (ed.), pp. 763-766, Kaufmann, ISBN 0-865-76064-0.

146

Marsland, T.A. (1982). Relative performance of the alpha-beta algorithm. ICCA Newsletter, Vol. 5, No. 2, pp. 21-24.

147

Marsland, T.A. (1979). A bibliography of computer chess. Machine Intelligence 9, J.E. Hayes and D. Michie and L.I. Mikulich (eds.), pp. 385-403, Ellis Horwood, ISBN 0-470-26714-3/0-853-12112-5.

148

McCarthy, J. (1990). Chess as the drosophila of AI. Computers, Chess, and Cognition, T.A. Marsland and J. Schaeffer (eds.), pp. 227-237, Springer, ISBN 0-387-97415-6/3-540-97415-6.

149

Meltzer, B. and Michie, D. (editors). (1973). Machine Intelligence 4. Edinburgh University Press (reprint), ISBN 0-852-24062-7.

150

Meltzer, B. and Michie, D. (editors). (1971). Machine Intelligence 6. Edinburgh University Press, ISBN 0-852-24195-X.

151

Michie, D. (1995). Game mastery and intelligence. Machine Intelligence 14, K. Furukawa and D. Michie and S. Muggleton (eds.), pp. 3-27, Oxford University Press, ISBN 0-198-53860-X.

152

Michie, D. (1980). Chess with computers. Interdisciplinary Science Review, Vol. 5, No. 3, pp. 215-227.

153

Michie, D. (editor). (1979). Expert systems in the micro-electronic age. Edinburg University Press, ISBN 0-852-24381-2.

154

Michalski, R.S. and Negri, P. (1977). An experiment on inductive learning in chess end games. Machine Intelligence 8, E.W. Elcock and D. Michie (eds.), pp. 175-192, Ellis Horwood, ISBN 0-470-99059-7/0-853-12058-7.

155

Moussouris, J. and Holloway, J. and Greenblatt, R. (1979). CHEOPS: A chess-oriented processing system. Machine Intelligence 9, J.E. Hayes and D. Michie and L.I. Mikulich (eds.), pp. 351-360, Ellis Horwood, ISBN 0-470-26714-3/0-853-12112-5 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 279-285, Springer, 1989, ISBN 0-387-91331-9].

156

Muggleton, S.H. (1990). Inductive Acquisition of Expert Knowledge. Turing Institute Press, ISBN 0-201-17561-4.

157

Muggleton, S. (1988). Inductive acquisition of chess strategies. Machine Intelligence 11, J.E. Hayes and D. Michie and J. Richards (eds.), pp. 375-389, Oxford University Press, ISBN 0-198-53718-2.

158

Mysliwietz, P. (1994). Konstruktion und Optimierung von Bewertungsfunktionen beim Schach. Dissertation (Ph.D. Thesis), University of Paderborn.

159

Nefkens, H.J.J. (1985). Constructing data bases to fit a microcomputer. ICCA Journal, Vol. 8, No. 4, pp. 219-224.

160

Negri, P. (1977). Inductive learning in a hierarchical model for representing knowledge in chess end games. Machine Intelligence 8, E.W. Elcock and D. Michie (eds.), pp. 193-204, Ellis Horwood, ISBN 0-470-99059-7/0-853-12058-7.

161

Nelson, H.L. (1985). Hash tables in CRAY BLITZ. ICCA Journal, Vol. 8, No. 1, pp. 3-13.

162

Newborn, M.M. (1997). Kasparov versus DEEP BLUE: Computer Chess Comes of Age. Springer, ISBN 0-387-94820-1.

163

Newborn, M.M. (1985). A hypothesis concerning the strength of chess programs. ICCA Journal, Vol. 8, No. 4, pp. 209-215.

164

Newborn, M.M. (1979). Recent progress in computer chess. Advances in Computers, Vol. 18, No. ?, pp. 59-117 [reprinted in Computer Games I, D.N.L. Levy (ed.), pp. 226-324, Springer, ISBN 0-387-96496-4/3-540-96496-4].

165

Newborn, M.M. (1978). Computer chess: Recent progress and future expectations. 3rd Jerusalem Conference on Information Technology, Proceedings, J. Moneta (ed.), North-Holland, ISBN 0-444-85192-5.

166

Newborn, M.M. (1975). Computer Chess. Academic Press, ISBN 0-12-517250-8.

167

Niblett, T.B. (1982). A provably correct advice strategy for the end-game of King and Pawn versus King. Machine Intelligence 10, J.E. Hayes and D. Michie and Y.-H. Pao (eds.), pp. 101-120, Ellis Horwood, ISBN 0-470-27323-2/0-853-12431-0.

168

Nievergelt, J. (1977). Information content of chess positions: Implications for game-specific knowledge of chess players. SIGART Newsletter, Vol. 62, pp. 13-15 [reprinted in Machine Intelligence 12, J.E. Hayes and D. Michie and E. Tyugu (eds.), pp. 283-289, Oxford University Press, 1991, ISBN 0-198-53823-5].

169

Palay, A.J. (1984). Searching with Probabilities. Pitman, ISBN 0-273-08664-2.

170

Palay, A.J. (1982). The B* tree search algorithm - New results. Artificial Intelligence, Vol. 19, No. 2, pp. 145-163.

171

Plaat, A. and Schaeffer, J. and Pijls, W. and deBruin, A. (1996). Best-first fixed-depth minimax algorithms. Artificial Intelligence, Vol. 87, pp. 255-293.

172

Quinlan, J.R. (1983). Learning efficient classification procedures and their application to chess end games. Machine Learning: An Artificial Intelligence Approach, R.S. Michalski and J.G. Carbonnell and T.M. Mitchell (eds.), pp. 463-482, Tioga, ISBN 0-935-38205-4 [reprinted by Springer, 1983, ISBN 0-387-13298-8/3-540-13298-8].

173

Quinlan, J.R. (1979). Discovering rules by induction from large collections of examples. Expert Systems in the Micro-Electronic Age, D. Michie (ed.), pp. 168-201, Edinburg University Press, ISBN 0-852-24381-2.

174

Reinefeld, A. (1983). An improvement to the SCOUT tree-search algorithm. ICCA Journal, Vol. 6, No. 4, pp. 4-14.

175

Roycroft, A.J. (1988). Expert against oracle. Machine Intelligence 11, J.E. Hayes and D. Michie and J. Richards (eds.), pp. 347-373, Oxford University Press, ISBN 0-198-53718-2.

176

Schaeffer, J. and Lake, R. and Lu, P. and Bryant, M. (1996). CHINOOK: The World Man-Machine Checkers Champion. AI Magazine, Vol. 17, No. 1, pp. 21-29.

177

Schaeffer, J. and Plaat, A. (1996). New advances in alpha-beta searching. 24th ACM Computer Science Conference, Proceedings, pp. 124-130, ACM Press.

178

Schaeffer, J. and Lu, P. and Szafron, D. and Lake, R. (1993). A re-examination of brute-force search, AAAI Fall Symposium, Proceedings (AAAI Report FS-93-02: Intelligent Games - Planning and Learning), S. Epstein and R. Levinson (eds.), pp. 51-58, AAAI Press, ISBN 0-929-28051-2.

179

Schaeffer, J. and Culberson, J. and Treloar, N. and Knight, B. and Lu, P. and Szafron, D. (1992). A World Championship caliber checkers program. Artificial Intelligence, Vol. 53, No. 2-3, pp. 273-290.

180

Schaeffer, J. (1989). The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 11, pp. 1203-1212.

181

Schaeffer, J. (1989). Distributed game-tree searching. Journal of Parallel and Distributed Computing, Vol. 6, No. 2, pp. 90-114.

182

Schaeffer, J. (1986). Experiments in Search and Knowledge. Ph.D. Thesis, University of Waterloo [reprinted as Technical Report TR 86-12, Department of Computing Science, University of Alberta].

183

Schaeffer, J. (1983). The history heuristic. ICCA Journal, Vol. 6, No. 3, pp. 16-19.

184

Scott, J.J. (1969). A chess-playing program. Machine Intelligence 4, B. Meltzer and D. Michie (eds.), pp. 255-265, Edinburgh University Press, 1973, ISBN 0-852-24062-7.

185

Shannon, C.E. (1950). Programming a computer for playing chess. Philosophical Magazine, Vol. 41 (7th series), pp. 256-275 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 2-13, Springer, 1989, ISBN 0-387-91331-9].

186

Shapiro, A.D. (1987). Structured Induction in Expert Systems. Turing Institute Press, ISBN 0-201-17813-3.

187

Shapiro, A.D. and Michie, D. (1986). A self-commenting facility for inductively synthesized endgame expertise. Advances in Computer Chess 4, D.F. Beal (ed.), pp. 147-165, Pergamon, ISBN 0-080-29763-3.

188

Shapiro, A.D. and Niblett, T.B. (1982). Automatic induction of classification rules for a chess endgame. Advances in Computer Chess 3, M.R.B. Clarke (ed.), pp. 73-92, Pergamon, ISBN 0-080-26898-6.

189

Slagle, J.R. (1971). Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill, New York.

190

Slate, D.J. (1984). Interior-node score bounds in a brute-force chess program. ICCA Journal, Vol. 7, No. 4, pp. 184-192.

191

Slate, D.J. and Atkin, L.R. (1977). CHESS 4.5 - The Northwestern University chess program. Chess Skill in Man and Machine,P.W. Frey (ed.), pp. 82-118, Springer, 2nd ed. 1983, ISBN 0-387-90790-4/3-540-90790-4.

192

Smith, S.J.J. and Nau, D.S. (1994). An analysis of forward pruning. 12th National Conference on Artificial Intelligence (AAAI-94), Proceedings Vol. II, pp. 1386-1391, AAAI Press, ISBN 0-262-51078-2.

193

Stiller, L.B. (1995). Exploiting Symmetry of Parallel Architectures. Ph.D. Thesis, John Hopkins University.

194

Stiller, L.B. (1992). KQNKRR. ICCA Journal, Vol. 15, No. 1, pp. 16-18.

195

Stiller, L.B. (1991). Group graphs and computational symmetry on massively parallel architectures. The Journal of Supercomputing, Vol. 5, No. 2, pp. 99-117.

196

Stiller, L.B. (1989). Parallel analysis of certain endgames. ICCA Journal, Vol. 12, No. 2, pp. 55-64.

197

Ströhlein, T. (1970). Untersuchungen über kombinatorische Spiele. Dissertation (Ph.D. Thesis), Technical University of Munich.

198

Szabo, A. and Szabo, B. (1988). The technology curve revisited. ICCA Journal, Vol. 11, No. 1, pp. 14-20.

199

Szabo, A. (1984). Computer-Chess Tactics and Strategy. M.Sc. Thesis, University of British Columbia.

200

Tan, S.T. (1972). Representation of Knowledge for Very Simple Endings in Chess. Memorandum MIP-R-98, School of Artificial Intelligence, University of Edinburgh.

201

The Editors. (1993). Thompson: Quintets with variations. ICCA Journal, Vol. 16, No. 2, pp. 86-90.

202

The Editors. (1992). Thompson: All about five men. ICCA Journal, Vol. 15, No. 3, pp. 140-143.

203

Thompson, K. (1996). 6-Piece endgames. ICCA Journal, Vol. 19, No. 4, pp. 215-226.

204

Thompson, K. (1991). Chess endgames volume 1. ICCA Journal, Vol. 14, No. 1, p. 22.

205

Thompson, K. (1986). Retrograde analysis of certain endgames. ICCA Journal, Vol. 9, No. 3, pp. 131-139.

206

Thompson, K. (1982). Computer chess strength. Advances in Computer Chess 3, M.R.B. Clarke (ed.), pp. 55-56, Pergamon, ISBN 0-080-26898-6.

207

van Tiggelen, A. (1998). Heuristic Search Methods in Parameter Space. Engineering Bureau van Tiggelen, ISBN 9-075-85604-0.

208

van Tiggelen, A. (1991). Neural networks as a guide to optimization. ICCA Journal, Vol. 14, No. 3, pp. 115-118.

209

van Tiggelen, A. and van den Herik, H.J. (1991). ALEXS: An optimization approach for the endgame KNNKP(h). Advances in Computer Chess 6, D.F. Beal (ed.), pp. 161-177, Ellis Horwood, ISBN 0-130-06537-4.

210

Uiterwijk, J.W.H.M. (1992). Memory efficiency in some heuristics. ICCA Journal, Vol. 15, No. 2, pp. 67-74.

211

Valenti, F.M. and Vranesic, Z.G. (1977). Experiences with CHUTE. ACM '77 National Conference, Proceedings, pp. 474-478, ACM Press.

212

Verhoef, T.F. and Wesselius, J.H. (1987). Two-ply KRKN: Safely overtaking Quinlan. ICCA Journal, Vol. 10, No. 4, pp. 181-190.

213

Weill, J.-C. (1994). How hard is the correct coding of an easy endgame? Advances in Computer Chess 7, H.J. van den Herik and I.S. Herschberg and J.W.H.M. Uiterwijk (eds.), pp. 163-175, University of Maastricht, ISBN 9-062-16101-4.

214

Wendroff, B. (1985). Attack detection and move generation on the X-MP/48. ICCA Journal, Vol. 8, No. 2, pp. 58-65.

215

Wilkins, D. (1980). Using patterns and plans in chess. Artificial Intelligence, Vol. 14, No. 2, pp. 165-203 [reprinted in Computer Chess Compendium, D.N.L. Levy (ed.), pp. 233-257, Springer, 1989, ISBN 0-387-91331-9].

216

Ye, C. and Marsland, T.A. (1992). Experiments in forward pruning with limited extensions. ICCA Journal, Vol. 15, No. 2, pp. 55-66.

217

Zellner, H. (1986). Compressing databases down to micro size. ICCA Journal, Vol. 9, No. 4, pp. 199-200.

218

Zuidema, C. (1974). Chess: How to Program the Exceptions? Technical Report IW21/74, Department of Informatics, Mathematical Center Amsterdam.