{{Multiple issues| {{one source|date=January 2025}} {{sources exist|date=September 2025}} }} {{Short description|Type of game in combinatorial game theory}} {{for|game console|Casio Loopy}} 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'''.<ref>{{cite book |last1=Siegel |first1=Aaron |title=Combinatorial Game Theory |date=20 November 2023 |publisher=American Mathematical Society |isbn=978-1-4704-7568-0}}</ref> 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.{{sfn|Siegel|2005|p=10}}
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.
== Notation == In combinatorial game theory notation, games are defined recursively by specifying the moves available to the Left and Right players using the format {Left options|Right options}. Some fundamental loopy games include:
* '''dud''': {dud|dud} - a game where both players can only move back to the same position, creating an infinite loop with no winner (known as the "deathless universal draw") * '''on''': {on|} - a game where only the Left player has a move (back to the same position), while Right has no moves and loses immediately * '''off''': {|off} - a game where only the Right player has a move (back to the same position), while Left has no moves and loses immediately
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.
== Stoppers ==
Stoppers are loopy games that have no subpositions with infinite alternating runs. Unlike generic loopy games, stoppers can never tie.
== Examples ==
==References== {{Reflist}}
==Sources== * {{cite book |last=Siegel |first=Aaron Nathan |title=Loopy Games and Computation |publisher=University of California, Berkeley |date=2005 |url=https://www.google.com/books/edition/Loopy_Games_and_Computation/iy5PAQAAMAAJ?hl=en&gbpv=1&bsq=%2522Loopy+game%2522+example |access-date=2025-09-29}}
Category:Combinatorial game theory {{improve categories|date=January 2025}}