Admissible Moves in Two-Player Games
نویسنده
چکیده
Some games have abstract properties that can be used to design admissible heuristics on moves. These admissible heuristics are useful to speed up search. They work well with depth-bounded search algorithms such as Gradual Abstract Proof Search that select moves based on the distance to the goal. We analyze the benefits of these admissible heuristics on moves for rules generation and search. We give experimental results that support our claim for the game of AtariGo.
منابع مشابه
Admissibility in Games with Imperfect Information∗
In this invited paper, we study the concept of admissible strategies for two player win/lose infinite sequential games with imperfect information. We show that in stark contrast with the perfect information variant, admissible strategies are only guaranteed to exist when players have objectives that are closed sets. As a consequence, we also study decision problems related to the existence of a...
متن کاملConcurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independe...
متن کاملInfinite games with uncertain moves
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to t...
متن کاملAllowing two moves in succession increases the game's bias: A theorem
Allowing two moves in succession should not increase the game s bias but it does a seeming paradox Some games are biased in the sense that whoever starts the game has an advantage For example in chess it is widely believed that a player who plays the whites and who therefore has the rst move have an advantage over the player who plays the blacks In such games in some sense each move of the st p...
متن کاملOn Equilibrium Refinement for Discontinuous Games
In moving from finite-action to infinite-action games, standard refinements of the Nash equilibrium concept cease to satisfy certain “natural” properties. For instance, perfect equilibria in compact, continuous games need not be admissible. This paper highlights additional properties of two standard refinement specifications that are not inherited by supersets of the set of finite games. The an...
متن کامل