Infinite two-player games have been a very useful tool to prove many results in logic and other areas. What makes them fascinating to computability theorists is that winning strategies can be extremely complex even for simple games.

We will describe these games, maybe play one or two, and introduce the necessary background to understand the answer---given by the author and Richard Shore---to the following question: How much determinacy of games can be proved without using uncountable objects?