  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.
