Loopy game

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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. These canonical loopy games exhibit interesting algebraic properties. For instance, on + off = dud, and dud + G = dud for any game G, demonstrating that dud acts as an absorbing element under game addition.

References

Sources

Text derived from https://en.wikipedia.org/w/index.php?oldid=1313967969 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.