Abstract

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\cal{I}^P , 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\cal{I}^P is Sprague-Grundy-complete for IP\cal{I}^P . 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\cal{I}^P , there exists a polynomial-time algorithm to construct, for any pair of games G1G_1, G2G_2 of IP\cal{I}^P , a prime game (i.e. a game that cannot be written as a sum) HH of IP\cal{I}^P , satisfying: nimber(HH) = nimber(G1G_1) ⊕\oplus nimber(G2G_2).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.