Atnaujinkite slapukų nuostatas

El. knyga: Lessons in Play: An Introduction to Combinatorial Game Theory, Second Edition

(University of Otago, Dundedin, New Zealand), , (Dalhousie University, Halifax, Canada)
  • Formatas: 344 pages
  • Išleidimo metai: 30-Apr-2019
  • Leidėjas: Apple Academic Press Inc.
  • ISBN-13: 9780429524097
Kitos knygos pagal šią temą:
  • Formatas: 344 pages
  • Išleidimo metai: 30-Apr-2019
  • Leidėjas: Apple Academic Press Inc.
  • ISBN-13: 9780429524097
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

This second edition of Lessons in Play reorganizes the presentation of the popular original text in combinatorial game theory to make it even more widely accessible. Starting with a focus on the essential concepts and applications, it then moves on to more technical material. Still written in a textbook style with supporting evidence and proofs, the authors add many more exercises and examples and implement a two-step approach for some aspects of the material involving an initial introduction, examples, and basic results to be followed later by more detail and abstract results.

Features











Employs a widely accessible style to the explanation of combinatorial game theory





Contains multiple case studies





Expands further directions and applications of the field





Includes a complete rewrite of CGSuite material

Recenzijos

"The wisdom and joy outshining from this 2nd edition, beat even the original. The helpful preludes for student and instructor, prefacing each chapter, have elevated subtly in additional reader-friendliness; new subsections and a new case study were added. An interesting new Chapter 10 trades complex yet complete computation of a games strategy, with a simplified slightly approximate winning strategy. The last chapter, which awards the reader with a flavor of cutting edge research, was updated with a section on scoring games. The book is a must for novice and expert alike."

Aviezri Fraenkel, Weizmann Institute of Science, Israel

"In this second edition of Lessons in Play, the authors have corrected errors, updated the bibliography, and added a new chapter on trimming game trees. Like the first edition, this new edition is beautifully typeset and illustrated."

Brian Borchers, Editor, MAA Reviews

In this second edition of Lessons in Play: An Introduction to Combinatorial Game Theory, authors Albert , Nowakowski, and White provide a reorganized text presenting a variety of two-player finite games, discussed in theory as well as application. The theoretical material is presented in a clear and concise theorem/proof format and includes problems and exercises to aid readers understanding. Solutions are provided at the end of the book. Multiple examples from actual games are provided throughout, including Boxcars, Clobber, Cutthroat, Dots and Boxes, Hackenbush, and Toppling Dominoes. Throughout the text, the authors also provide in-depth case studies on specific games. A unique feature of this book is that each chapter begins by presenting a series of prep problems with notes to the instructor so students can preview the material prior to reading the chapter. Overall, this book is an excellent beginning read for anyone interested in learning about combinatorial games, assuming at least some background in abstract algebra.

S. L. Sullivan, Catawba College

Praise for the previous edition

This is an excellent introductory book to beginning game theory, written in an easily understandable manner yet advanced enough not to be considered trivial. Books Online, July 2007

The first book to present combinatorial game theory in the form of a textbook suitable for students at the advanced undergraduate level The authors state and prove theorems in a rigorous fashion [ and] the presentation is enlivened with many concrete examples an outstanding textbook It will also be of interest to more advanced readers who want an introduction to combinatorial game theory. Brian Borchers, June 2007

The theory is accessible to any student who has a smattering of general algebra and discrete math. Generally, a third year college student, but any good high school student should be able to follow the development with a little help. Sir Read a Lot, May 2007

Lessons in Play is an enticing introduction to the wonderful world of combinatorial games. Using a rich collection of cleverly captivating examples and problems, the authors lead the reader through the basic concepts and on to several innovative extensions. I highly recommend this book. Elwyn R. Berlekamp

A neat machine, converting novices into enthusiastic experts in modern combinatorial game theory. Aviezri Fraenkel

Combinatorial games are intriguing, challenging, and often counter-intuitive, and are rapidly being recognized as an important mathematical discipline. Now that we have the attractive and friendly text Lessons in Play in hand, we can look forward to the appearance of many popular upper-division undergraduate courses, which encourage instructors to learn alongside their students. Richard K. Guy

