Pages that link to "Item:Q1238628"
From MaRDI portal
The following pages link to The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores (Q1238628):
Displaying 15 items.
- 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)
- Benefits of using multivalued functions for minimaxing (Q1128640) (← links)
- A minimax algorithm better than alpha-beta? (Q1131840) (← links)
- An investigation of the causes of pathology in games (Q1173415) (← links)
- On the branching factor of the alpha-beta pruning algorithm (Q1246268) (← links)
- Strategies anticipating a difference in search depth using opponent-model search (Q1589507) (← links)
- Probabilistic opponent-model search (Q1602464) (← links)
- Special issue: Heuristic search and computer game playing (Q1608365) (← links)
- Pathology on game trees revisited, and an alternative to minimaxing (Q1837547) (← links)
- A comparison of minimax tree search algorithms (Q1838331) (← links)
- Best-first minimax search (Q2171269) (← links)
- Is real-valued minimax pathological? (Q2457627) (← links)
