Answers are grounded in this paper and cite their sources.
The concept of nimbers--a.k.a. Grundy-values or nim-values--is fundamental to combinatorial game theory. Nimbers provide a complete characterization of strategic interactions among impartial games in their disjunctive sums as well as the winnability. In this paper, we initiate a study of nimber-preserving reductions among impartial games. These reductions enhance the winnability-preserving reductions in traditional computational characterizations of combinatorial games. We prove that Generalized Geography is complete for the natural class, IP , of polynomially-short impartial rulesets under nimber-preserving reductions, a property we refer to as Sprague-Grundy-complete. In contrast, we also show that not every PSPACE-complete ruleset in IP is Sprague-Grundy-complete for IP . By considering every impartial game as an encoding of its nimber, our technical result establishes the following striking cryptography-inspired homomorphic theorem: Despite the PSPACE-completeness of nimber computation for IP , there exists a polynomial-time algorithm to construct, for any pair of games G₁, G₂ of IP , a prime game (i.e. a game that cannot be written as a sum) H of IP , satisfying: nimber(H) = nimber(G₁) ⊕ nimber(G₂).
No takes yet. Share an insight, caveat, or question.
Burke et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: