Risk management in game-tree pruning

Information sciences

Volumn 122, Issue 1, 2000, Pages 23-41

  Bjornsson Y ^a   Marsland, T A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; RISK MANAGEMENT; TREES (MATHEMATICS);

COMPUTER CHESS; GAME-TREE PRUNING; GAME-TREE SEARCH;

GAME THEORY;

EID: 0342954971     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00097-3     Document Type: Article

References (13)

1. G.M. Adelson-Velskiy, V.L. Arlazarov, M.V. Donskoy, Some methods of controlling the tree search in chess programs, Artificial Intelligence 6 (4) (1975) 361-371.
2. D.F. Beal, A generalized quiescence search algorithm, Artificial Intelligence 43 (1990) 85-98; see also: Experiments with the null move, Advances in Computer Chess 5 (1989) 65-79.
3. D.F. Beal, A generalized quiescence search algorithm, Artificial Intelligence 43 (1990) 85-98; see also: Experiments with the null move, Advances in Computer Chess 5 (1989) 65-79.
4. M. Buro, ProbCut: An effective selective extension of the alpha-beta algorithm, ICCA Journal 18 (2) (1995) 71-76.
5. A. de Groot, Thought and Choice in Chess, Mouton, The Hague, 1978.
6. G. Goetsch, M.S. Campbell, Experimenting with the null move heuristic, in: T. Marsland, J. Schaeffer (Eds.), Computers Chess and Cognition, 1990, pp. 158-168. See also: AAAI Spring Symposium Proceedings, 1988, pp. 14-18.
7. G. Goetsch, M.S. Campbell, Experimenting with the null move heuristic, in: T. Marsland, J. Schaeffer (Eds.), Computers Chess and Cognition, 1990, pp. 158-168. See also: AAAI Spring Symposium Proceedings, 1988, pp. 14-18.
8. A. Junghanns, J. Schaeffer, M. Brockington, Y. Björnsson, T. Marsland, Diminishing returns for additional search in chess, Advances in Computer Chess 8 (1997) 53-67.
9. T.A. Marsland, Single-agent and game-tree search, in: A. Kent, J. Williams (Eds.), Encyclopedia of Computer Science and Technology, vol. 27, Marcel Dekker, New York, 1993 pp. 317-336.
10. A. Reinefeld, An Improvement to the Scout tree search algorithm, ICCA Journal 6 (4) (1993) 4-14.
11. F. Reinfeld, 1001 Brilliant Ways to Checkmate, Sterling Publishing Co., New York, 1955 (Reprinted by Melvin Powers Wilshire Book Company).
12. J. Schaeffer, The history heuristic and alpha-beta search enhancements in practice, IEEE Transcations on Pattern Analysis and Machine Intelligence 11 (1) (1989) 1203-1212.
13. S.J.J. Smith, D.S. Nau, An analysis of forward pruning, in: Proceedings of the Twelth National Conference on Artificial Intelligence AAAI-94, vol. 2, 1994, pp. 1386-1391.