Game tree search on a massively parallel SIMD machine : an algorithmic study with computer chess
A parallel game tree search algorithm is presented in this thesis to verify the possibility of efficient use of a Single Instruction Multiple Data (SIMD) machine for computer game playing. It follows a loop of search and load balancing. In order to eliminate the serious processor starvation that is...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2008
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/13352 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|