In mathematics, a hydra game is a single player iterative game played on a mathematical tree called a hydra, in which the player's goal is to kill the hydra by removing its nodes, called heads, one by one, while the hydra simultaneously grows new heads according to a fixed rule, resembling the battle between Hercules and the Lernaean Hydra from which it takes its name. The rules of the game guarantee that the player can always eventually win, but the number of steps required grows extremely rapidly as the size of the starting tree increases, so the game can be used to generate very large numbers or infinite ordinals, or to demonstrate the strength of certain mathematical theories. Unlike combinatorial counterparts such as TREE and SCG, no search is needed to compute how the game plays out: a player need only keep applying the fixed transformation rule to the tree until the game ends.
Facts
Origin YearKirby and Paris introduced the hydra game in this 1982 paper as an illustration of their independence result for Peano arithmetic. Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Kirby-Paris theorem
ReferencesQuote, References
Kirby, L.; Paris, J. (1982). "Accessible Independence Results for Peano Arithmetic". Bulletin of the London Mathematical Society. 14 (4): 285.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.