Parallel Minimax Tree Searching on GPU-Reference-Cited by-同舟云学术

Parallel Minimax Tree Searching on GPU

Published:2010 Issue: Volume: Page:449-456
ISSN:0302-9743
Container-title:Parallel Processing and Applied Mathematics
language:
Short-container-title:

Author:

Rocki Kamil,Suda Reiji

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14390-8_47.pdf

Reference10 articles.

1. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence 6, 293–326 (1975)

2. Manohararajah, V.: Parallel Alpha-Beta Search on Shared Memory Multiprocessors, Master Thesis, Graduate Department of Electrical and Computer Engineering, University of Toronto (2001)

3. Warren, H.S.: Hacker’s Delight. Addison-Wesley, Reading (2002)

4. Schaeffer, J.: Improved Parallel Alpha Beta Search. In: Proceedings of 1986 ACM Fall Joint Computer Conference (1986)

5. Borovska, P., Lazarova, M.: Efficiency of Parallel Minimax Algorithm for Game Tree Search. In: Proceedings of the International Conference on Computer Systems and Technologies (2007)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers;INFORMS Journal on Computing;2022-09

2. Application and optimization of the UCT algorithm in Einstein würfelt nicht!;2022 34th Chinese Control and Decision Conference (CCDC);2022-08-15

3. IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems;Concurrency and Computation: Practice and Experience;2016-10-25

4. A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems;Algorithms and Architectures for Parallel Processing;2016