Pathology on game trees revisited, and an alternative to minimaxing
From MaRDI portal
(Redirected from Publication:1837547)
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3713199 (Why is no real title available?)
- A minimax algorithm better than alpha-beta?
- An analysis of alpha-beta pruning
- An investigation of the causes of pathology in games
- Asymptotic properties of minimax trees and game-searching procedures
- Decision Quality As a Function of Search Depth on Game Trees
- On the branching factor of the alpha-beta pruning algorithm
- On the nature of pathology in game searching
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- The last player theorem
Cited in
(18)- When is it better not to look ahead?
- Limited lookahead in imperfect-information games
- A Bayesian approach to relevance in game playing
- Game tree searching by min/max approximation
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves
- A study of decision error in selective game tree search
- Unifying single-agent and two-player search
- On game graph structure and its influence on pathology
- Independent-valued minimax: Pathological or beneficial?
- Partial order bounding: A new approach to evaluation in game tree search
- Bias and pathology in minimax search
- Benefits of using multivalued functions for minimaxing
- An incremental negamax algorithm
- The multi-player version of minimax displays game-tree pathology
- Conspiracy numbers for min-max search
- Two-agent IDA*
- Is real-valued minimax pathological?
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
This page was built for publication: Pathology on game trees revisited, and an alternative to minimaxing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837547)
