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:
書目詳細資料
主要作者: He, Shaojun.
其他作者: Sisira K Amarasinghe
格式: Theses and Dissertations
語言:English
出版: 2008
主題:
在線閱讀:http://hdl.handle.net/10356/13352
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English