Abstract

There are well-known problems for formalist accounts of game-play with regards to cheating. Such accounts seem to be committed to cheaters being unable to win–or even play–the game, yet it seems that there are instances of cheaters winning games. In this paper, I expand the discussion of such problems by introducing cases of pre-game cheating, and see how a formalist–specifically a Suitsian–account can accommodate such problems. Specifically, I look at two (fictional) examples where the alleged game-players cheat prior to a game-instance in such as a way as to cast doubt on whether the alleged game-players are truly playing the game. To escape the worries brought about by these examples of pre-game cheating, I will appeal to the concept of nested games. This concept will give us the needed tools to explain how the alleged players are cheating and how the alleged players are players. On the whole, this discussion should help illuminate some important issues with regards to cheating and rules on a Suitsian account of game-play, and help give support for formalist accounts more generally.