Abstract: We consider three closely related infinite two person games in which the second player has a winning perfect information strategy and examine under what conditions it suffices for the second player to remember only the most recent two moves in the game in order to insure a win. Strategies depending on this information only are called coding strategies.