MétaCan
Menu
Back to cohort
Record W2205300805 · doi:10.1609/aiide.v9i1.12609

Scythe AI: A Tool for Modular Reuse of Game AI

2013· article· en· W2205300805 on OpenAlexaff
Christopher Dragert, Jörg Kienzle, Clark Verbrugge

Bibliographic record

VenueProceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · 2013
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsMcGill University
Fundersnot available
KeywordsModular designReuseComputer scienceSoftware engineeringProcess (computing)Artificial intelligenceProgramming languageHuman–computer interactionEngineering

Abstract

fetched live from OpenAlex

Scythe AI is a tool designed for game AI developers to enable modular reuse of NPC AI. In this demonstration, we show how Scythe AI can be used to compose and manage statechart-based AI-Modules to produce new AIs for a target game. The tool includes a streamlined importing process to introduce new modules, library management of modules, an error and warning system to assist in new AI construction, and can export directly to a defined target game.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.021
Threshold uncertainty score0.071

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0030.005
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0210.006

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.033
GPT teacher head0.280
Teacher spread0.247 · 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 source (direct Gemma or distilled Codex), 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

Citations0
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital EntertainmentSame topicReinforcement Learning in RoboticsFrench-language works237,207