An analysis of alpha-beta pruning
From MaRDI portal
Cites work
- Branch-and-Bound Methods: A Survey
- Experiments in automatic learning for a multipurpose hueristic program
- Experiments With a Multipurpose, Theorem-Proving Heuristic Program
- Experiments With Some Programs That Search Game Trees
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3523110 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3338922 (Why is no real title available?)
- scientific article; zbMATH DE number 3388544 (Why is no real title available?)
Cited in
(96)- The *-minimax search procedure for trees containing chance nodes
- A quantitative analysis of the alpha-beta pruning algorithm
- A generalization of alpha-beta and SSS^* search procedures
- Game tree searching by min/max approximation
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves
- Statistical heuristic search
- Conspiracy numbers for min-max search
- Pattern knowledge and search: The SUPREM architecture
- Benefits of using multivalued functions for minimaxing
- Pruning algorithms for multi-model adversary search
- A minimax algorithm better than alpha-beta?
- Asymptotic properties of minimax trees and game-searching procedures
- The last player theorem
- Parallelism in alpha-beta search
- An investigation of the causes of pathology in games
- A game tree with distinct leaf values which is easy for the alpha-beta algorithm
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- On the branching factor of the alpha-beta pruning algorithm
- The multi-player version of minimax displays game-tree pathology
- Proof-number search
- An analysis of the conspiracy numbers algorithm
- A general framework for minimax search in game trees
- Searching minimax game trees under memory space constraint
- Strategies anticipating a difference in search depth using opponent-model search
- Multi-cut -pruning in game-tree search
- Game tree algorithms and solution trees
- Probabilistic opponent-model search
- Parallel randomized best-first minimax search.
- Special issue: Heuristic search and computer game playing
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Computational ability in games: individual difference and dynamics
- Non-depth-first search against independent distributions on an AND-OR tree
- Is SSS* better than alpha-beta?
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- A minimax algorithm better than alpha-beta? Yes and no
- Pathology on game trees revisited, and an alternative to minimaxing
- A comparison of minimax tree search algorithms
- On the nature of pathology in game searching
- Error analysis in minimax trees
- An effective two-level proof-number search algorithm
- Pruning with improving sequences in lazy functional programs
- Solving \(8\times 8\) Domineering
- On pruning search trees of impartial games
- Integrating formal specifications into applications: the ProB Java API
- Best-first minimax search
- Independent distributions on a multi-branching AND-OR tree of height 2
- Optimistic minimax search for noncooperative switched control with or without dwell time
- Eigen-distribution on random assignments for game trees
- Is real-valued minimax pathological?
- Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
- Multistage robust discrete optimization via quantified integer programming
- The eigen-distribution for multi-branching weighted trees on independent distributions
- Searching game trees under a partial order
- Best-first fixed-depth minimax algorithms
- Using evaluation functions in Monte-Carlo tree search
- LinUCB applied to Monte Carlo tree search
- Conspiracy number search with relative sibling scores
- Polymerization and crystallization of snowflake molecules in Domineering
- On game graph structure and its influence on pathology
- Autonomous evolution of topographic regularities in artificial neural networks
- AWT: Aspiration with Timer Search Algorithm in Siguo
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
- Two-agent IDA*
- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
- Equilibrium points of an AND-OR tree: under constraints on probability
- New results for Domineering from combinatorial game theory endgame databases
- Uniqueness of optimal randomized algorithms for balanced AND-OR trees
- Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
- Proof-Number Search and Its Variants
- ENHANCED REALIZATION PROBABILITY SEARCH
- MONTE CARLO GO CAPTURING TACTIC SEARCH
- Asymmetric Action Abstractions for Planning in Real-Time Strategy Games
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi
- Partial order bounding: A new approach to evaluation in game tree search
- Deep Blue
- Computer Go: An AI oriented survey
- When is it better not to look ahead?
- Trends in game tree search
- Mapping tree-structured combinatorial optimization problems onto parallel computers
- Artificial intelligence for games
- Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees
- An AI-aided algorithm for multivariate polynomial reconstruction on Cartesian grids and the PLG finite difference method
- Monte Carlo tree search for dynamic shortest-path interdiction
- Alpha-beta pruning verified (invited talk)
- A faster alternative to \(SSS^*\) with extension to variable memory
- Game-theoretic analysis of adversarial decision making in a complex socio-physical system
- The complexity of pure maxmin strategies in two-player extensive-form games
- The distributional complexity of game trees over correlated distributions and independent distributions
- Alpha-Beta Pruning
- Multi-player alpha-beta pruning
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- General branch and bound, and its relation to A^* and AO^*
- Error propagation in game trees
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
- The complexity of a simple stochastic OR-tree model in which ``directional search is bad
- A randomized competitive algorithm for evaluating priced AND/OR trees
This page was built for publication: An analysis of alpha-beta pruning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238442)
