  There are many combinatorial games in which a move can terminate the game,
such as a checkmate in chess. These moves give rise to diverse situations that
fall outside the scope of the classical normal play structure. To analyze these
games, an algebraic extension is necessary, including infinities as elements.
In this work, affine normal play, the algebraic structure resulting from that
extension, is analyzed. We prove that it is possible to compare two affine
games using only their forms. Furthermore, affine games can still be reduced,
although the reduced forms are not unique. We establish that the classical
normal play is order-embedded in the extended structure, constituting its
substructure of invertible elements. Additionally, as in classical theory,
affine games born by day n form a lattice with respect to the partial order of
games.
