C H Tzeng
ABSTRACT
In estimating minimax values, an important topic in the study of heuristic game tree searches, a pathological phenomenon sometimes results when the conventional minimax procedure is used as a back-up process. In this paper exact methods are derived for two different games, one using product-propagation rules as a back-up process and another not using any back-up process. The method of estimating minimax values in a heuristic game tree search should depend on both the static evaluation function and the structure of the game tree; it can be very different for different games.
- 1.Nau, D. S,, Decision Quality as a Function of Search Depth of Came Tree. Technical Report TR-866, Computer Science Department, University of Maryland, 1980.Google Scholar
- 2.Nau, D. S,, Pearl's Game is Pathological. Technical Report TR-999, Computer Science Department, University of Maryland, January 1981.Google Scholar
- 3.Nau, D. S., Pathology on Game Trees Revisited, and an Alternative to Minimaxing, Artificial Intelligence 21 (1983), 221-224.Google ScholarDigital Library
- 4.Nau, D. S., Game Graph Structure and its influence on Pathology, Technical Report TR-1246, Computer Science Department, University of Maryland, February 1983.Google ScholarCross Ref
- 5.Nau, D. S., Purdom, P. and Tzeng, C.-H., Experiments on Alternative to Minimax, to appear in International 3ournal of Computer and Information Science, 1986. Google ScholarDigital Library
- 6.Pearl, 3., On the Nature of Pathology in Came Searching. Artificial Intelligence 20 (1983) 427-453.Google ScholarCross Ref
- 7.Reibman, A. L. and Ballard, B. W., Non-Minimax Search Strategies for Use Against Fallible Opponents, Proceeding of the National Conference on Artificial Intelligence, August 22-26, 1983, 338-342.Google Scholar
- 8.Tzeng, C.-H. and Purdom, P. W., A Theory of Came Trees, Proceedings of the National Conferences on Artificial Intelligence, August 22- 26, 1983, 416-419.Google Scholar
- 9.Tzeng, C.-H. and Purdom, P. W., Estimation of the Minimax Values of TWO Games, Working Paper WP-1, Computer Science Department, Ball State University, 1984.Google Scholar
Index Terms
- Estimation of minimax values
Recommendations
Error analysis in minimax trees
Algorithmic combinatorial game theoryGame tree search deals with the problems that arise, when computers play two-person-zero-sum-games such as chess, checkers, othello, etc. The greatest success of game tree search so far, was the victory of the chess machine 'Deep Blue' vs. G. Kasparov (...
Minimax MSE-ratio estimation with signal covariance uncertainties
In continuation to an earlier work, we further consider the problem of robust estimation of a random vector (or signal), with an uncertain covariance matrix, that is observed through a known linear transformation and corrupted by additive noise with a ...
Blind Minimax Estimation
We consider the linear regression problem of estimating an unknown, deterministic parameter vector based on measurements corrupted by colored Gaussian noise. We present and analyze blind minimax estimators (BMEs), which consist of a bounded parameter ...
Comments