Friday, 04 April 2014
Alternative Game Tree Search Algorithms
Here some alternative algorithms to plain MiniMax AlphaBeta search...
- Best-first minimax search by Richard E. Korf and David Maxwell Chickering, http://maxchickering.com/publications/aij96.pdf
- CNS, Conspiracy Number Search
- Monte Carlo Tree Search, with or without UCT extension.
- Nagging, http://www.academia.edu/
- Parallel Game Tree Search on SIMD machines by Holger Hopp and Peter Sanders, http://algo2.iti.kit.edu/sanders/papers/gamet.ps.gz
- Parallel Randomized Best-First Minimax Search by Yaron Shoham and Sivan Toledo, http://www.cs.tau.ac.il/~stoledo/Pubs/rbf-ai.pdf
There are no published comments.
New comment