A hyperheuristic methodology to generate adaptive strategies for games

Li, Jiawei and Kendall, G. (2017) A hyperheuristic methodology to generate adaptive strategies for games. IEEE Transactions on Computational Intelligence and AI in Games, 9 (1). pp. 1-10. ISSN 1943-0698

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (1MB) | Preview

Abstract

Hyperheuristics have been successfully applied in solving a variety of computational search problems. In this study, we investigate a hyper-heuristic methodology to generate adaptive strategies for games. Based on a set of low-level heuristics (or strategies), a hyper-heuristic game player can generate strategies which adapt to both the behaviour of the co-players and the game dynamics. By using a simple heuristic selection mechanism, a number of existing heuristics for specialised games can be integrated into an automated game player. As examples, we develop hyperheuristic game players for three games: iterated prisoner's dilemma, repeated Goofspiel and the competitive traveling salesmen problem. The results demonstrate that a hyperheuristic game player outperforms the low-level heuristics, when used individually in game playing and it can generate adaptive strategies even if the low-level heuristics are deterministic. This methodology provides an efficient way to develop new strategies for games based on existing strategies.

Item Type: Article
Keywords: Competitive traveling salesmen problem; game; Goofspiel; hyperheuristic; iterated prisoner's dilemma (IPD)
Schools/Departments: University of Nottingham, Malaysia > Faculty of Science > School of Computer Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1109/TCIAIG.2015.2394780
Depositing User: Kendall, Graham
Date Deposited: 06 Feb 2018 15:14
Last Modified: 08 Feb 2018 10:17
URI: http://eprints.nottingham.ac.uk/id/eprint/49531

Actions (Archive Staff Only)

Edit View Edit View