Game tree search on a massively parallel SIMD machine : an algorithmic study with computer chess

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...

Full description

Bibliographic Details
Main Author: He, Shaojun.
Other Authors: Sisira K Amarasinghe
Format: Thesis
Language:English
Published: 2008
Subjects:
DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Online Access:http://hdl.handle.net/10356/13352

Internet

http://hdl.handle.net/10356/13352

Similar Items