We study combinatorial and algorithmic questions around minimal feedback vertex sets (fvs) in tournament graphs. On the combinatorial side, we derive upper and lower bounds on the maximum number of minimal fvss in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740n minimal fvss, and that there is an infinite family of tournaments, all having at least 1.5448n minimal fvss. This improves and extends the bounds of moon (1971). On the algorithmic side, we design the first polynomial space algorithm that enumerates the minimal fvss of a tournament with polynomial delay. The combination of our results yields the fastest known algorithm for finding a minimum-sized fvs in a tournament.