An analysis of decision quality of minimaxing vs. product propagation
暂无分享,去创建一个
[1] Hermann Kaindl,et al. Back-up of Heuristic Values: Minimaxing vs. Product Propagation , 1998, ECAI.
[2] Jonathan Schaeffer,et al. CHINOOK: The World Man-Machine Checkers Champion , 1996, AI Mag..
[3] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[4] Dana S. Nau. Pathology on Game Trees: A Summary of Results , 1980, AAAI.
[5] Hermann Kaindl,et al. Minimax Search Algorithms With and Without Aspiration Windows , 1991, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Dana S. Nau,et al. Experiments on alternatives to minimax , 2005, International Journal of Parallel Programming.
[7] James R. Slagle,et al. Experiments With a Multipurpose, Theorem-Proving Heuristic Program , 1968, JACM.
[8] Dana S. Nau,et al. Pathology on Game Trees Revisited, and an Alternative to Minimaxing , 1983, Artif. Intell..
[9] Hermann Kaindl,et al. Searching to Variable Depth in Computer Chess , 1983, IJCAI.
[10] Hermann Kaindl,et al. Benefits of using Multivalued Functions for Minimaxing , 1998, J. Int. Comput. Games Assoc..
[11] D. Nau,et al. Comparison of the minimax and product back-up rules in a variety of games , 1988 .
[12] Dana S. Nau. On game graph structure and its influence on pathology , 1983, International Journal of Computer & Information Sciences.
[13] Judea Pearl,et al. On the Nature of Pathology in Game Searching , 1983, Artif. Intell..