Polynomial time winning strategies for three variants of (s,t)-Wythoff's game
From MaRDI portal
(Redirected from Publication:725767)
Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
Recommendations
- scientific article; zbMATH DE number 29719
- Computational complexity of winning strategies in two player polynomial games
- Computational complexity of winning strategies in two-person polynomial games
- Time-Optimal Winning Strategies for Poset Games
- Complexity of Winning Strategies for Δ 0 2 Games
- Variants of (s, t)-Wythoff's game
- On the complexity of computing winning strategies for finite poset games
- Integer Programming and Combinatorial Optimization
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Polynomial-time under-approximation of winning regions in parity games
Cites work
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
- Adjoining to Wythoff's game its P-positions as moves
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- General restriction of (s,t)-Wythoff's game
- Geometrical extensions of Wythoff's game
- Heap games, numeration systems and sequences
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 2124102 (Why is no real title available?)
- Nimhoff games
- The vile, dopey, evil and odious game players
Cited in
(4)
This page was built for publication: Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725767)
