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 gamein order to insure a win. Strategies depending on this information only are called coding strategies.
| Original language | English |
|---|---|
| Pages (from-to) | 1107-1115 |
| Number of pages | 9 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 112 |
| Issue number | 4 |
| DOIs | |
| State | Published - Aug 1991 |
Keywords
- Coding strategy
- Free ideal
- Game
- Winning strategy