GPU Exploration of Two-Player Games with Perfect Hash Functions
نویسندگان
چکیده
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-MenMorris is a draw on a personal computer. Moreover, our solution is strong, while for the opening phase Gasser only provided a weak solution.
منابع مشابه
Perfect Hashing for State Space Exploration on the GPU
This paper exploits parallel computing power of graphics cards to accelerate state space search. We illustrate that modern graphics processing units (GPUs) have the potential to speed up breadth-first search significantly. For a bitvector representation of the search frontier, GPU algorithms with one and two bits per state are presented. Efficient perfect hash functions and their inverse are ex...
متن کاملParallel State Space Search on the GPU
This paper exploits parallel computing power of the graphics card for the enhanced enumeration of state spaces. We illustrate that modern graphics processing units (GPUs) have the potential to speed up state space search significantly. For an bitvector representation of the search frontier, GPU algorithms with one and two bits per state are presented. For enhanced compression efficient perfect ...
متن کاملTwo-player Non-zero-sum Games: a Reduction
In this chapter, we focus on finite two-player non-zero-sum stochastic games. Following the notations used in earlier chapters, we let S be the state space, and A and B be the action sets of players 1 and 2 respectively. All three sets S,A and B are finite. Generic elements of S, A and B will be denoted by z, a and b. We let p(·|z, a, b) be the transition function of the game and r : S × A× B →...
متن کاملExistence of Secure Equilibrium in Multi-player Games with Perfect Information
Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically developed for assume-guarantee synthesis and has already been applied in this context. Yet, not much is known about its existence in games with more than two ...
متن کاملAnalysing the Performance of GPU Hash Tables for State Space Exploration
In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led to a significant speed-up is model checking. In model checking, state spaces, i.e., large directed graphs, are explored to verify whether models satisfy desirable properties. GPUEXPLORE is a GPU-based model checker tha...
متن کامل