Nimber¶
Assign an impartial normal-play game position the unique Nim-heap value determined recursively by the minimum excluded values of its options and composed by nim-sum.
Core Idea¶
A nimber is the canonical game value represented by a Nim heap and assigned to an impartial position under normal play. For a finite acyclic position \(G\), its value is \(g(G)=\operatorname{mex}\{g(H):H\text{ is an option of }G\}\), the least nonnegative integer absent from the option values. The Sprague–Grundy theorem states that \(G\) is equivalent, for disjunctive addition, to a Nim heap of that size. This game-theoretic Grundy value must not be confused with the accepted catalog's Grundy number of a graph, which concerns greedy vertex coloring.
Scope of Application¶
The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Nimber itself, not metaphors based only on resemblance.
- Finite impartial games. Classifying positions under normal play.
- Game decomposition. Evaluating independent components separately before nim-summing them.
- Winning-move search. Selecting an option that changes the total nim-sum to zero.
- Algorithm design. Memoizing recursive values on a directed acyclic game graph.
- Game equivalence. Replacing a complicated component by its contextually equivalent Nim heap.
- Transfinite game theory. Extending the nimber family to ordinal values under stronger foundations.
Clarity¶
A clear account of Nimber must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. State impartiality, normal play, and the finiteness or well-foundedness assumptions. Apply mex to already computed option nimbers and show the option set. Use nim-sum rather than ordinary addition for disjunctive components. Disambiguate game nimber from graph-coloring Grundy number at first use. These declarations are not editorial extras: each changes what observations count, which transformations are licensed, and what conclusion can be drawn.
Manages Complexity¶
Nimber manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: game position supplies a state in an impartial perfect-information game supplies the object evaluated.; option set supplies legal followers are identical for both players and define the recursion.; normal-play convention supplies having no move means losing, fixing terminal semantics.; acyclic foundation supplies finite descent makes recursive evaluation well founded.; minimum excluded operator supplies mex selects the least value not represented among options..
Abstract Reasoning¶
- Model positions and legal moves as a well-founded directed game graph. 2. Assign value zero to every terminal position under normal play. 3. Evaluate predecessors after all option values are known. 4. Take the minimum excluded nonnegative integer at each position. 5. Decompose disjunctive sums into independently evaluable components. 6. Combine component nimbers by bitwise exclusive-or. 7. Find a move to total zero when the current combined value is nonzero.
Knowledge Transfer¶
The strict upward abstraction is Evaluation. Nimber instantiates Evaluation because it maps each eligible game position to a contextually meaningful value that predicts outcome class and composes across independent subgames. Within impartial normal play game values, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Nimber after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.
Relationships to Other Abstractions¶
Current abstraction Nimber Domain-specific
Parents (1) — more general patterns this builds on
-
Nimber is a kind of Evaluation Prime
Nimber instantiates Evaluation because it maps each eligible game position to a contextually meaningful value that predicts outcome class and composes across independent subgames.
Hierarchy path (1) — routes to 1 parentless root
- Nimber → Evaluation → Comparison → Self Checking
Neighborhood in Abstraction Space¶
Nimber sits in a sparse region of the domain-specific corpus (88th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Strategic Games & Temporal Logic (8 abstractions)
Nearest neighbors
- Subgame Perfect Equilibrium — 0.80
- Negation as Failure — 0.80
- Natural Number — 0.80
- Mixed Strategy Equilibrium — 0.79
- Ackermann function — 0.78
Computed from structural-signature embeddings · 2026-09-08