Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem

DOI10.1016/j.tcs.2024.114636MaRDI QIDQ6562875

Kyle Burke, Matthew Ferland, Shang-Hua Teng

Publication date: 27 June 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational complexitycombinatorial game theoryNimber

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Impartial coloring games
• UNO is hard, even for a single player
• On the complexity of computing winning strategies for finite poset games
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Computing a perfect strategy for nxn chess requires time exponential in n
• Undirected edge geography
• On the complexity of some two-person perfect-information games
• A Nim game played on graphs.
• Nim, a game with a complete mathematical theory.
• Complexity, appeal and challenges of combinatorial games
• The role of quantum correlations in cop and robber game
• Winning ways for your mathematical plays. Vol. 1.
• On the Structure of Mis\`ere Impartial Games
• Atropos: A PSPACE-Complete Sperner Triangle Game
• GO Is Polynomial-Space Hard
• The Game of Hex and the Brouwer Fixed-Point Theorem
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Chomp, Recurrences and Chaos(?)
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete

This page was built for publication: Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562875)