Decomposition of Multi-player Games

Authors:
Dengji Zhao;Stephan Schiffel;Michael Thielscher
Affiliations:
Intelligent Systems Laboratory, University of Western Sydney, Australia;Department of Computer Science, Dresden University of Technology, Germany;Department of Computer Science, Dresden University of Technology, Germany
Venue:
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Year:
2009

Citing 7
Cited 2

Automatic heuristic construction in a complete general game player

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Factored planning: how, when, and when not

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Heuristic evaluation functions for general game playing

AAAI'07 Proceedings of the 22nd 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
Factored planning using decomposition trees

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Factored planning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Translating general game descriptions into an action language

Logic programming, knowledge representation, and nonmonotonic reasoning
General game playing in AI research and education

KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Research in General Game Playing aims at building systems that learn to play unknown games without human intervention. We contribute to this endeavour by generalising the established technique of decomposition from AI Planning to multi-player games. To this end, we present a method for the automatic decomposition of previously unknown games into independent subgames, and we show how a general game player can exploit a successful decomposition for game tree search.