{'fraction_non_alphanumeric': 0.018442622950819672, 'fraction_numerical': 0.0, 'mean_word_length': 5.601351351351352, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Implementation of Parallel Game Tree Search on a SIMD System

The α-β algorithm is an efficient technique for searching game trees. In this paper, we present the detailed implementation of parallel α-β algorithm on our Engineering and Scientific Computation Accelerator (ESCA) system, which is a heterogeneous multi-core SIMD (Single Instruction stream Multiple Data stream) architecture to accelerate the compute-intensive parallel computing in high performance applications and has enhanced for control organization. The conditional execution provided by ESCA has significant benefit to implement the α-β pruning, and the communication mechanism between the control unit and PEs (processing elements) can accumulate information for load balancing to gain better processor utilization. We choose synthetic game tree for the evaluation and the experimental results with the metric of speedup are presented with varied number of processing elements under various size of trees.