The following pages link to (Q2703803):
Displayed 27 items.
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory (Q378342) (← links)
- Vertex Nim played on graphs (Q385953) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Canonical forms of uptimals (Q655420) (← links)
- Analysis of one pile misère Nim for two alliances (Q658376) (← links)
- Some remarks on End-Nim (Q666523) (← links)
- Nimbers are inevitable (Q690454) (← links)
- Self-organized criticality in intertidal microphytobenthos patch patterns (Q699130) (← links)
- Lattices of games (Q766145) (← links)
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions (Q965231) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- Invariant games (Q986552) (← links)
- Algebraic structure in a family of Nim-like arrays. (Q1039769) (← links)
- Order-disorder transition in the Chialvo-Bak `minibrain' controlled by network geometry (Q1394689) (← links)
- Solitaire clobber (Q1884994) (← links)
- Periodicity and arithmetic-periodicity in hexadecimal games (Q1885005) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- Circular Nim games (Q1953504) (← links)
- Misère quotients for impartial games (Q2427556) (← links)
- The Sprague-Grundy function of the game Euclid (Q2433738) (← links)
- A family of Nim-like arrays: the locator theorem (Q2447762) (← links)
- The combinatorial game theory of well-tempered scoring games (Q2453496) (← links)
- One-pile misère Nim for three or more players (Q2469051) (← links)
- Nimlike games with generalized bases (Q2566508) (← links)
- Wythoff's sequence and \(N\)-heap Wythoff's conjectures (Q2570115) (← links)
- On mathematical games (Q3017835) (← links)
- Strategies in Games: A Logic-Automata Study (Q3166989) (← links)