GPU exploration of two-player games with perfect hash functions

Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Volumn , Issue , 2010, Pages 23-30

  Edelkamp, Stefan ^a   Sulewski, Damian ^a   Yücel, Cengizhan ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CO-PROCESSORS; GRAPHICS CARD; GRAPHICS PROCESSING UNIT; SOLUTION PROCESS; TWO-PLAYER GAMES; WEAK SOLUTION;

COMPUTER GRAPHICS; GAME THEORY; HASH FUNCTIONS; PERSONAL COMPUTERS; PROGRAM PROCESSORS;

COMPUTER GRAPHICS EQUIPMENT;

EID: 84893398176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Bloom, B. H. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7):422-426.
2. Bryant, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35:677-691.
3. Cooperman, G., and Finkelstein, L. 1992. New methods for using Cayley graphs in interconnection networks. Discrete Appl. Math. 37-38:95-118.
4. Edelkamp, S.; Sulewski, D.; and Yücel, C. 2010. Perfect hashing for state space exploration on the GPU. In ICAPS, 57-64.
5. Eickmann, U. 2007. Untersuchung der Echtzeitfähigkeit von Budget-Grafikkarten. München: Grin Verlag.
6. Gasser, R. 1996. Solving Nine Men's Morris. Computational Intelligence 12:24-41.
7. Göddeke, D.; Strzodka, R.; Mohd-Yusof, J.; McCormick, P.; Wobker, H.; Becker, C.; and Turek, S. 2008. Using GPUs to improve multigrid solver performance on a cluster. International Journal of Computational Science and Engineering 4(1):36-55.
8. Knuth, D. E. 1998. Art of Computer Programming, Volume 3: Sorting and Searching. Redwood City: Addison-Wesley Professional, 3rd edition.
9. Korf, R. E., and Schultze, T. 2005. Large-scale parallel breadth-first search. In AAAI, 1380-1385.
10. Korf, R. E., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In AAAI, 910-916.
11. Korf, R. E. 1999. Divide-and-conquer bidirectional search: First results. In IJCAI, 1184-1189.
12. Korf, R. E. 2008. Minimizing disk I/O in two-bit-breath-first search. In AAAI, 317-324.
13. Lake, R.; Schaeffer, J.; and Lu, P. 1993. Solving large retrograde analysis problems using a network of workstations. Technical Report 93-13, Department of Computing Science, University of Alberta.
14. Mares, M., and Straka, M. 2007. Linear-time ranking of permutations. In ESA, volume 4698 of LNCS, 187-193.
15. Myrvold, W., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79(6):281-284.
16. NVIDIA. 2008. CUDA Programming Guide 2.0. http://developer.download. nvidia.com/ compute/cuda/2-0/docs/NVIDIA-CUDA% -Programming-Guide-2.0.pdf.
17. Owens, J. D.; Luebke, D.; Govindaraju, N.; Harris, M.; Krüger, J.; Lefohn, A. E.; and Purcell, T. J. 2007. A survey of general-purpose computation on graphics hardware. Computer Graphics Forum 26(1):80-113.
18. Romein, J. W., and Bal, H. E. 2003. Solving Awari with parallel retrograde analysis. Computer 36(10):26-33.
19. Silberstein, M.; Schuster, A.; Geiger, D.; Patney, A.; and Owens, J. D. 2008. Efficient computation of sum-products on GPUs through software-managed cache. In 22nd International Conference on Supercomputing, 309-318.