MétaCan
Menu
Back to cohort
Record W1522634567

A Reusable Scripting Engine for Automating Cinematics and Cut-Scenes in Video Games

2007· article· en· W1522634567 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueLoading... · 2007
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsWestern University
Fundersnot available
KeywordsScripting languageComputer scienceStorytellingProgrammerProcess (computing)MultimediaAnimationWorld Wide WebSoftware engineeringNarrativeProgramming languageComputer graphics (images)
DOInot available

Abstract

fetched live from OpenAlex

Storytelling can play a critical role in the success of modern video games. Unfortunately, it can often be quite difficult for storytellers to directly craft content for games, typically requiring them to work with programmers to implement story elements. This needlessly complicates the development process, straining scarce resources while potentially hampering creativity and story quality at the same time. As a result, supports and tools are necessary to enable storytellers to generate story content for games directly, with minimal programming or programmer assistance required, if any. This paper introduces a Reusable Scripting Engine to automate the generation of cinematics and cut-scenes in video games. This approach allows storytellers to provide their stories in a well-defined, structured format, which is then interpreted by our engine, along with supplemental graphic and audio content, to produce an animated presentation of the story in an automated fashion. This paper presents the design of our Reusable Scripting Engine, and discusses a prototype implementation of this design, as well as initial experiences with using this prototype system to date.

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.

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.001
metaresearch head score (Gemma)0.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.858
Threshold uncertainty score0.558

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.030
GPT teacher head0.300
Teacher spread0.271 · 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