The following pages link to (Q4827118):
Displaying 45 items.
- A classification of one-dimensional cellular automata using infinite computations (Q299409) (← links)
- Three-pile Sharing Nim and the quadratic time winning strategy (Q306276) (← links)
- One pile misère bounded Nim with two alliances (Q317394) (← links)
- Analyzing \(n\)-player impartial games (Q422369) (← links)
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves (Q477328) (← links)
- General restrictions of Wythoff-like games (Q497681) (← links)
- A class of extensions of restricted (\(s\), \(t\))-Wythoff's game (Q521580) (← links)
- Multi-player subtraction games (Q729996) (← links)
- Winning strategies for aperiodic subtraction games (Q764378) (← links)
- RealLife: the continuum limit of larger than life cellular automata (Q870839) (← links)
- On the misere version of game Euclid and miserable games (Q870986) (← links)
- Defect particle kinematics in one-dimensional cellular automata (Q884475) (← links)
- Invisible runners in finite fields (Q975401) (← links)
- All solutions of the Soma cube puzzle (Q1066811) (← links)
- The vertex picking game and a variation of the game of dots and boxes (Q1109699) (← links)
- The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games (Q1637227) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Multi-player End-Nim games (Q1727384) (← links)
- Game comparison through play (Q1748992) (← links)
- Note on the integer geometry of bitwise XOR (Q1775037) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Assessing the robustness of critical behavior in stochastic cellular automata (Q2083752) (← links)
- The Penney's game with group action (Q2128839) (← links)
- Bounding game temperature using confusion intervals (Q2220877) (← links)
- Discrete Richman-bidding scoring games (Q2230546) (← links)
- Queens in exile: non-attacking queens on infinite chess boards (Q2309222) (← links)
- Simplicial complexes are game complexes (Q2318782) (← links)
- Sprague-Grundy function of matroids and related hypergraphs (Q2333808) (← links)
- Reversible peg solitaire on graphs (Q2352067) (← links)
- Variants of \((s, t)\)-Wythoff's game (Q2357128) (← links)
- Sprague-Grundy function of symmetric hypergraphs (Q2424909) (← links)
- Morphisms for resistive electrical networks (Q2434733) (← links)
- Games played by Boole and Galois (Q2473039) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- \(n\)-player impartial combinatorial games with random players (Q2513668) (← links)
- Quantum extensive-form games (Q2686222) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- (Q3390728) (← links)
- Counting Domineering Positions (Q4989362) (← links)
- Preface (Q5041720) (← links)
- The Polynomial Profile of Distance Games on Paths and Cycles (Q5042429) (← links)
- Statistical Challenges in Agent-Based Modeling (Q5056970) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- (Q5089184) (← links)
- Sprague-Grundy values and complexity for LCTR (Q6193951) (← links)
