Editing Sprague–Grundy theorem (section)

===={{anchor|secondExample}}Example Game 2====
{{Pre|
Sizes of heaps    Moves
&nbsp;
A' B' C'
1  1  1           Alice takes 1 from A'
0  1  1           Bob takes one from B'
0  0  1           Alice takes one from C'
0  0  0           Bob has no moves, so Alice wins.
}}

We can combine it with our [[#firstExample|first example]] to get a combined game with six heaps: <math>A</math>, <math>B</math>, <math>C</math>, <math>A'</math>, <math>B'</math>, and <math>C'</math>: