Pages that link to "Item:Q1342257"
From MaRDI portal
The following pages link to A general framework for minimax search in game trees (Q1342257):
Displaying 13 items.
- A faster alternative to \(SSS^*\) with extension to variable memory (Q689627) (← links)
- A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Searching minimax game trees under memory space constraint (Q1356215) (← links)
- Multi-cut \(\alpha \beta\)-pruning in game-tree search (Q1589514) (← links)
- Game tree algorithms and solution trees (Q1589517) (← links)
- A study of decision error in selective game tree search (Q1602467) (← links)
- Applying genetic algorithms to game search trees (Q1864475) (← links)
- Best-first fixed-depth minimax algorithms (Q2676580) (← links)
- A framework for data mining on combinatorial game theory (Q3181607) (← links)
- (Q3489483) (← links)
- Game tree search methods (Q3992453) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)