As I understand it, the Sprague-Grundy theorem states that, under the operation of combining games in parallel, every impartial game can be reduced to a game of Nim. I see that the definition itself specifies this parallel combination operator explicitly: two impartial games G and G' are assigned the same nimber iff for all games H, G + H and G' + H have the same outcome (here, + denotes the parallel combination operator)---this definition is from Wikipedia.
However, what about other methods of combining games? For instance, we combine two games A and B such that they are still played in parallel, but as soon as a player has no moves left in A, they instantly lose, regardless of the position of B. In general, can we still treat games A and B as their corresponding nimbers? If so, why? If not, what's a counterexample?



