Many logics can be regarded as classes of reachability games between two players, whom we may call Adam and Eve: Eve claims that a given structure has a certain property, while Adam challenges that claim. We consider the problem of large games, i.e., games with long programs. In the real world, such programs are composed of smaller subprograms, with the result that we are ultimately presented with what looks like a small program, but with calls to subprograms, which in turn have calls to subsubprograms, and so on. We look at some examples and some theoretical issues.