Distributed game tree search
暂无分享,去创建一个
Oliver Vornberger | Burkhard Monien | Peter Mysliwietz | R. Feldman | R. Feldman | B. Monien | O. Vornberger | Peter Mysliwietz
[1] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[2] Vipin Kumar,et al. A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..
[3] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[4] Oliver Vornberger,et al. Parallel Processing of Combinatorial Search , 1987, Parallel Algorithms and Architectures.
[5] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[6] E. W. Felten,et al. Chess on a hypercube , 1988, C3P.
[7] Monty Newborn,et al. A parallel search chess program , 1985, ACM '85.
[8] Vipin Kumar,et al. Parallel Branch-and-Bound Formulations for AND/OR Tree Search , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Gérard M. Baudet,et al. On the Branching Factor of the Alpha-Beta Pruning Algorithm , 1978, Artif. Intell..
[10] T. Anthony Marsland,et al. A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..
[11] F. Warren Burton,et al. Alpha-beta search on virtual tree machines , 1988, Inf. Sci..
[12] Oliver Vornberger,et al. Implementing Branch-and-Bound in a Ring of Processors , 1986, CONPAR.
[13] George C. Stockman,et al. A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..
[14] T. Anthony Marsland,et al. Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.
[15] Fred Popowich,et al. Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Judea Pearl,et al. A Minimax Algorithm Better Than Alpha-Beta? Yes and No , 1983, Artif. Intell..