The following pages link to (Q2703803):
Displaying 19 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)
- 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)
- Walks: A Beginner's Guide to Graphs and Matrices (Q5158411) (← links)
- Smash and grab: the \(0 \cdot 6\) scoring game on graphs (Q6120354) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- Book review of: D. Nirenberg and R. L. Nirenberg, Uncountable. A philosophical history of number and humanity from antiquity to the present (Q6169830) (← links)
- Sprague-Grundy values and complexity for LCTR (Q6193951) (← links)
