The Sprague-Grundy function for some selective compound games

2018/02/23 by Calvin Beideman, Beideman, Calvin, Matthew L. Bowen +3 · 1 citation
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Artificial Intelligence in Games #Game Theory and Applications #Game Theory and Voting Systems

paper · pdf · doi:10.48550/arxiv.1802.08700

Abstract

We analyze the Sprague-Grundy functions for a class of almost disjoint selective compound games played on Nim heaps. Surprisingly, we find that these functions behave chaotically for smaller Sprague-Grundy values of each component game yet predictably when any one heap is sufficiently large.

Cited by

• On the Sprague-Grundy function of compound games

Related

• On the Sprague-Grundy function of compound games
• Sprague-Grundy theory in bounded arithmetic
• On the Sprague-Grundy function of Exact k-Nim
• The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games
• Two Games on Arithmetic Functions: SALIQUANT and NONTOTIENT