Similarity Measures based on Local Game Trees

02/25/2019
by   Sabrina Evans, et al.
0

We study strategic similarity of game positions in two-player extensive games of perfect information, by looking at the structure of their local game trees, with the aim of improving the performance of game playing agents in detecting forcing continuations. We present a range of measures over the induced game trees and compare them against benchmark problems in chess, observing a promising level of accuracy in matching up trap states.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2021

Well-Founded Extensive Games with Perfect Information

We consider extensive games with perfect information with well-founded g...
research
12/31/2020

Formal Game Grammar and Equivalence

We develop methods to formally describe and compare games, in order to p...
research
05/27/2022

Improving Bidding and Playing Strategies in the Trick-Taking game Wizard using Deep Q-Networks

In this work, the trick-taking game Wizard with a separate bidding and p...
research
11/07/2018

On the Complexity of Reconnaissance Blind Chess

This paper provides a complexity analysis for the game of reconnaissance...
research
03/29/2019

A Local Approach to Forward Model Learning: Results on the Game of Life Game

This paper investigates the effect of learning a forward model on the pe...
research
09/01/2022

EvolvingBehavior: Towards Co-Creative Evolution of Behavior Trees for Game NPCs

To assist game developers in crafting game NPCs, we present EvolvingBeha...
research
11/16/2011

A Bayesian Model for Plan Recognition in RTS Games applied to StarCraft

The task of keyhole (unobtrusive) plan recognition is central to adaptiv...

Please sign up or login with your details

Forgot password? Click here to reset