Probabilistic minimax Search of a Game Tree

スポンサーリンク

概要

• 論文の詳細を見る

• It has been observed that there are many game trees and fairly plausible evaluation functions such that the deeper searching by minimax method yields the worse decision, contrary to the popular belief. To cure the pathology, some searching methods alternative to minimax have been proposed by many authors. This paper also propose a new searching method, which is based on the observation that the minimax evaluation gives a different values after each one-step play.

• 東海大学の論文
• 1992-03-30

著者

• Hanazawa Masazumi

  Department Of Mathematical Sciences School Of Science Tokai University

• Hanazawa Masazumi

  Department Of Mathematical Sciences Tokai University

関連論文

• The Lightest Totalization of an Endnode Labelling of a Non-tree Graph II
• Countable metacompactness and tree topologies
• CS-Aronszajn trees under the negation of the Continuum Hypothesis
• A second order theory of ordinal numbers with Ackermann-type reflection schema
• Probabilistic minimax Search of a Game Tree

スポンサーリンク