If you have Winning Ways, you must have this book. Andy Liu "The wisdom and joy outshining from this 2nd edition, beat even the original. The helpful preludes for student and instructor, prefacing each chapter, have elevated subtly in additional reader-friendliness; new subsections and a new case study were added. An interesting new Chapter 10 trades complex yet complete computation of a games strategy, with a simplified slightly approximate winning strategy. The last chapter, which awards the reader with a flavor of cutting edge research, was updated with a section on scoring games. The book is a must for novice and expert alike."

Aviezri Fraenkel, Weizmann Institute of Science, Israel

"In this second edition of Lessons in Play, the authors have corrected errors, updated the bibliography, and added a new chapter on trimming game trees. Like the first edition, this new edition is beautifully typeset and illustrated."

Brian Borchers, Editor, MAA Reviews

In this second edition of Lessons in Play: An Introduction to Combinatorial Game Theory, authors Albert , Nowakowski, and White provide a reorganized text presenting a variety of two-player finite games, discussed in theory as well as application. The theoretical material is presented in a clear and concise theorem/proof format and includes problems and exercises to aid readers understanding. Solutions are provided at the end of the book. Multiple examples from actual games are provided throughout, including Boxcars, Clobber, Cutthroat, Dots and Boxes, Hackenbush, and Toppling Dominoes. Throughout the text, the authors also provide in-depth case studies on specific games. A unique feature of this book is that each chapter begins by presenting a series of prep problems with notes to the instructor so students can preview the material prior to reading the chapter. Overall, this book is an excellent beginning read for anyone interested in learning about combinatorial games, assuming at least some background in abstract algebra.

S. L. Sullivan, Catawba College

Praise for the previous edition

This is an excellent introductory book to beginning game theory, written in an easily understandable manner yet advanced enough not to be considered trivial. Books Online, July 2007

The first book to present combinatorial game theory in the form of a textbook suitable for students at the advanced undergraduate level The authors state and prove theorems in a rigorous fashion [ and] the presentation is enlivened with many concrete examples an outstanding textbook It will also be of interest to more advanced readers who want an introduction to combinatorial game theory. Brian Borchers, June 2007

The theory is accessible to any student who has a smattering of general algebra and discrete math. Generally, a third year college student, but any good high school student should be able to follow the development with a little help. Sir Read a Lot, May 2007

Lessons in Play is an enticing introduction to the wonderful world of combinatorial games. Using a rich collection of cleverly captivating examples and problems, the authors lead the reader through the basic concepts and on to several innovative extensions. I highly recommend this book. Elwyn R. Berlekamp

A neat machine, converting novices into enthusiastic experts in modern combinatorial game theory. Aviezri Fraenkel

Combinatorial games are intriguing, challenging, and often counter-intuitive, and are rapidly being recognized as an important mathematical discipline. Now that we have the attractive and friendly text Lessons in Play in hand, we can look forward to the appearance of many popular upper-division undergraduate courses, which encourage instructors to learn alongside their students. Richard K. Guy

If you have Winning Ways, you must have this book. Andy Liu

