.png){kind=icon}
返回
A Parallel Algorithm for Game Tree Search Using GPGPU
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2014.2345054.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Game tree search is a classical problemin the field of game theory and artificial intelligence. Fast game tree search algorithm is critical for computer games asking for real-time responses. In this paper, we focus on how to leverage massive parallelism capabilities of GPU to accelerate the speed of game tree search algorithms and propose a concise and general parallel game tree search algorithm on GPU. The performance model of our algorithm is presented and analyzed theoretically. We implement the algorithm for two real computer games called Connect6 and Chess. We also use these two games to verify the effectiveness and efficiency of our algorithm. Experiments support our theoretical results and show good performance of our approach. Compared to classical CPU-based game tree search algorithms, our algorithm can achieve speedups of 89.95x for Connect6 and 11.43x for Chess, in case of no pruning. When pruning is considered, which means the practical performance of our algorithm, the speedup can reach about 10.58x for Connect6 and 7.26x for Chess. The insight of our work is that using GPU is a feasible way to improve the performance of game tree search algorithms.
Keyword:
Parallel computing
GPU
game tree search
alpha-beta pruning
Conect6
Chess
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
分享收藏Multilayer silicone phantoms for the evaluation of quantitative optical techniques in skin imaging
PREAI
分享收藏分享收藏分享收藏
查看更多内容