  We consider a variant of the game of Brussels Sprouts that, like Conway's
original version, ends in a predetermined number of moves. We show that the
endstates of the game are in natural bijection with noncrossing trees and that
the game histories are in natural bijection with both parking functions and
factorizations of a cycle of $S_n$.
