MétaCan
Menu
Back to cohort
Record W1947011871 · doi:10.1109/cig.2015.7317958

Evolvable fashion-based cellular automata for generating cavern systems

2015· article· en· W1947011871 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsCellular automatonAutomatonComputer scienceTheoretical computer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

Cellular automata can be used to rapidly generate complex images. This study introduces fashion-based cellular automata as a new representation for generating cavern-like level maps. Fashion-based automata are defined by a competition matrix that defines the benefit to a given cell state of having a neighbor of each possible cell state. A simple fitness function permits this type of automata to be evolved to produce a variety of level maps. A parameter study is performed and a variety of level maps are evolved with a toroidal grid, ensuring that the level maps tile. The parameter study demonstrates a robustness of the fashion based representation to the variation of parameters. The appearance of a given cavern-like level is encoded in the evolved automaton rule permitting the creation of many levels with a similar character simply by varying initial conditions. The cellular automata rules function in local neighborhoods meaning that the level generation system scales smoothly to any desired level map size.

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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.871
Threshold uncertainty score0.440

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.000
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.043
GPT teacher head0.254
Teacher spread0.211 · 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

Quick stats

Citations26
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207