The following pages link to (Q2703803):
Displaying 50 items.
- \(i\)-\textsc{Mark}: a new subtraction division game (Q265084) (← links)
- The graph distance game and some graph operations (Q283692) (← links)
- Algorithms for interactive Sprouts (Q307772) (← links)
- Guaranteed scoring games (Q311536) (← links)
- Grundy values of Fibonacci Nim (Q328554) (← links)
- Misère-play Hackenbush sprigs (Q328573) (← links)
- 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)
- General restriction of \((s,t)\)-Wythoff's game (Q405250) (← links)
- The domination game played on unions of graphs (Q468438) (← links)
- Dicots, and a taxonomic ranking for misère games (Q476289) (← links)
- Misère Nim with multi-player (Q505419) (← links)
- Transitive avoidance games (Q521391) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← 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)
- The switch operators and push-the-button games: a sequential compound over rulesets (Q683756) (← links)
- Nimbers are inevitable (Q690454) (← links)
- Self-organized criticality in intertidal microphytobenthos patch patterns (Q699130) (← links)
- A variant of Nim (Q724864) (← links)
- Lattices of games (Q766145) (← links)
- Dynamical conflict models. I. Language of modeling (Q891625) (← links)
- Nim with one or two dynamic restrictions (Q897584) (← links)
- Games on interval and permutation graph representations (Q897865) (← 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)
- Invertibility modulo dead-ending no-\(\mathcal{P}\)-universes (Q1621726) (← links)
- \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups (Q1631377) (← links)
- Multi-player small Nim with passes (Q1693156) (← links)
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim} (Q1706111) (← links)
- One-pile Nim games with arbitrarily many random players (Q1727724) (← links)
- A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four (Q1752585) (← links)
- Entrepreneurial chess (Q1791278) (← links)
- Algebraic games -- playing with groups and rings (Q1791279) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- Wythoff partizan subtraction (Q1791294) (← links)
- Games with guaranteed scores and waiting moves (Q1791295) (← links)
- Impartial poker nim (Q1791298) (← links)
- Friendly Frogs, Stable Marriage, and the Magic of Invariance (Q4575260) (← links)
- Cookie Monster Plays Games (Q4581525) (← links)
- Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives (Q4961629) (← links)
- (Q4993530) (← links)
- Notes on the combinatorial game: graph Nim (Q5006589) (← links)
- On Compatible Matchings (Q5049995) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
