Pages that link to "Item:Q1273667"
From MaRDI portal
The following pages link to How far can nim in disguise be stretched? (Q1273667):
Displaying 16 items.
- From heaps of matches to the limits of computability (Q396877) (← links)
- Building Nim (Q524964) (← links)
- Give-or-take games (Q656934) (← links)
- A variant of Nim (Q724864) (← links)
- Geometrical extensions of Wythoff's game (Q1025554) (← links)
- Nimhoff games (Q1177944) (← links)
- Bounded greedy Nim (Q1784736) (← links)
- Impartial poker nim (Q1791298) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Nimlike games with generalized bases (Q2566508) (← links)
- The Sprague-Grundy functions of saturations of misère Nim (Q2662339) (← links)
- Disjunctive sums of quasi-nimbers (Q2682908) (← links)
- Equality classes of Nim positions under misère play (Q2830438) (← links)
- A base-p Sprague-Grundy type theorem for p-calm subtraction games: Welter's game and representations of generalized symmetric groups (Q3390730) (← links)
- More ways of combining games (Q3973041) (← links)
- Nim with a modular Muller twist (Q4831499) (← links)