2020/01/27 by Alexandru Malekshahian, Malekshahian, Alexandru
Computer Science · Mathematics · #91A46 #Advanced Graph Theory Research #Artificial Intelligence in Games #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #math.CO #msc:91A46
paper · pdf · doi:10.48550/arxiv.2001.10116
7 pages, 9 figures
arxiv created 2020/01/27 · openalex publication_date 2020/01/27 · arxiv updated 2020/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the game of n-Sim, two players take it in turn to claim unclaimed edges from a complete graph on n vertices, with the first person to create a triangle in his own edges being the loser. We present some strategy-stealing arguments that show that certain positions are wins for the second player. These are among the only strategy-stealing arguments that are known for misère games.