Undirected edge geography games on grids
Discrete Applied Mathematics · 2026-11 · 393 · 280-286
DOI: 10.1016/j.dam.2026.07.019 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-11. Verfasst von Tharit Sereekiatdilok und 1 weiteren Autor:innen. Die Arbeit nennt 2 Literaturangaben.
Abstract (Originalsprache)
The undirected edge geography is a two-player combinatorial game on an undirected rooted graph. The players alternatively perform a move consisting of choosing an edge incident to the root vertex, removing the chosen edge, and marking the other endpoint as a new root vertex. The first player who cannot perform a move is the loser. In this paper, we are interested in the undirected edge geography game on the grid graph $P_m\square P_n$. We completely determine all N-positions (the root vertices where the first player wins) and all P-positions (the root vertices where the first player loses). Moreover, we give a winning strategy for the winner.
Zitieren
APA
Sereekiatdilok, T., & Vichitkunakorn, P. (2026). Undirected edge geography games on grids. Discrete Applied Mathematics, 393, 280-286. https://doi.org/10.1016/j.dam.2026.07.019
Vancouver
Sereekiatdilok T, Vichitkunakorn P. Undirected edge geography games on grids. Discrete Applied Mathematics. 2026;393:280-286. doi:10.1016/j.dam.2026.07.019
BibTeX
@article{Sereekiatdilok2026,
author = {Sereekiatdilok, Tharit and Vichitkunakorn, Panupong},
title = {Undirected edge geography games on grids},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {393},
pages = {280--286},
doi = {10.1016/j.dam.2026.07.019}
}
EUVIMED