Best-first minimax search
From MaRDI portal
Publication:2171269
DOI10.1016/0004-3702(95)00096-8zbMath1506.68126OpenAlexW2124622524MaRDI QIDQ2171269
Richard E. Korf, David Maxwell Chickering
Publication date: 23 September 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(95)00096-8
Related Items
LinUCB applied to Monte Carlo tree search ⋮ Conspiracy number search with relative sibling scores ⋮ A Bayesian approach to relevance in game playing ⋮ Benefits of using multivalued functions for minimaxing ⋮ Optimistic minimax search for noncooperative switched control with or without dwell time ⋮ Parallel randomized best-first minimax search.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A world-championship-level Othello program
- Linear-space best-first search
- Game tree searching by min/max approximation
- Conspiracy numbers for min-max search
- A minimax algorithm better than alpha-beta?
- The last player theorem
- An investigation of the causes of pathology in games
- An analysis of alpha-beta pruning
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- Heuristic search in restricted memory
- Searching for an optimal path in a tree with random costs
- The heuristic search under conditions of error
- Experiments With Some Programs That Search Game Trees
- COKO III
