Lesson plan

Loopy game

In combinatorial game theory, a loopy game is a game in which players can return to game states they have previously encountered, creating cycles in the game tree. This contrasts with loop-free games, where players can never return to previously encountered positions. Loop-free finite games are also referred to as short games. Multiple real-life games allow repetitions (Fox and Geese, Hare and Hounds, Backsliding Toads and Frogs). Go stands somewhere in-between with the "ko" rule restricting many, but not all, repetitions. The study of loopy games extends traditional combinatorial game theory by incorporating games that can theoretically continue indefinitely due to their cyclic nature. They introduce additional complexity in analysis and can exhibit behaviors not found in finite games. The infinite nature of loopy games, similar to transfinite games, introduces an additional outcome beyond the traditional win-loss dichotomy: a tie or draw. In this framework, a player is said to survive a game if they achieve either a tie or a win, expanding the classical analysis of game outcomes. For impartial games that contain loops, analysis can be conducted using extensions of the Sprague–Grundy theorem, which generalizes the classical result to handle the complexities introduced by cyclic game structures.

Back to article

Article summary

In combinatorial game theory, a loopy game is a game in which players can return to game states they have previously encountered, creating cycles in the game tree. This contrasts with loop-free games, where players can never return to previously encountered positions. Loop-free finite games are also referred to as short games. Multiple real-life games allow repetitions (Fox and Geese, Hare and Hounds, Backsliding Toads and Frogs). Go stands somewhere in-between with the "ko" rule restricting many, but not all, repetitions. The study of loopy games extends traditional combinatorial game theory by incorporating games that can theoretically continue indefinitely due to their cyclic nature. They introduce additional complexity in analysis and can exhibit behaviors not found in finite games. The infinite nature of loopy games, similar to transfinite games, introduces an additional outcome beyond the traditional win-loss dichotomy: a tie or draw. In this framework, a player is said to survive a game if they achieve either a tie or a win, expanding the classical analysis of game outcomes. For impartial games that contain loops, analysis can be conducted using extensions of the Sprague–Grundy theorem, which generalizes the classical result to handle the complexities introduced by cyclic game structures.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.