Add to ORKGIn this paper we improve solving two-player games by com-puting 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 effi-ciently 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 so-lution is strong, while for the opening phase Gasser only pro-vided a weak solution
In many games, the machine has become stronger than the best human players. Machines have already be...
Quantitative games, where quantitative objectives are defined on weighted game arenas, provide natur...
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithm...
In this paper we improve solving two-player games by computing the game-theoretical value of every r...
In this paper, we propose an efficient method of solving one- and two-player combinato-rial games by...
This paper exploits parallel computing power of graphics cards to accelerate state space search. We ...
Although the graphics processing unit (GPU) was originally designed to accelerate the image creation...
The leading approach for solving large imperfect-information games is automated abstraction followed...
AbstractWe introduce an alternative concept to determine the solvability of two-player games with pe...
In this paper optimal state space planning is parallelized by exploiting the processing power of a g...
Abstract. Although the graphics processing unit (GPU) was originally designed to accelerate the imag...
Two-player graph games have found numerous applications, most notably in the synthesis of reactive s...
Parity games are two-player zero-sum games of infinite duration played on finite graphs for which no...
Abstract: Game tree search is a classical problem in the field of game theory and artificial intelli...
This paper presents the use of GPU as a math co-processor in real-time applications, in special game...
In many games, the machine has become stronger than the best human players. Machines have already be...
Quantitative games, where quantitative objectives are defined on weighted game arenas, provide natur...
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithm...
In this paper we improve solving two-player games by computing the game-theoretical value of every r...
In this paper, we propose an efficient method of solving one- and two-player combinato-rial games by...
This paper exploits parallel computing power of graphics cards to accelerate state space search. We ...
Although the graphics processing unit (GPU) was originally designed to accelerate the image creation...
The leading approach for solving large imperfect-information games is automated abstraction followed...
AbstractWe introduce an alternative concept to determine the solvability of two-player games with pe...
In this paper optimal state space planning is parallelized by exploiting the processing power of a g...
Abstract. Although the graphics processing unit (GPU) was originally designed to accelerate the imag...
Two-player graph games have found numerous applications, most notably in the synthesis of reactive s...
Parity games are two-player zero-sum games of infinite duration played on finite graphs for which no...
Abstract: Game tree search is a classical problem in the field of game theory and artificial intelli...
This paper presents the use of GPU as a math co-processor in real-time applications, in special game...
In many games, the machine has become stronger than the best human players. Machines have already be...
Quantitative games, where quantitative objectives are defined on weighted game arenas, provide natur...
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithm...