DISTANCE FEATURES FOR GENERAL GAME PLAYING AGENTS

Daniel Michulke, Stephan Schiffel

2012

Abstract

General Game Playing (GGP) is concerned with the development of programs that are able to play previously unknown games well. The main problem such a player is faced with is to come up with a good heuristic evaluation function automatically. Part of these heuristics are distance measures used to estimate, e.g., the distance of a pawn towards the promotion rank. However, current distance heuristics in GGP are based on too specific detection patterns as well as expensive internal simulations, they are limited to the scope of totally ordered domains and/or they apply a uniform Manhattan distance heuristics regardless of the move pattern of the object involved. In this paper we describe a method to automatically construct distance measures by analyzing the game rules. The presented method is an improvement to all previously presented distance estimation methods, because it is not limited to specific structures, such as, Cartesian game boards. Furthermore, the constructed distance measures are admissible. We demonstrate how to use the distance measures in an evaluation function of a general game player and show the effectiveness of our approach by comparing with a state-of-the-art player.

References

  1. Bonet, B. and Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33.
  2. Clune, J. (2007). Heuristic evaluation functions for general game playing. In AAAI, Vancouver. AAAI Press.
  3. Hoffmann, J. and Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302.
  4. Kaiser, D. M. (2007). Automatic feature extraction for autonomous general game playing agents. In Proceedings of the Sixth Intl. Joint Conf. on Autonomous Agents and Multiagent Systems.
  5. Kissmann, P. and Edelkamp, S. (2010). Instantiating general games using prolog or dependency graphs. In Dillmann, R., Beyerer, J., Hanebeck, U. D., and Schultz, T., editors, KI, volume 6359 of Lecture Notes in Computer Science, pages 255-262. Springer.
  6. Kuhlmann, G., Dresner, K., and Stone, P. (2006). Automatic Heuristic Construction in a Complete General Game Player. In Proceedings of the Twenty-First National Conference on Artificial Intelligence, pages 1457-62, Boston, Massachusetts, USA. AAAI Press.
  7. Love, N., Hinrichs, T., Haley, D., Schkufza, E., and Genesereth, M. (2008). General game playing: Game description language specification. Technical Report March 4, Stanford University. The most recent version should be available at http://games.stanford.edu/.
  8. Pell, B. (1993). Strategy generation and evaluation for meta-game playing. PhD thesis, University of Cambridge.
  9. Schiffel, S. and Thielscher, M. (2007). Fluxplayer: A successful general game player. In Proceedings of the National Conference on Artificial Intelligence, pages 1191-1196, Vancouver. AAAI Press.
  10. Schiffel, S. and Thielscher, M. (2009a). Automated theorem proving for general game playing. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).
  11. Schiffel, S. and Thielscher, M. (2009b). A multiagent semantics for the game description language. In Filipe, J., Fred, A., and Sharp, B., editors, International Conference on Agents and Artificial Intelligence (ICAART), Porto. Springer.
Download


Paper Citation


in Harvard Style

Michulke D. and Schiffel S. (2012). DISTANCE FEATURES FOR GENERAL GAME PLAYING AGENTS . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 127-136. DOI: 10.5220/0003744001270136


in Bibtex Style

@conference{icaart12,
author={Daniel Michulke and Stephan Schiffel},
title={DISTANCE FEATURES FOR GENERAL GAME PLAYING AGENTS},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={127-136},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003744001270136},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - DISTANCE FEATURES FOR GENERAL GAME PLAYING AGENTS
SN - 978-989-8425-95-9
AU - Michulke D.
AU - Schiffel S.
PY - 2012
SP - 127
EP - 136
DO - 10.5220/0003744001270136