Enregistré dans:
Détails bibliographiques
Auteur principal: Lafourcade, Pierre
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:https://arxiv.org/abs/2401.09449
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911759767437312
author Lafourcade, Pierre
author_facet Lafourcade, Pierre
contents We study the problem of optimal games for the solo and coop modes of the board game Room 25 (season 1). We show that the game cannot be won in a single turn for any starting configuration, but that it can be done in two for some configurations. We introduce an opening that wins in two turns with enough luck, while having a low probability of losing immediately. We then show that the game can be won in a single turn if the game's rules are slightly modified, although the probability of winning then becomes substantially lower than in the two-turn strategy. At last, we show that if the players are maximally unlucky, they will lose regardless of their strategy.
format Preprint
id arxiv_https___arxiv_org_abs_2401_09449
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Optimal games in Room 25 solo and coop modes
Lafourcade, Pierre
Computer Science and Game Theory
We study the problem of optimal games for the solo and coop modes of the board game Room 25 (season 1). We show that the game cannot be won in a single turn for any starting configuration, but that it can be done in two for some configurations. We introduce an opening that wins in two turns with enough luck, while having a low probability of losing immediately. We then show that the game can be won in a single turn if the game's rules are slightly modified, although the probability of winning then becomes substantially lower than in the two-turn strategy. At last, we show that if the players are maximally unlucky, they will lose regardless of their strategy.
title Optimal games in Room 25 solo and coop modes
topic Computer Science and Game Theory
url https://arxiv.org/abs/2401.09449