  In this paper, we introduce a variant of Francis Su's "Game of Cycles," that
we call "Cycles with Sources." The only change to the rules is permitting nodes
to be sources, while sinks are still prohibited. Despite this minor change in
the rules, we show that even on simple games, like line graphs, there is a
great change in the outcome of optimal play, which we fully analyze using
Sprague-Grundy Theory.
