Paper Info
Title
Symbolic Classification of General Two-Player Games
Abstract
In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player games with general rewards according to the Game Description Language. We will show that it classifies all states using a linear number of images concerning the depth of the game graph. We also present an extension that uses this algorithm to create symbolic endgame databases and then performs UCT to find an estimate for the classification of the game.
Year
DOI
Venue
2008
10.1007/978-3-540-85845-4_23
KI
Keywords
Field
DocType
optimal play,two-player game,game graph,general reward,game description language,symbolic endgame databases,symbolic classification,general two-player games,linear number,new symbolic algorithm
Graph,Game description language,Symbolic algorithm,Chess endgame,Theoretical computer science,Sequential game,Mathematics
Conference
Volume
ISSN
Citations 
5243
0302-9743
12
PageRank 
References 
Authors
0.72
8
2
Name
Order
Citations
PageRank
Stefan Edelkamp11557125.46
Peter Kissmann218113.93