Monte mario: Platforming with MCTS

Emil Juul Jacobsen, Rasmus Greve, Julian Togelius

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

    Abstract

    Monte Carlo Tree Search (MCTS) is applied to control the player character in a clone of the popular platform game Su- per Mario Bros. Standard MCTS is applied through search in state space with the goal of moving the furthest to the right as quickly as possible. Despite parameter tuning, only moderate success is reached. Several modifications to the algorithm are then introduced specifically to deal with the behavioural pathologies that were observed. Two of the modifications are to our best knowledge novel. A combination of these modifications is found to lead to almost perfect play on linear levels. Furthermore, when adding noise to the benchmark, MCTS outperforms the best known algorithm for these levels. The analysis and algorithmic innovations in this paper are likely to be useful when applying MCTS to other video games.

    Original languageEnglish (US)
    Title of host publicationGECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference
    PublisherAssociation for Computing Machinery
    Pages293-300
    Number of pages8
    ISBN (Print)9781450326629
    DOIs
    StatePublished - 2014
    Event16th Genetic and Evolutionary Computation Conference, GECCO 2014 - Vancouver, BC, Canada
    Duration: Jul 12 2014Jul 16 2014

    Other

    Other16th Genetic and Evolutionary Computation Conference, GECCO 2014
    CountryCanada
    CityVancouver, BC
    Period7/12/147/16/14

    Fingerprint

    Search Trees
    Pathology
    Tuning
    Innovation
    Video Games
    Parameter Tuning
    Clone
    State Space
    Likely
    Game
    Benchmark

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this

    Jacobsen, E. J., Greve, R., & Togelius, J. (2014). Monte mario: Platforming with MCTS. In GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference (pp. 293-300). Association for Computing Machinery. https://doi.org/10.1145/2576768.2598392

    Monte mario : Platforming with MCTS. / Jacobsen, Emil Juul; Greve, Rasmus; Togelius, Julian.

    GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2014. p. 293-300.

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

    Jacobsen, EJ, Greve, R & Togelius, J 2014, Monte mario: Platforming with MCTS. in GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, pp. 293-300, 16th Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, 7/12/14. https://doi.org/10.1145/2576768.2598392
    Jacobsen EJ, Greve R, Togelius J. Monte mario: Platforming with MCTS. In GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery. 2014. p. 293-300 https://doi.org/10.1145/2576768.2598392
    Jacobsen, Emil Juul ; Greve, Rasmus ; Togelius, Julian. / Monte mario : Platforming with MCTS. GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2014. pp. 293-300
    @inproceedings{b4cea88935864b87911b4121e118241c,
    title = "Monte mario: Platforming with MCTS",
    abstract = "Monte Carlo Tree Search (MCTS) is applied to control the player character in a clone of the popular platform game Su- per Mario Bros. Standard MCTS is applied through search in state space with the goal of moving the furthest to the right as quickly as possible. Despite parameter tuning, only moderate success is reached. Several modifications to the algorithm are then introduced specifically to deal with the behavioural pathologies that were observed. Two of the modifications are to our best knowledge novel. A combination of these modifications is found to lead to almost perfect play on linear levels. Furthermore, when adding noise to the benchmark, MCTS outperforms the best known algorithm for these levels. The analysis and algorithmic innovations in this paper are likely to be useful when applying MCTS to other video games.",
    author = "Jacobsen, {Emil Juul} and Rasmus Greve and Julian Togelius",
    year = "2014",
    doi = "10.1145/2576768.2598392",
    language = "English (US)",
    isbn = "9781450326629",
    pages = "293--300",
    booktitle = "GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference",
    publisher = "Association for Computing Machinery",

    }

    TY - GEN

    T1 - Monte mario

    T2 - Platforming with MCTS

    AU - Jacobsen, Emil Juul

    AU - Greve, Rasmus

    AU - Togelius, Julian

    PY - 2014

    Y1 - 2014

    N2 - Monte Carlo Tree Search (MCTS) is applied to control the player character in a clone of the popular platform game Su- per Mario Bros. Standard MCTS is applied through search in state space with the goal of moving the furthest to the right as quickly as possible. Despite parameter tuning, only moderate success is reached. Several modifications to the algorithm are then introduced specifically to deal with the behavioural pathologies that were observed. Two of the modifications are to our best knowledge novel. A combination of these modifications is found to lead to almost perfect play on linear levels. Furthermore, when adding noise to the benchmark, MCTS outperforms the best known algorithm for these levels. The analysis and algorithmic innovations in this paper are likely to be useful when applying MCTS to other video games.

    AB - Monte Carlo Tree Search (MCTS) is applied to control the player character in a clone of the popular platform game Su- per Mario Bros. Standard MCTS is applied through search in state space with the goal of moving the furthest to the right as quickly as possible. Despite parameter tuning, only moderate success is reached. Several modifications to the algorithm are then introduced specifically to deal with the behavioural pathologies that were observed. Two of the modifications are to our best knowledge novel. A combination of these modifications is found to lead to almost perfect play on linear levels. Furthermore, when adding noise to the benchmark, MCTS outperforms the best known algorithm for these levels. The analysis and algorithmic innovations in this paper are likely to be useful when applying MCTS to other video games.

    UR - http://www.scopus.com/inward/record.url?scp=84905715070&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84905715070&partnerID=8YFLogxK

    U2 - 10.1145/2576768.2598392

    DO - 10.1145/2576768.2598392

    M3 - Conference contribution

    AN - SCOPUS:84905715070

    SN - 9781450326629

    SP - 293

    EP - 300

    BT - GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference

    PB - Association for Computing Machinery

    ER -