Summary: The reduced canonical form of a loopfree game \(G\) is the simplest game infinitesimally close to \(G\). Reduced canonical forms were introduced by D. Calistrate [in: Games of no chance. Combinatorial games at MSRI. Workshop, July 11–21, 1994 in Berkeley, CA, USA. Cambridge: Cambridge Univ. Press. Math. Sci. Res. Inst. Publ. 29, 409–416 (1997; Zbl 0872.90132)], and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman–Siegel construction generalizes to find reduced canonical forms of certain loopy games.