Parallel Minimax Tree Searching on GPU

  • Kamil Rocki
  • Reiji Suda
Conference paper

DOI: 10.1007/978-3-642-14390-8_47

Volume 6067 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Rocki K., Suda R. (2010) Parallel Minimax Tree Searching on GPU. In: Wyrzykowski R., Dongarra J., Karczewski K., Wasniewski J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6067. Springer, Berlin, Heidelberg

Abstract

The paper describes results of minimax tree searching algorithm implemented within CUDA platform. The problem regards move choice strategy in the game of Reversi. The parallelization scheme and performance aspects are discussed, focusing mainly on warp divergence problem and data transfer size. Moreover, a method of minimizing warp divergence and performance degradation is described. The paper contains both the results of test performed on multiple CPUs and GPUs. Additionally, it discusses αβ parallel pruning implementation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kamil Rocki
    • 1
  • Reiji Suda
    • 1
  1. 1.JST CREST, Department of Computer Science, Graduate School of Information Science and TechnologyThe University of TokyoTokyoJapan