markgritter, 
Suppose you modify #nim with the additional rule that taking the last chip in any heap immediately takes all other heaps as well.
It looks to me an awful lot like the Grundy function (for two heaps) is
G(a,b) = 1 + (a-1) XOR (b-1)
But I can only get halfway there on a inductive proof. Is there a clever remapping of the game that shows this formula holds?
Question on Quora (with my partial answer proposing the above): https://www.quora.com/If-you-modify-the-rules-of-nim-so-that-the-game-ends-as-soon-as-any-heap-is-empty-how-to-calculate-the-Grundy-value-of-a-game-from-the-heap-sizes
I haven't even started at looking at whether this handles more than two heaps, either.
