The linking-unlinking game
From MaRDI portal
Publication:2278631
DOI10.2140/INVOLVE.2019.12.1109zbMATH Open1435.91039arXiv1807.11026OpenAlexW2883907905WikidataQ126981577 ScholiaQ126981577MaRDI QIDQ2278631FDOQ2278631
Authors: Adam Giambrone, Jake Murphy 
Publication date: 5 December 2019
Published in: Involve (Search for Journal in Brave)
Abstract: Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the game. In this paper, we introduce the Linking-Unlinking Game which is played on two-component link shadows. We then present winning strategies for the Linking-Unlinking Game played on all shadows of two-component rational tangle closures and played on a large family of general two-component link shadows.
Full work available at URL: https://arxiv.org/abs/1807.11026
Recommendations
Cites Work
Cited In (12)
- Integral region choice problems on link diagrams
- Structures of homomorphisms induced by arc selection game and arc freeze selection game
- A midsummer knot's dream
- The Arc Unknotting Game
- The region unknotting game
- The link smoothing game
- The KnotLink game
- The region smoothing swap game
- Unshackle game on 2D grid and shadow strategy
- Twist untangle and related knot games
- Playing with Knots
- The combinatorial game theory of well-tempered scoring games
This page was built for publication: The linking-unlinking game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278631)
