It is well known that infinite perfect information two person games at low levels in the arithmetic hierarchy of sets have winning strategies for one of the players, and moreover this fact can be proven in analysis alone. This has led people to consider reverse mathematical analyses of precisely which subsystems of second order arithmetic are needed. We go over the history of these results. Recently Montalban and Shore gave a precise delineation of the amount of determinacy provable in analysis. Their arguments use concretely given levels of the Gödel constructible hierarchy. It should be possible to lift those arguments to the amount of determinacy, properly including analytic determinacy, provable in stronger theories than the standard ZFC set theory. We summarise some recent joint work with Chris Le Sueur.
