MétaCan
Menu
Back to cohort

Automated Difficulty Assessment Model for Platformer Games: A Comprehensive Approach

2023· article· en· W4391096910 on OpenAlexaff
Yannick Francillette, Hugo Tremblay, Bruno Bouchard, Simon Lescieux, Mathis Rozon, Jules Linard

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsUniversité du Québec à Chicoutimi
Fundersnot available
KeywordsComputer scienceAdversaryGRASPSet (abstract data type)Process (computing)Game mechanicsHuman–computer interactionVideo gameSoftwareGame designGame theoryPresentation (obstetrics)Artificial intelligenceSoftware engineeringProgramming languageMultimediaComputer securityMathematical economics

Abstract

fetched live from OpenAlex

In general, a video game offers a seamless progression in gameplay difficulty, starting with easy levels that allow players to grasp the basic mechanics of the game, and gradually introducing more challenging obstacles as they progress. The success of a game title heavily relies on its ability to provide a wellbalanced difficulty curve and a satisfying sense of progression. Designing a game entails a complex and time-consuming process that involves extensive playtesting. One promising approach to address this challenge is the utilization of software tools capable of automatically evaluating the difficulty of game levels. In this paper, we present a comprehensive model for automatically assessing the difficulty levels of platformer games. Our model is based on the formal calculation of static danger zones within levels and the analysis of enemy movement patterns using simulated pheromones. To validate our model, we implemented it and conducted tests using the complete set of levels from the original Super Mario Bros. game. The paper includes a detailed presentation of the model, the tools developed, and a comparative analysis showcasing the computed results.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.576
Threshold uncertainty score0.616

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.112
GPT teacher head0.364
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicArtificial Intelligence in GamesFrench-language works237,207