Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
One Jump Ahead: Computer Perfection at Checkers
One Jump Ahead: Computer Perfection at Checkers
Automatic heuristic construction in a complete general game player
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Fluxplayer: a successful general game player
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Simulation-based approach to general game playing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
| Hi-index | 0.00 |
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.