5772

Parallel Game Tree Search Using GPU

L’ubomir Lackovic
Institute of Informatics and Software Engineering, Faculty of Informatics and Information Technologies, Slovak University of Technology in Bratislava, Ilkovicova 3, 842 16 Bratislava, Slovakia
Informational Sciences and Technologies, Bulletin of the ACM Slovakia, Volume 3, Number 2, 2011

@article{lackovic2011parallel,

   title={Parallel Game Tree Search Using GPU},

   author={Lackovic, L.},

   year={2011}

}

Download Download (PDF)   View View   Source Source   

879

views

Parallel performance of graphics cards in desktop computers generally outreaches performance of conventional processors. The purpose of this paper is to identify possibilities of tasks parallelization when searching and evaluating game trees and to propose algorithms that would perform better on SIMD processors of graphics cards than on regular desktop processors. On proposed algorithms’ basis are created two prototypes that implement game tree search of game Czech draughts. Performance of these prototypes is compared in different levels of game tree on various compute devices. Implemented algorithm achieves approximately two to three times better performance using graphics card against conventional quad-core processor.
Rating: 2.5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: