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

• المؤلف الرئيسي: He, Shaojun.
• مؤلفون آخرون: Sisira K Amarasinghe
• التنسيق: Theses and Dissertations
• اللغة: English
• منشور في: 2008
• الموضوعات: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
• الوصول للمادة أونلاين: http://hdl.handle.net/10356/13352

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