Error Propagation in Game Trees
暂无分享,去创建一个
[1] Claude E. Shannon,et al. XXII. Programming a Computer for Playing Chess 1 , 1950 .
[2] Ulf Lorenz,et al. Controlled Conspiracy-2 Search , 2000, STACS.
[3] Bruce W. Ballard,et al. Non-Minimax Search Strategies for Use Against Fallible Opponents , 1983, AAAI.
[4] Ingo Althöfer,et al. Root Evaluation Errors: How they Arise and Propagate , 1988, J. Int. Comput. Games Assoc..
[5] Hermann Kaindl,et al. The Reason for the Benefits of Minimax Search , 1989, IJCAI.
[6] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..
[7] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[8] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[9] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[10] Jonathan Schaeffer,et al. Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..
[11] Jonathan Schaeffer,et al. Conspiracy Numbers , 1990, Artif. Intell..
[12] Christian Donninger,et al. Null Move and Deep Search , 1993, J. Int. Comput. Games Assoc..
[13] Ulf Lorenz,et al. The Secret of Selective Game Tree Search, When Using Random-Error Evaluations , 2002, STACS.
[14] Ulf Lorenz,et al. Beyond Optimal Play in Two-Person-Zerosum Games , 2004, ESA.