Hyper-heuristic general video game playing

Andre Mendes, Julian Togelius, Andy Nealen

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    In general video game playing, the challenge is to create agents that play unseen games proficiently. Stochastic tree search algorithms, like Monte Carlo Tree Search, perform relatively well on this task. However, performance is non-transitive: different agents perform best in different games, which means that there is not a single agent that is the best in all the games. Rather, some types of games are dominated by a few agents whereas other different agents dominate other types of games. Thus, it should be possible to construct a hyper-agent that selects from a portfolio, in which constituent sub-agents will play a new game best. Since there is no knowledge about the games, the agent needs to use available features to predict the most suitable algorithm. This work constructs such a hyper-agent using the General Video Game Playing Framework (GVGAI). The proposed method achieves promising results that show the applicability of hyper-heuristics in general video game playing and related tasks.

    Original languageEnglish (US)
    Title of host publication2016 IEEE Conference on Computational Intelligence and Games, CIG 2016
    PublisherIEEE Computer Society
    ISBN (Electronic)9781509018833
    StatePublished - Jul 2 2016
    Event2016 IEEE Conference on Computational Intelligence and Games, CIG 2016 - Santorini, Greece
    Duration: Sep 20 2016Sep 23 2016

    Publication series

    NameIEEE Conference on Computatonal Intelligence and Games, CIG
    ISSN (Print)2325-4270
    ISSN (Electronic)2325-4289


    Other2016 IEEE Conference on Computational Intelligence and Games, CIG 2016

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Computer Graphics and Computer-Aided Design
    • Computer Vision and Pattern Recognition
    • Human-Computer Interaction
    • Software

    Cite this