Two-player Domino games

Two-player Domino games

We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it. We study the problem of deciding which player wins, and pro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: de Menibus, Benjamin Hellouin, Pallen, Rémi
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Complexity
Computer Science - Computer Science and Game Theory
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 de Menibus, Benjamin Hellouin
Pallen, Rémi
description We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it. We study the problem of deciding which player wins, and prove that it is undecidable. We also consider a variant where the turn order is not alternating but given by a balanced word, and we characterise the decidable and undecidable cases.
doi_str_mv 10.48550/arxiv.2310.19759
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2310_19759</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2310_19759</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-a92b36af514dc8b4a1bca6a6e32ba6717b4bd7ff6523a67a069e10ac17513ef63</originalsourceid><addsrcrecordid>eNotjksLgkAYRWfTIqx1tMo_MOa8nWXYE4Q27uUbnQlBU0ao_PfZY3W5l8PlILQmccQTIeIt-Ff9iCibBqKV0HO0yp8d7hsYrQ_3XVvfu_AGrR0WaOagGezynwHKj4c8PePserqkuwyDVBqDpoZJcILwqkwMB2JKkCAto2YCiDLcVMo5KSibOsRSWxJDSZQgzDrJArT53X7Nit7XLfix-BgWX0P2Bk3CNM8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Two-player Domino games</title><source>arXiv.org</source><creator>de Menibus, Benjamin Hellouin ; Pallen, Rémi</creator><creatorcontrib>de Menibus, Benjamin Hellouin ; Pallen, Rémi</creatorcontrib><description>We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it. We study the problem of deciding which player wins, and prove that it is undecidable. We also consider a variant where the turn order is not alternating but given by a balanced word, and we characterise the decidable and undecidable cases.</description><identifier>DOI: 10.48550/arxiv.2310.19759</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Computer Science and Game Theory</subject><creationdate>2023-10</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,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2310.19759$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2310.19759$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>de Menibus, Benjamin Hellouin</creatorcontrib><creatorcontrib>Pallen, Rémi</creatorcontrib><title>Two-player Domino games</title><description>We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it. We study the problem of deciding which player wins, and prove that it is undecidable. We also consider a variant where the turn order is not alternating but given by a balanced word, and we characterise the decidable and undecidable cases.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Computer Science and Game Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjksLgkAYRWfTIqx1tMo_MOa8nWXYE4Q27uUbnQlBU0ao_PfZY3W5l8PlILQmccQTIeIt-Ff9iCibBqKV0HO0yp8d7hsYrQ_3XVvfu_AGrR0WaOagGezynwHKj4c8PePserqkuwyDVBqDpoZJcILwqkwMB2JKkCAto2YCiDLcVMo5KSibOsRSWxJDSZQgzDrJArT53X7Nit7XLfix-BgWX0P2Bk3CNM8</recordid><startdate>20231030</startdate><enddate>20231030</enddate><creator>de Menibus, Benjamin Hellouin</creator><creator>Pallen, Rémi</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20231030</creationdate><title>Two-player Domino games</title><author>de Menibus, Benjamin Hellouin ; Pallen, Rémi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-a92b36af514dc8b4a1bca6a6e32ba6717b4bd7ff6523a67a069e10ac17513ef63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Computer Science and Game Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>de Menibus, Benjamin Hellouin</creatorcontrib><creatorcontrib>Pallen, Rémi</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>de Menibus, Benjamin Hellouin</au><au>Pallen, Rémi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two-player Domino games</atitle><date>2023-10-30</date><risdate>2023</risdate><abstract>We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it. We study the problem of deciding which player wins, and prove that it is undecidable. We also consider a variant where the turn order is not alternating but given by a balanced word, and we characterise the decidable and undecidable cases.</abstract><doi>10.48550/arxiv.2310.19759</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2310.19759
ispartof
issn
language eng
recordid cdi_arxiv_primary_2310_19759
source arXiv.org
subjects Computer Science - Computational Complexity
Computer Science - Computer Science and Game Theory
title Two-player Domino games
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T05%3A38%3A37IST&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=Two-player%20Domino%20games&rft.au=de%20Menibus,%20Benjamin%20Hellouin&rft.date=2023-10-30&rft_id=info:doi/10.48550/arxiv.2310.19759&rft_dat=%3Carxiv_GOX%3E2310_19759%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