Pages that link to "Item:Q1838331"
From MaRDI portal
The following pages link to A comparison of minimax tree search algorithms (Q1838331):
Displaying 13 items.
- A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Proof-number search (Q1321057) (← links)
- Autonomous agents modelling other agents: a comprehensive survey and open problems (Q1639697) (← links)
- A minimax algorithm better than alpha-beta? Yes and no (Q1837546) (← links)
- Eigen-distribution on random assignments for game trees (Q2380000) (← links)
- Best-first fixed-depth minimax algorithms (Q2676580) (← links)
- Extended Null-Move Reductions (Q3601834) (← links)
- AWT: Aspiration with Timer Search Algorithm in Siguo (Q3601838) (← links)
- Two-agent IDA* (Q4421276) (← links)
- Computer Go: An AI oriented survey (Q5958709) (← links)
- Simulation-based search (Q6198646) (← links)
- Artificial intelligence for games (Q6602258) (← links)
