Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game

DOI10.1007/s40314-016-0405-xzbMath1407.91069OpenAlexW2555309099MaRDI QIDQ725767

Guisheng Yi, Hai-yan Li, San-Yang Liu

Publication date: 2 August 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-016-0405-x

zbMATH Keywords

game theorypolynomial timecombinatorial games\((s,t)\)-Wythoff's game

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cites Work

• General restriction of \((s,t)\)-Wythoff's game
• Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
• The vile, dopey, evil and odious game players
• Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
• Geometrical extensions of Wythoff's game
• Nimhoff games
• Adjoining to Wythoff's game its P-positions as moves
• Heap games, numeration systems and sequences
• How to Beat Your Wythoff Games' Opponent on Three Fronts
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game