Name
Abstract | ||
|---|---|---|
This paper proposes two ways to instantiate general games specified in the game description language GDL to enhance exploration efficiencies of existing players. One uses Prolog's inference mechanism to find supersets of reachable atoms and moves; the other one utilizes dependency graphs, a datastructure that can calculate the dependencies of the arguments of predicates by evaluating the various formulas from the game's description. |
Year | Venue | Keywords |
|---|---|---|
2010 | KI | inference mechanism,exploration efficiency,reachable atom,general game,various formula,utilizes dependency graph,game description language gdl |
Field | DocType | Volume |
Graph,Game description language,Inference,Computer science,Disjunctive normal form,Theoretical computer science,Prolog,Predicate (grammar),Dependency graph | Conference | 6359 |
ISSN | ISBN | Citations |
0302-9743 | 3-642-16110-3 | 8 |
PageRank | References | Authors |
0.77 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Kissmann | 1 | 181 | 13.93 |
| Stefan Edelkamp | 2 | 1557 | 125.46 |