Searching for "Best-First Minimax Search." – sorted by Relevance.
-
Best-First and Depth-First Minimax Search in Practice
- Best-First and Depth-First Minimax Search in Practice Aske Plaat, Erasmus University, plaat
- Cited by 1 (0 self) – Add To MetaCart
-
An Algorithm Faster than NegaScout and SSS* in Practice
- knowledge this is the first comparison of depth-first and best-first minimax search algorithms where all
- Add To MetaCart
-
Best-First Fixed-Depth Game-Tree Search in Practice
- in on the minimax value. Surprisingly, MTD can be used to construct a variety of best-first search algorithms (such
- Cited by 18 (7 self) – Add To MetaCart
-
A Minimax Algorithm Better than Alpha-Beta? No and Yes
- Alpha-Beta for searching fixed-depth minimax trees [51]. It builds a tree in a so-called best-first
- Cited by 7 (3 self) – Add To MetaCart
-
Best-First Fixed-Depth Minimax Algorithms
- at the root in a fixed-depth search, and a new algorithm called Best-First Minimax Search, which expands
- Cited by 25 (3 self) – Add To MetaCart
-
ParallelRandom17 Best-FirstMinimF Search
- Parallel Randomized Best-First Minimax Search 1 Abstract Yaron Shoham 2 , Sivan Toledo 3 School
- Add To MetaCart
-
The Future of Chess-Playing Technologies and the Significance of Kasparov Versus Deep Blue
- minimax search. Best-first minimax search is relatively simple yet beats fixed-depth alpha-beta search
- Cited by 1 (0 self) – Add To MetaCart
-
unknown title
- 1993. [70] Richard E. Korf and David W. Chickering. Best-first minimax search: Othelloresults
- Add To MetaCart
-
New Advances in Alpha-Beta Searching
- between algorithms such as SSS*,which are principally fixed-depth best-first minimax searches, and a very
- Cited by 9 (1 self) – Add To MetaCart

