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:
Main Author: | He, Shaojun. |
---|---|
Other Authors: | Sisira K Amarasinghe |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/13352 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Massively parallel implementation of a pattern based evaluation function for computer chess
by: U. G. Namal Prasanna Kumara
Published: (2008) -
Deep learning and computer chess
by: Low, Benedict Yu
Published: (2021) -
Deep learning and computer chess (part 1)
by: Pereddy Vijai Krishna Reddy
Published: (2020) -
Deep learning and computer chess (part 2)
by: Xu, Shiguang
Published: (2022) -
Deep learning for computer chess (part 1)
by: Arora, Manav
Published: (2022)