Preventing look-ahead cheating with active objects

In a turn-based networked multiplayer computer game, it is possible to cheat by delaying the announcement of one's action for a turn until one has received messages from all the other players. This look-ahead cheating can be prevented with a lockstep protocol, which requires that the player first announces a commitment to an action and later on the action itself, which can be compared with the earlier announced commitment. However, because the lockstep protocol requires separate transmissions for the commitment and the action and a synchronization step before the actions can be announced, it slows down the turns of the game. In this paper, we propose that active objects can be used to prevent look-ahead cheating. Moreover, we can parameterize the probability of catching cheaters: The smaller this probability is, the less bandwidth and transmissions are required. In most cases, the mere threat of getting caught is enough to discourage cheating, and, consequently, this probability can be quite small.