Preface xi
0 Combinatorial Games
1(10)
0.1 Basic Terminology
3(4)
Problems
7(4)
1 Basic Techniques
11(24)
1.1 Greedy
11(3)
1.2 Symmetry
14(2)
1.3 Parity
16(1)
1.4 Give Them Enough Rope!
16(1)
1.5 Strategy Stealing
17(3)
1.6 Change the Game!
20(1)
1.7 Case Study: Long Chains in Dots & Boxes
21(8)
Problems
29(6)
2 Outcome Classes
35(24)
2.1 Outcome Functions
36(1)
2.2 Game Positions and Options
37(5)
2.3 Impartial Games: Minding Your Vs and Afs
42(3)
2.4 Case Study: Roll the Lawn
45(2)
2.5 Case Study: Timber
47(4)
2.6 Case Study: Partizan Endnim
51(3)
Problems
54(5)
3 Motivational Interlude: Sums of Games
59(16)
3.1 Sums
59(2)
3.2 Comparisons
61(5)
3.3 Equality and Identity
66(2)
3.4 Case Study: Domineering Rectangles
68(3)
Problems
71(4)
4 The Algebra of Games
75(30)
4.1 The Fundamental Definitions
75(9)
4.2 Games Form a Group with a Partial Order
84(5)
4.3 Canonical Form
89(7)
4.4 Case Study: Cricket Pitch
96(3)
4.5 Incentives
99(1)
Problems
100(5)
5 Values of Games
105(34)
5.1 Numbers
105(9)
5.2 Case Study: Shove
114(2)
5.3 Stops
116(2)
5.4 A Few All-Smalls: Up, Down, and Stars
118(6)
5.5 Switches
124(1)
5.6 Case Study: Elephants & Rhinos
125(2)
5.7 Tiny and Miny
127(1)
5.8 Case Study: Toppling Dominoes
128(3)
5.9 Proofs of Equivalence of Games and Numbers
131(2)
Problems
133(6)
6 Structure
139(16)
6.1 Games Born by Day 2
139(2)
6.2 Extremal Games Born by Day n
141(5)
6.3 More About Numbers
146(2)
6.4 The Distributive Lattice of Games Born by Day n
148(2)
6.5 Group Structure
150(1)
Problems
151(4)
7 Impartial Games
155(26)
7.1 A Star-Studded Game
156(2)
7.2 The Analysis of Nim
158(2)
7.3 Adding Stars
160(1)
7.4 A More Succinct Notation
161(2)
7.5 Taking-and-Breaking Games
163(2)
7.6 Subtraction Games
165(10)
7.7 Keypad Games
175(3)
Problems
178(3)
8 Hot Games
181(26)
8.1 Comparing Games and Numbers
182(3)
8.2 Coping with Confusion
185(3)
8.3 Cooling Things Down
188(7)
8.4 Strategies for Playing Hot Games
195(2)
8.5 Norton Products
197(3)
8.6 Domineering Snakes
200(2)
Problems
202(5)
9 All-Small Games
207(26)
9.1 Cast of Characters
208(7)
9.2 Motivation: The Scale of Ups
215(1)
9.3 Equivalence Under-sir
216(3)
9.4 Atomic Weight
219(4)
9.5 All-Small Shove
223(1)
9.6 More Toppling Dominoes
224(1)
9.7 Clobber
225(4)
Problems
229(4)
10 Trimming Game Trees
233(18)
10.1 Introduction
233(1)
10.2 Reduced Canonical Form
234(3)
10.3 Hereditary-Transitive Games
237(1)
10.4 Maze
238(1)
10.5 Ordinal Sum
239(3)
10.6 Stirling-Shave
242(4)
10.7 Even More Toppling Dominoes
246(2)
Problems
248(3)
ω Further Directions
251(8)
ω 1 Transfinite Games
251(1)
ω 2 Algorithms and Complexity
252(1)
ω 3 Loopy Games
253(1)
ω 4 Kos: Repeated Local Positions
254(1)
ω 5 Top-Down Thermography
254(1)
ω 6 Enriched Environments
255(1)
ω 7 Idempotents
255(1)
ω 8 Misere Play
255(1)
ω 9 Scoring Games
256(3)
A Top-Down Induction
259(12)
A.1 Top-Down Induction
259(1)
A.2 Examples
260(3)
A.3 Why Is Top-Down Induction Better?
263(2)
A.4 Strengthening the Induction Hypothesis
265(2)
A.5 Inductive Reasoning
267(1)
Problems
268(3)
B CGSuite
271(46)
B.1 Installing CGSuite
271(1)
B.2 Worksheet Basics
272(3)
B.3 Programming in CGSuite's Language
275(2)
C Solutions to Exercises
277(26)
D Rulesets
303(14)
Bibliography 317(4)
Index 321
Michael Albert - University of Otago



Richard Nowakowski - Dalhousie University



David Wolfe - Dalhousie University