Pages that link to "Item:Q1246268"
From MaRDI portal
The following pages link to On the branching factor of the alpha-beta pruning algorithm (Q1246268):
Displaying 18 items.
- Equilibrium points of an AND-OR tree: under constraints on probability (Q490867) (← 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)
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves (Q1099794) (← links)
- Statistical heuristic search (Q1100907) (← 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)
- An investigation of the causes of pathology in games (Q1173415) (← links)
- Is SSS* better than alpha-beta? (Q1836984) (← links)
- A minimax algorithm better than alpha-beta? Yes and no (Q1837546) (← links)
- Pathology on game trees revisited, and an alternative to minimaxing (Q1837547) (← links)
- A comparison of minimax tree search algorithms (Q1838331) (← links)
- On the nature of pathology in game searching (Q1838332) (← links)
- Bounded branching process and and/or tree evaluation (Q4847398) (← links)
- Trends in game tree search (Q6560188) (← links)
- The equilibria of independent distributions on unbalanced game trees (Q6563148) (← links)
