Game tree search methods
The book discusses algorithms for computing minimax strategies in two- person zero-sum games in extensive form with finite game trees and full information. In the first part (chapters 1 and 2) of the book, the problem is stated, and the existing searech algorithms are presented. The author gives a detailed description of each of the main types of algorithm, such as \(\alpha\beta\)-search, scout, state space search, as well as several derived or mixed versions of the basic algorithms. In chapter 3, the algorithms are compared from a theoretical point of view; this comparison may be based on several different approaches, such as asymptotic complexity, or the number of nodes to be expanded. The fourth chapter discusses practical aspects of computation and evaluates the performance of the algorithms from this point of view.
- Game tree searching by min/max approximation
- Game tree algorithms and solution trees
- Best-first fixed-depth minimax algorithms
- Algorithms for computing strategies in two-player simultaneous move games
- scientific article; zbMATH DE number 3850493 (Why is no real title available?)
- scientific article; zbMATH DE number 3866549 (Why is no real title available?)
- Algorithms for games.
- scientific article; zbMATH DE number 4001519 (Why is no real title available?)
- scientific article; zbMATH DE number 895355 (Why is no real title available?)
- The tree search game for two players
- Game chains
- Artificial intelligence for games
- Error propagation in game trees
This page was built for publication: Game tree search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992453)