Games of No Chance 6
Herausgeber: Larsson, Urban
Games of No Chance 6
Herausgeber: Larsson, Urban
- Gebundenes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This edited volume surveys Richman bidding combinatorial games, classical subtraction games and absolute additive theory. The recurring list of open problems, updated and annotated, will interest all practitioners of CGT and related fields including algebra, computer science, combinatorics, number theory and classical game theory.
Andere Kunden interessierten sich auch für
Games of No Chance 5202,99 €
Games of No Chance 4145,99 €
More Games of No Chance62,99 €
J. Nowakowski (ed.)Games of No Chance65,99 €
Games of No Chance 3155,99 €
Richard J. Nowakowski (ed.)More Games of No Chance165,99 €
Jerzy ZabczykChance and Decision. Stochastic Control in Discrete Time28,99 €-
-
-
This edited volume surveys Richman bidding combinatorial games, classical subtraction games and absolute additive theory. The recurring list of open problems, updated and annotated, will interest all practitioners of CGT and related fields including algebra, computer science, combinatorics, number theory and classical game theory.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 526
- Erscheinungstermin: 28. April 2025
- Englisch
- Abmessung: 240mm x 161mm x 33mm
- Gewicht: 948g
- ISBN-13: 9781009565523
- ISBN-10: 1009565524
- Artikelnr.: 73785792
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: Cambridge University Press
- Seitenzahl: 526
- Erscheinungstermin: 28. April 2025
- Englisch
- Abmessung: 240mm x 161mm x 33mm
- Gewicht: 948g
- ISBN-13: 9781009565523
- ISBN-10: 1009565524
- Artikelnr.: 73785792
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
Preface Urban Larsson; 1. Combinatorial game theory monoids and their
absolute restrictions: a survey Alfie M. Davies, Urban Larsson, Rebecca
Milley, Richard J. Nowakowski, Carlos P. Santos and Aaron N. Siegel; 2. A
brief conversation about subtraction games Urban Larsson, Indrajit Saha and
Koki Suetsugu; 3. Survey on Richman bidding combinatorial games Prem Kant
and Urban Larsson; 4. Unsolved problems in combinatorial games Richard J.
Nowakowski; 5. Absolute combinatorial game theory Urban Larsson, Richard J.
Nowakowski and Carlos P. Santos; 6. Affine normal play Urban Larsson,
Richard J. Nowakowski and Carlos P. Santos; 7. On the general dead-ending
universe of partizan games Aaron N. Siegel; 8. Infinitely many absolute
universes Urban Larsson, Richard J. Nowakowski and Carlos P. Santos; 9.
Reversibility, canonical form, and invertibility in dead-ending misère play
Urban Larsson, Rebecca Milley, Richard J. Nowakowski, Gabriel Renault and
Carlos P. Santos; 10. Dead-ending day-2 games under misère play Aaron
Dwyer, Rebecca Milley and Michael Willette; 11. All passable games are
realizable as monotone set coloring games Eric Demer, Peter Selinger and
Kyle Wang; 12. Values of generic impartial combinatorial games Eric
Friedman; 13. A family of Nim-like arrays: stabilization Lowell Abrams and
Dena S. Cowen-Morton; 14. Memgames Urban Larsson, Simon Rubinstein-Salzedo
and Aaron N. Siegel; 15. The bishop and knight checkmate on a large
chessboard Johan Wästlund; 16. An update on the coin-moving game on the
square grid Florian Galliot, Sylvain Gravier and Isabelle Sivignon; 17. P
play in Candy Nim Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo and
Alexa Tholen; 18. Keeping your distance is hard Kyle Burke, Silvia Heubach,
Melissa A. Huggan and Svenja Huntemann; 19. Improving upper and lower
bounds of the number of games born by day 4 Koki Suetsugu; 20.
Lexicographic Wythoff David Klein and Aviezri S. Fraenkel; 21. Corner the
empress Robbert Fokkink, Gerard Francis Ortega and Dan Rust; 22. m-modular
Wythoff Tanya Khovanova and Nelson Niu.
absolute restrictions: a survey Alfie M. Davies, Urban Larsson, Rebecca
Milley, Richard J. Nowakowski, Carlos P. Santos and Aaron N. Siegel; 2. A
brief conversation about subtraction games Urban Larsson, Indrajit Saha and
Koki Suetsugu; 3. Survey on Richman bidding combinatorial games Prem Kant
and Urban Larsson; 4. Unsolved problems in combinatorial games Richard J.
Nowakowski; 5. Absolute combinatorial game theory Urban Larsson, Richard J.
Nowakowski and Carlos P. Santos; 6. Affine normal play Urban Larsson,
Richard J. Nowakowski and Carlos P. Santos; 7. On the general dead-ending
universe of partizan games Aaron N. Siegel; 8. Infinitely many absolute
universes Urban Larsson, Richard J. Nowakowski and Carlos P. Santos; 9.
Reversibility, canonical form, and invertibility in dead-ending misère play
Urban Larsson, Rebecca Milley, Richard J. Nowakowski, Gabriel Renault and
Carlos P. Santos; 10. Dead-ending day-2 games under misère play Aaron
Dwyer, Rebecca Milley and Michael Willette; 11. All passable games are
realizable as monotone set coloring games Eric Demer, Peter Selinger and
Kyle Wang; 12. Values of generic impartial combinatorial games Eric
Friedman; 13. A family of Nim-like arrays: stabilization Lowell Abrams and
Dena S. Cowen-Morton; 14. Memgames Urban Larsson, Simon Rubinstein-Salzedo
and Aaron N. Siegel; 15. The bishop and knight checkmate on a large
chessboard Johan Wästlund; 16. An update on the coin-moving game on the
square grid Florian Galliot, Sylvain Gravier and Isabelle Sivignon; 17. P
play in Candy Nim Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo and
Alexa Tholen; 18. Keeping your distance is hard Kyle Burke, Silvia Heubach,
Melissa A. Huggan and Svenja Huntemann; 19. Improving upper and lower
bounds of the number of games born by day 4 Koki Suetsugu; 20.
Lexicographic Wythoff David Klein and Aviezri S. Fraenkel; 21. Corner the
empress Robbert Fokkink, Gerard Francis Ortega and Dan Rust; 22. m-modular
Wythoff Tanya Khovanova and Nelson Niu.
Preface Urban Larsson; 1. Combinatorial game theory monoids and their
absolute restrictions: a survey Alfie M. Davies, Urban Larsson, Rebecca
Milley, Richard J. Nowakowski, Carlos P. Santos and Aaron N. Siegel; 2. A
brief conversation about subtraction games Urban Larsson, Indrajit Saha and
Koki Suetsugu; 3. Survey on Richman bidding combinatorial games Prem Kant
and Urban Larsson; 4. Unsolved problems in combinatorial games Richard J.
Nowakowski; 5. Absolute combinatorial game theory Urban Larsson, Richard J.
Nowakowski and Carlos P. Santos; 6. Affine normal play Urban Larsson,
Richard J. Nowakowski and Carlos P. Santos; 7. On the general dead-ending
universe of partizan games Aaron N. Siegel; 8. Infinitely many absolute
universes Urban Larsson, Richard J. Nowakowski and Carlos P. Santos; 9.
Reversibility, canonical form, and invertibility in dead-ending misère play
Urban Larsson, Rebecca Milley, Richard J. Nowakowski, Gabriel Renault and
Carlos P. Santos; 10. Dead-ending day-2 games under misère play Aaron
Dwyer, Rebecca Milley and Michael Willette; 11. All passable games are
realizable as monotone set coloring games Eric Demer, Peter Selinger and
Kyle Wang; 12. Values of generic impartial combinatorial games Eric
Friedman; 13. A family of Nim-like arrays: stabilization Lowell Abrams and
Dena S. Cowen-Morton; 14. Memgames Urban Larsson, Simon Rubinstein-Salzedo
and Aaron N. Siegel; 15. The bishop and knight checkmate on a large
chessboard Johan Wästlund; 16. An update on the coin-moving game on the
square grid Florian Galliot, Sylvain Gravier and Isabelle Sivignon; 17. P
play in Candy Nim Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo and
Alexa Tholen; 18. Keeping your distance is hard Kyle Burke, Silvia Heubach,
Melissa A. Huggan and Svenja Huntemann; 19. Improving upper and lower
bounds of the number of games born by day 4 Koki Suetsugu; 20.
Lexicographic Wythoff David Klein and Aviezri S. Fraenkel; 21. Corner the
empress Robbert Fokkink, Gerard Francis Ortega and Dan Rust; 22. m-modular
Wythoff Tanya Khovanova and Nelson Niu.
absolute restrictions: a survey Alfie M. Davies, Urban Larsson, Rebecca
Milley, Richard J. Nowakowski, Carlos P. Santos and Aaron N. Siegel; 2. A
brief conversation about subtraction games Urban Larsson, Indrajit Saha and
Koki Suetsugu; 3. Survey on Richman bidding combinatorial games Prem Kant
and Urban Larsson; 4. Unsolved problems in combinatorial games Richard J.
Nowakowski; 5. Absolute combinatorial game theory Urban Larsson, Richard J.
Nowakowski and Carlos P. Santos; 6. Affine normal play Urban Larsson,
Richard J. Nowakowski and Carlos P. Santos; 7. On the general dead-ending
universe of partizan games Aaron N. Siegel; 8. Infinitely many absolute
universes Urban Larsson, Richard J. Nowakowski and Carlos P. Santos; 9.
Reversibility, canonical form, and invertibility in dead-ending misère play
Urban Larsson, Rebecca Milley, Richard J. Nowakowski, Gabriel Renault and
Carlos P. Santos; 10. Dead-ending day-2 games under misère play Aaron
Dwyer, Rebecca Milley and Michael Willette; 11. All passable games are
realizable as monotone set coloring games Eric Demer, Peter Selinger and
Kyle Wang; 12. Values of generic impartial combinatorial games Eric
Friedman; 13. A family of Nim-like arrays: stabilization Lowell Abrams and
Dena S. Cowen-Morton; 14. Memgames Urban Larsson, Simon Rubinstein-Salzedo
and Aaron N. Siegel; 15. The bishop and knight checkmate on a large
chessboard Johan Wästlund; 16. An update on the coin-moving game on the
square grid Florian Galliot, Sylvain Gravier and Isabelle Sivignon; 17. P
play in Candy Nim Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo and
Alexa Tholen; 18. Keeping your distance is hard Kyle Burke, Silvia Heubach,
Melissa A. Huggan and Svenja Huntemann; 19. Improving upper and lower
bounds of the number of games born by day 4 Koki Suetsugu; 20.
Lexicographic Wythoff David Klein and Aviezri S. Fraenkel; 21. Corner the
empress Robbert Fokkink, Gerard Francis Ortega and Dan Rust; 22. m-modular
Wythoff Tanya Khovanova and Nelson Niu.







