The following pages link to An analysis of alpha-beta pruning (Q1238442):
Displaying 50 items.
- Using evaluation functions in Monte-Carlo tree search (Q307789) (← links)
- LinUCB applied to Monte Carlo tree search (Q307792) (← links)
- Conspiracy number search with relative sibling scores (Q307794) (← links)
- Polymerization and crystallization of snowflake molecules in Domineering (Q307795) (← links)
- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information (Q464622) (← links)
- Equilibrium points of an AND-OR tree: under constraints on probability (Q490867) (← links)
- New results for Domineering from combinatorial game theory endgame databases (Q500968) (← links)
- When is it better not to look ahead? (Q622121) (← links)
- A faster alternative to \(SSS^*\) with extension to variable memory (Q689627) (← links)
- Multi-player alpha-beta pruning (Q753695) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- Error propagation in game trees (Q857818) (← links)
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) (← links)
- The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453) (← links)
- A randomized competitive algorithm for evaluating priced AND/OR trees (Q935154) (← links)
- The *-minimax search procedure for trees containing chance nodes (Q1050777) (← links)
- A quantitative analysis of the alpha-beta pruning algorithm (Q1055189) (← links)
- A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves (Q1099794) (← links)
- Statistical heuristic search (Q1100907) (← links)
- Conspiracy numbers for min-max search (Q1102218) (← links)
- Pattern knowledge and search: The SUPREM architecture (Q1116365) (← links)
- Benefits of using multivalued functions for minimaxing (Q1128640) (← links)
- Pruning algorithms for multi-model adversary search (Q1128651) (← links)
- A minimax algorithm better than alpha-beta? (Q1131840) (← links)
- Asymptotic properties of minimax trees and game-searching procedures (Q1145506) (← links)
- The last player theorem (Q1158067) (← links)
- Parallelism in alpha-beta search (Q1167551) (← links)
- An investigation of the causes of pathology in games (Q1173415) (← links)
- A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799) (← links)
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores (Q1238628) (← links)
- On the branching factor of the alpha-beta pruning algorithm (Q1246268) (← links)
- The multi-player version of minimax displays game-tree pathology (Q1313961) (← links)
- Proof-number search (Q1321057) (← links)
- An analysis of the conspiracy numbers algorithm (Q1324392) (← links)
- A general framework for minimax search in game trees (Q1342257) (← links)
- Searching minimax game trees under memory space constraint (Q1356215) (← links)
- Strategies anticipating a difference in search depth using opponent-model search (Q1589507) (← links)
- Multi-cut \(\alpha \beta\)-pruning in game-tree search (Q1589514) (← links)
- Game tree algorithms and solution trees (Q1589517) (← links)
- Probabilistic opponent-model search (Q1602464) (← links)
- Parallel randomized best-first minimax search. (Q1605282) (← links)
- Special issue: Heuristic search and computer game playing (Q1608365) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Computational ability in games: individual difference and dynamics (Q1740053) (← links)
- Non-depth-first search against independent distributions on an AND-OR tree (Q1799561) (← links)
- Is SSS* better than alpha-beta? (Q1836984) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
