Graphs and composite games
From MaRDI portal
Publication:5516556
DOI10.1016/S0021-9800(66)80005-4zbMath0141.36101MaRDI QIDQ5516556
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (32)
Remarks on strategies in combinatorial games ⋮ Conway Games, Coalgebraically ⋮ Complexity, appeal and challenges of combinatorial games ⋮ The generalized Sprague-Grundy function and its invariance under certain mappings ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ Complexity of problems in games, graphs and algebraic equations ⋮ A complete analysis of von Neumann's Hackendot ⋮ The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\) ⋮ Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees ⋮ Theory of annihilation games. I ⋮ Slow joins of loopy games ⋮ On the Sprague-Grundy function of extensions of proper \textsc{nim} ⋮ Theory of annihilation games ⋮ On sums of graph games with last player losing ⋮ Strategy for a class of games with dynamic ties ⋮ Deterministic graphical games ⋮ Analyzing games by Boolean matrix iteration ⋮ The particles and antiparticles game ⋮ Algebraic games -- playing with groups and rings ⋮ Two-player tower of Hanoi ⋮ Impartial achievement and avoidance games for generating finite groups ⋮ Two-person games on graphs ⋮ Compound Node-Kayles on paths ⋮ Vertex-to-vertex pursuit in a graph ⋮ Recent results and questions in combinatorial game complexities ⋮ Strategies for compounds of partizan games ⋮ A game of cops and robbers ⋮ Infinite cyclic impartial games ⋮ Prohibiting repetitions makes playing games substantially harder ⋮ The optimal capture time of the one-cop-moves game ⋮ Tarski's fixpoint lemma and combinatorial games ⋮ Two impartial games on finite p-groups
This page was built for publication: Graphs and composite games
