The following pages link to (Q3433876):
Displaying 50 items.
- \(i\)-\textsc{Mark}: a new subtraction division game (Q265084) (← links)
- Polymerization and crystallization of snowflake molecules in Domineering (Q307795) (← links)
- Dead ends in misère play: the misère monoid of canonical numbers (Q390305) (← links)
- The domination game played on unions of graphs (Q468438) (← links)
- Dicots, and a taxonomic ranking for misère games (Q476289) (← links)
- New results for Domineering from combinatorial game theory endgame databases (Q500968) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Lattice point methods for combinatorial games (Q534200) (← links)
- Embedding processes in combinatorial game theory (Q534324) (← links)
- Canonical forms of uptimals (Q655420) (← links)
- The switch operators and push-the-button games: a sequential compound over rulesets (Q683756) (← links)
- Games on interval and permutation graph representations (Q897865) (← links)
- Patterns in the generalized Fibonacci word, applied to games (Q1744753) (← links)
- Ordinal sums of impartial games (Q1752442) (← links)
- On tame, pet, domestic, and miserable impartial games (Q1752444) (← links)
- A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four (Q1752585) (← links)
- Bidding games and efficient allocations (Q1756335) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Special issue on combinatorial game theory (Q1791276) (← links)
- Entrepreneurial chess (Q1791278) (← links)
- Algebraic games -- playing with groups and rings (Q1791279) (← links)
- Two-player tower of Hanoi (Q1791283) (← links)
- Impartial achievement and avoidance games for generating finite groups (Q1791287) (← links)
- Sterling Stirling play (Q1791290) (← links)
- Global Fibonacci nim (Q1791292) (← links)
- Impartial poker nim (Q1791298) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- Circular Nim games (Q1953504) (← links)
- \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
- A generalization of \textsc{Arc-Kayles} (Q2002065) (← links)
- The arithmetic-periodicity of \textsc{cut} for \(\mathcal{C} = \{1, 2 c\}\) (Q2081507) (← links)
- Some notes on disjunctive short sum: \textsc{polychromatic nim} (Q2097176) (← links)
- Book review of: E. R. Berlekamp et al., Winning ways for your mathematical plays. (Q2153993) (← links)
- Partition games (Q2197465) (← links)
- Impartial achievement games on convex geometries (Q2230406) (← links)
- Three-player \textsc{nim} with podium rule (Q2230539) (← links)
- On the Sprague-Grundy function of extensions of proper \textsc{nim} (Q2230540) (← links)
- On lattices from combinatorial game theory: infinite case (Q2230543) (← links)
- Dawson's chess revisited (Q2254396) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Simplicial complexes are game complexes (Q2318782) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- The orthogonal colouring game (Q2330119) (← links)
- Sprague-Grundy function of matroids and related hypergraphs (Q2333808) (← links)
- A group from Hackenbush game (Q2338149) (← links)
- On the expansion of three-element subtraction sets (Q2342669) (← links)
- On the complexity of the misère version of three games played on graphs (Q2354773) (← links)
- P-positions in modular extensions to Nim (Q2398197) (← links)
- Timber game as a counting problem (Q2414465) (← links)
- Impartial achievement games for generating nilpotent groups (Q2414568) (← links)
