Computational Hardness of Multidimensional Subtraction Games
From MaRDI portal
Cites work
- A mathematical investigation of games of “take-away”
- 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
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- scientific article; zbMATH DE number 3124340 (Why is no real title available?)
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Invariant games
- On the complexity of some two-person perfect-information games
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
- Playing games with algorithms: algorithmic combinatorial game theory
- Slow \(K\)-\textsc{Nim}
- Sprague-Grundy function of matroids and related hypergraphs
- Sprague-Grundy function of symmetric hypergraphs
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\)
- Winning ways for your mathematical plays. Vol. 1.
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
This page was built for publication: Computational Hardness of Multidimensional Subtraction Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042244)
