Scoring play combinatorial games

MaRDI QIDQ3295630zbMATH OpenFDO

Authors Fraser Stewart

Publication date 10 July 2020

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

zbMATH Keywords

combinatorial gamesimpartial scoring play gamesscoring play games

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Abstract: This thesis will be discussing scoring play combinatorial games and looking at the general structure of these games under different operators. I will also be looking at the Sprague-Grundy values for scoring play impartial games, and demonstrating that there is an easily computable function that will solve a large range of octal games easily. I will also be demonstrating that my theory can readily be applied to the scoring play game of Go and can lead to a much greater understanding of the game.

Recommendations

• Scoring games: the state of play
• Guaranteed scoring games
• The combinatorial game theory of well-tempered scoring games
• scientific article; zbMATH DE number 4176870
• Games with guaranteed scores and waiting moves

Cited in

(10)

• Games with guaranteed scores and waiting moves
• \textsc{influence}: a partizan scoring game on graphs
• The combinatorial game theory of well-tempered scoring games
• Guaranteed scoring games
• Scoring games: the state of play
• Cumulative subtraction games
• On the complexity and topology of scoring games: of pirates and treasure
• Topological network-control games
• Topological network-control games played on graphs
• Network control games played on graphs

This page was built for publication: Scoring play combinatorial games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295630)