Pages that link to "Item:Q1837546"
From MaRDI portal
The following pages link to A minimax algorithm better than alpha-beta? Yes and no (Q1837546):
Displaying 8 items.
- 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)
- Conspiracy numbers for min-max search (Q1102218) (← links)
- A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799) (← links)
- Game tree algorithms and solution trees (Q1589517) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- Best-first fixed-depth minimax algorithms (Q2676580) (← links)