Pages that link to "Item:Q2676580"
From MaRDI portal
The following pages link to Best-first fixed-depth minimax algorithms (Q2676580):
Displaying 12 items.
- Method of outer approximations and adaptive approximations for a class of matrix games (Q328448) (← links)
- Tuning evaluation functions by maximizing concordance (Q817798) (← links)
- Strategies anticipating a difference in search depth using opponent-model search (Q1589507) (← links)
- A solution to the GHI problem for best-first search (Q1589511) (← links)
- Sokoban: Improving the search with relevance cuts (Q1589512) (← links)
- Unifying single-agent and two-player search (Q1602466) (← links)
- An effective two-level proof-number search algorithm (Q1885011) (← links)
- Eigen-distribution on random assignments for game trees (Q2380000) (← links)
- Proof-Number Search and Its Variants (Q5302475) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)
- Games solved: Now and in the future (Q5958209) (← links)
