Combinatorial games played randomly: Chomp and nim

Combinatorial games played randomly: Chomp and nim

In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Devlin, Pat, Trifonova, Paulina
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Devlin, Pat
Trifonova, Paulina
description In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position.
doi_str_mv 10.48550/arxiv.2401.16670
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2401_16670</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2401_16670</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-e5a7687505d9ab232812887a528562907d9b956940113179e045bdba3d15532b3</originalsourceid><addsrcrecordid>eNotzr1OwzAYhWEvDCj0ApjwDST4J59_2FBEC1KlLtmjz7IBS3ESOVVF7p407XR0llcPIc-cVbUBYK-Y_-KlEjXjFVdKs0cimjG5OOB5zBF7-oMpzHTqcQmeZhz8mPrljTa_Y5roeukQ0xN5-MZ-Drv7FqTdf7TNZ3k8Hb6a92OJa7kMgFoZDQy8RSekMFwYoxGEASUs0946C8quFi65toHV4LxD6TmAFE4W5OWW3dDdlGPCvHRXfLfh5T80bzyk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Combinatorial games played randomly: Chomp and nim</title><source>arXiv.org</source><creator>Devlin, Pat ; Trifonova, Paulina</creator><creatorcontrib>Devlin, Pat ; Trifonova, Paulina</creatorcontrib><description>In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position.</description><identifier>DOI: 10.48550/arxiv.2401.16670</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-01</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2401.16670$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.16670$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Devlin, Pat</creatorcontrib><creatorcontrib>Trifonova, Paulina</creatorcontrib><title>Combinatorial games played randomly: Chomp and nim</title><description>In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr1OwzAYhWEvDCj0ApjwDST4J59_2FBEC1KlLtmjz7IBS3ESOVVF7p407XR0llcPIc-cVbUBYK-Y_-KlEjXjFVdKs0cimjG5OOB5zBF7-oMpzHTqcQmeZhz8mPrljTa_Y5roeukQ0xN5-MZ-Drv7FqTdf7TNZ3k8Hb6a92OJa7kMgFoZDQy8RSekMFwYoxGEASUs0946C8quFi65toHV4LxD6TmAFE4W5OWW3dDdlGPCvHRXfLfh5T80bzyk</recordid><startdate>20240129</startdate><enddate>20240129</enddate><creator>Devlin, Pat</creator><creator>Trifonova, Paulina</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240129</creationdate><title>Combinatorial games played randomly: Chomp and nim</title><author>Devlin, Pat ; Trifonova, Paulina</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-e5a7687505d9ab232812887a528562907d9b956940113179e045bdba3d15532b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Devlin, Pat</creatorcontrib><creatorcontrib>Trifonova, Paulina</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Devlin, Pat</au><au>Trifonova, Paulina</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Combinatorial games played randomly: Chomp and nim</atitle><date>2024-01-29</date><risdate>2024</risdate><abstract>In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position.</abstract><doi>10.48550/arxiv.2401.16670</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2401.16670
ispartof
issn
language eng
recordid cdi_arxiv_primary_2401_16670
source arXiv.org
subjects Mathematics - Combinatorics
title Combinatorial games played randomly: Chomp and nim
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T02%3A56%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Combinatorial%20games%20played%20randomly:%20Chomp%20and%20nim&rft.au=Devlin,%20Pat&rft.date=2024-01-29&rft_id=info:doi/10.48550/arxiv.2401.16670&rft_dat=%3Carxiv_GOX%3E2401_16670%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true