Proceedings of the International Symposium on Combinatorial Search · 2010 · 12 citations · 17 references
ComputingComputer ScienceHigh-performance ComputingComputer GraphicsGame TheoryParallel ComputingData ParallelismGraphics Processing Unit ArchitectureGraphics Processing Unit ComputingGraphics Processing UnitsHardware AccelerationHash FunctionsComputational Game TheoryGame Value ComputationGpgpu ComputingGpu AcceleratorsGpu Parallel AlgorithmsGpu Programming ModelsOrdinal RepresentationTwo-player Games
In this paper we improve solving two-player games by computing the game-theoretical value of every reachable state. A graphics processing unit located on the graphics card is used as a co-processor to accelerate the solution process. We exploit perfect hash functions to store the game states efficiently in memory and to transfer their ordinal representation between the host and the graphics card. As an application we validate Gasser's results that Nine-Men-Morris is a draw on a personal computer. Moreover, our solution is strong, while for the opening phase Gasser only provided a weak solution.
17
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
A Survey of General‐Purpose Computation on Graphics Hardware
John D. Owens, David Luebke, Naga K. Govindaraju et al. · Computer Graphics Forum · 2007 · 2K citations
Graph-based algorithms for Boolean function manipulation
KiltHub Repository · 2018 · 254 citations · Full text