Please use this identifier to cite or link to this item:
Title: Game tree search on a massively parallel SIMD machine : an algorithmic study with computer chess
Authors: He, Shaojun.
Keywords: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Issue Date: 1998
Abstract: 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 usually present in a SIMD game tree search, a new load balancing scheme is proposed as a part of this algorithm which provides massive parallelism whilst being in control of the search overhead. Besides, a dynamic triggering mechanism that is especially suited for a complex game such as Chess is used to optimally balance the search and load balancing. Furthermore, a search procedure with useful heuristic enhancements is designed in detail to reduce the search overhead and the synchronization overhead.
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
Main report15.45 MBAdobe PDFView/Open

Page view(s) 50

Updated on Oct 3, 2023


Updated on Oct 3, 2023

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.