The equivalence of three previously given definitions of the generalized Sprague-Grundy function G is established. A polynomial algorithm for the computation of G is given, and an optimal strategy for the sum of a wide class of two-player games which may contain cycles or loops is formulated, which is one of the main applications of G. Finally, the invariance of G under a mapping of digraphs which may contain cycles or loops is established.
