A Probabilistic Analysis of Simplified Cluedo with Storm: The Birthday Cake Case
Bibliographic record
Abstract
We present a family of probabilistic models of a simplified version of the Cluedo game. In this version of the game, instead of a murder happening, a birthday cake has mysteriously disappeared. The aim of the game is to guess, from the clues that each player will collect while playing, what happened to the cake. The winner is the player that first guesses who has eaten the cake and the room where this has happened. We implemented several probabilistic models of the game encoding different playing strategies as Markov Decision Processes in the Prism language. We investigate these strategies by comparing their effectiveness in winning the game using the Prism and Storm probabilistic model checkers. In particular, we use Prism for statistical results and Storm for exact computation. Since the generated state space is in general huge, we limit our models to only two players resulting in almost 15 billion states to check. We believe that this benchmark could serve to further improve the current state-of-the-art probabilistic model checking.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
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 teacher head, 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".