Computational Hardness of Multidimensional Subtraction Games
From MaRDI portal
Publication:5042244
DOI10.1007/978-3-030-50026-9_17OpenAlexW3036222288MaRDI QIDQ5042244
Mikhail N. Vyalyi, Vladimir A. Gurvich
Publication date: 19 October 2022
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03962
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
- From heaps of matches to the limits of computability
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- Invariant games
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\)
- On the complexity of some two-person perfect-information games
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
- Sprague-Grundy function of matroids and related hypergraphs
- Sprague-Grundy function of symmetric hypergraphs
- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- A mathematical investigation of games of “take-away”
This page was built for publication: Computational Hardness of Multidimensional Subtraction Games
