摘要: We propose two parallel UCT search (Upper Confidence bounds applied to Trees) algorithms that take advantage of modern GPU hardware. Experiments using the game Ataxx are conducted, and algorithm's speed playing strength is compared sequential running on CPU Block Parallel runs its simulations a GPU. Empirical results show our proposed Multiblock algorithm outperforms other approaches can hardware without added complexity searching multiple trees.