All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Super Mario A-Star Agent Reloaded

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10511903" target="_blank" >RIV/00216208:11320/25:10511903 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ictai66417.2025.00190" target="_blank" >https://doi.org/10.1109/ictai66417.2025.00190</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ictai66417.2025.00190" target="_blank" >10.1109/ictai66417.2025.00190</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Super Mario A-Star Agent Reloaded

  • Original language description

    For over a decade, the iconic Super Mario Bros. game has been used as a benchmark for research in artificial intelligence (AI) and procedural content generation (PCG). Every PCG technique relies on some sort of level validation to ensure that the generated levels are playable. For this, an artificial agent is used to substitute for a human player. The quality of such an agent directly influences the quality of the work built upon it, as it limits the complexity of levels that can be validated, and its performance affects the size of the generative space that can be explored. In this paper, we present a new Super Mario Bros. agent, which first finds a coarse path over the grid-based abstraction of a game level, and then uses the information to guide an A* search through the simulated states of the game. The proposed agent is the first agent that is able to solve all levels with standard Super Mario Bros. features, while also being the most performant (10x fewer node evaluations needed and 8x faster on the most complex level pack), thus it constitutes a new state-of-the-art for the game and should be used as the new level validation standard. Furthermore, we empirically show that the grid-based search alone can be used for the level validation task with almost the same accuracy as the agent while being faster by two orders of magnitude.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings 2025 IEEE 37th International Conference on Tools with Artificial Intelligence ICTAI 2025

  • ISBN

    979-8-3315-4919-0

  • ISSN

    1082-3409

  • e-ISSN

    2375-0197

  • Number of pages

    8

  • Pages from-to

    1308-1315

  • Publisher name

    Institute of Electrical and Electronics Engineers (IEEE)

  • Place of publication

    New York

  • Event location

    Athens

  • Event date

    Nov 3, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article