Sprague-Grundy values and complexity for LCTR

DOI10.1016/j.dam.2023.11.036zbMath1530.91108arXiv2207.05599MaRDI QIDQ6193951

Eric Gottlieb, Peter Mursic, Matjaž Krnc

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.05599

zbMATH Keywords

computational complexitycombinatorial gameSprague-Grundypartition games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups
• On tame, pet, domestic, and miserable impartial games
• Partition games
• Misère quotients for impartial games
• Some results on LCTR, an impartial game on partitions

This page was built for publication: Sprague-Grundy values and complexity for LCTR