Cracking the Code of Electronic Games: Some Lessons for Educators
Bibliographic record
Abstract
Background/Context Students’ ready engagement in electronic games and the relative ease with which they sometimes learn complex rules have intrigued some educators and learning researchers. There has been growing interest in studying electronic gaming with the aim of trying to work out how learning principles that are evident in games can be harnessed to make everyday academic learning more engaging and productive. Many studies of students’ learning while gaming have yielded recommendations for teaching and learning in regular classrooms. Purpose/Objective/Research Question/Focus The intent of this work is to describe various ways in which students’ ready engagement in, and quick learning when playing, electronic games have been assumed to provide useful guidance to educators. This goal is pursued by means of analysis of the relevant research and the prescriptions for classroom teaching and learning that have emerged it. Close critical examination of these attempts to infer educational practices from electronic gaming yields three general strategies that have been pursued. The focus of this study has been on evaluating the relative value of these three general strategies. Research Design This is an analytic article that provides a description of an array of attempts to derive educational principles from the perceived success of students’ learning while they are engaged in electronic games, a meta-analytic organization of these attempts into three general categories, and an evaluation of each of these categories’ success in contributing to education or failure to do so. Conclusions/Recommendations The analysis leads to the conclusion that the three main approaches to understanding the connection between gaming and education have included, first, seeing games as teaching desirable learning skills through the simple act of playing; second, a focus on the integration of curriculum content into games; and, third, an effort to abstract learning principles embedded in electronic games and applying these to educational content. Close examination of each of these three approaches in turn leads to the conclusion that the third approach is the one that holds the greatest potential value for educational practice.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.014 | 0.030 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.003 | 0.007 |
| Scholarly communication | 0.008 | 0.017 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.003 | 0.009 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".