αβService : an asynchronous parallel tree search service for ChessGrid
The performance of game playing programs depends heavily on the strength of the search algorithm used. As such, several research activities have been conducted to speed up game tree search algorithms by using parallel machines. Most of these algorithms are targeted towards shared memory models or...
Main Author: | Pramanik, Sukanta |
---|---|
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/16669 |
Similar Items
-
Parallelizing the Search Engine of the Game of Chinese Chess by GPU
by: Yi-YangZhuang, et al.
Published: (2010) -
Monte Carlo Tree Search in Chinese Dark Chess
by: Chang-Wei Gong, et al.
Published: (2011) -
Research on Parallel Search of Chinese Chess Software “Deep Elephant”
by: 林子哲
Published: (2007) -
An analysis of speculative search for asynchronous parallel alpha-beta search /
by: Waldorf, Mahlon R.
Published: (2000) -
The nature of chess expertise: knowledge or search?
by: Ekaterina E. Vasyukova
Published: (2012-01-01)