Дискретная математика
Математика
  • формат pdf
  • размер 6.32 МБ
  • добавлен 28 октября 2011 г.
Nowakowski R.J. Games of no Chance
Издательство MRSI, 1996, -482 pp.

Combinatorial Game Theory, as an academic discipline, is still in its infancy. Many analyses of individual games have appeared in print, starting in 1902 with C. L. Bouton's analysis of the game of Nim. (For exact references to the works mentioned here, please see A. Fraenkel's bibliography on pages
493. It is was not until the 1930's that a consistent theory for impartial games was developed, independently, by R. Sprague and P. M. Grundy, later to be expanded and expounded upon by R. K. Guy and C. A. B. Smith. (Guy is still going strong, as evidenced by his energy at this Workshop.) J. H. Conway then developed the theory of partizan games, which represented a major advance. Based on this theory, D. Knuth wrote his mode moral tale, Surreal Numbers. The collaboration of E. R. Berlekamp, J. H. Conway and R. K. Guy gave us Winning Ways, which \set to music", or at least to \rhyme", the theory so far. In the process, many more games were discovered and analyzed: but more were discovered than solved!
This Workshop, held from 11 to 21 July 1994, gave evidence of the growing interest in combinatorial games on the part of experts from many fields: mathematicians, computer scientists, researchers in artificial intelligence, economists, and other social scientists. Players, some of whom make their living from games, also attended. Visitors such as D. Knuth and H. Wilf dropped in for a few hours or days and gave impromptu lectures. There was much cross-fertilization of ideas, as could be expected from a meeting of people from such varied back- grounds. One major paper by A. Fraenkel (pages 417{431) was conceived and essentially written during the Workshop, being inspired by V. Pless's talk. But the Workshop was not all seminars. There were books, games and puzzles on display. Two official touaments, Dots-and-Boxes and Domineering, attracted a lot of participants, and carried $500 first prizes (funded by E. R. B.) The final matches were shown over closed-circuit TV, so that the spectators could have a running commentary! (See pages 79{
89.) Neither game is completely solved: Dots-and-Boxes is played by many school children, yet still holds mysteries for adults.
The articles in this volume are divided into four groups. Part I is introductory. Part II contains papers on some of the classical" games, such as chess and Go. Part III studies many other games, of greatly varying degrees of difficulty. Part IV contains articles that push the traditional theory in new directions: for example, by considering games more general than the strict definition of combinatorial games allows (see pages 1 and 363). The book closes with a list of unsolved problems by R. K. Guy, and a Master Bibliography by A. Fraenkel. The increasing role of computers can be witnessed throughout, in areas ranging from the solution of particular games to the use of the computer in teaching humans.
The Angel Problem.
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess.
Championship-Level Play of Dots-and-Boxes.
Championship-Level Play of Domineering.
The Gamesman's Toolkit.
Solving Nine Men's Morris.
Marion Tinsley: Human Perfection at Checkers?
Solving the Game of Checkers.
On Numbers and Endgames: Combinatorial Game Theory in Chess Endgames.
Multilinear Algebra and Chess Endgames.
Using Similar Positions to Search Game Trees.
Where Is the \Thousand-Dollar Ko"?
Eyespace Values in Go.
Loopy Games and Go.
Experiments in Computer Go Endgames.
Sowing Games.
New Toads and Frogs Results.
Xdom: A Graphical, X-Based Front-End for Domineering.
Infinitesimals and Coin-Sliding.
Geography Played on Products of Directed Cycles.
Pentominoes: A First Player Win.
New Values for Top Entails.
Take-Away Games.
The Economist's View of Combinatorial Games.
Games with Infinitely Many Moves and Slightly Imperfect Information.
The Reduced Canonical Form of a Game.
Error-Correcting Codes Derived from Combinatorial Games.
Tutoring Strategies in Game-Tree Search.
Richman Games.
Stable Winning Coalitions.
Unsolved Problems in Combinatorial Games.
Combinatorial Games: Selected Bibliography with a Succinct Gourmet Introduction.
Похожие разделы
Смотрите также

Albert M.H., Nowakowski R.J. Games of No Chance 3

  • формат pdf
  • размер 3.45 МБ
  • добавлен 28 октября 2011 г.
Издательство Cambridge University Press, 2009, -586 pp. Nowakowski. Highlights include some of Aaron N. Siegel’s groundbreaking work on loopy games, the unveiling by Eric J. Friedman and Adam S. Landsberg of the use of renormalization to give very intriguing results about Chomp, and Teigo Nakamura’s Counting liberties in capturing races of Go. Like its predecessors, this book should be on the shelf of all serious games enthusiasts. Surveys. Playi...

Bollob?s B. (ed.) Advances in Graph Theory

  • формат djvu
  • размер 2.16 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1978, -305 pp. Annals of Discrete Mathematics, Number 3. which received an equally memorable reply. Several of the papers were quickly and efficiently retyped by Mrs. J.E. Scutt. The editorial burden was greatly relieved by the excellent work of Mr. A.G. Thomason. Linear separation of dominating sets in graphs. Regularisable graphs. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Extremal gr...

Bollob?s B. (ed.) Graph Theory

  • формат djvu
  • размер 1.12 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1982, -210 pp. Annals of Discrete Mathematics, Number 13. Proceedings of the Conference on Graph Theory, Cambridge. The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contributions, suitably refereed and revised. For many years now,...

Diestel R. Graph Theory

  • формат djvu
  • размер 2.43 МБ
  • добавлен 01 января 2011 г.
Springer, 2005. - 410 pages. The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more a...

Erickson M. Pearls of Discrete Mathematics

  • формат pdf
  • размер 1.44 МБ
  • добавлен 06 февраля 2011 г.
CRC, 2009. - 280 pages. Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics. Each chapter begins with a mathematical teaser to engage readers and includes a particularly surprising, stun...

Jukna S. Boolean Function Complexity. Advances and Frontiers

  • формат pdf
  • размер 2.98 МБ
  • добавлен 24 октября 2011 г.
Издательство Springer, 2011, -633 pp. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this complexity Waterloo that have been discovered over the past several decades, right up to results from the last year or two. Many open problems...

Kaiser L. Logic and Games on Automatic Structures. Playing with Quantifiers and Decompositions

  • формат pdf
  • размер 1.15 МБ
  • добавлен 05 декабря 2011 г.
Издательство Springer, 2011, -125 pp. Since 2002, FoLLI, the Association for Logic, Language, and Information (www.folli.org), has awarded an annual prize for an outstanding dissertation in the fields of logic, language, and information. The prize is named after the well-known Dutch logician Evert Willem Beth, whose interdisciplinary interests are in many ways exemplary of the aims of FoLLI. It is sponsored by the E.W. Beth Foundation. Dissertat...

No J.-S., Song H.-E., Helleset T., Kumar P.V. (eds.) Mathematical Properties of Sequences and other Combinatorial Structures

  • формат djvu
  • размер 6.03 МБ
  • добавлен 04 октября 2011 г.
Издательство Kluwer, 2003, -133 pp. This proceedings is for the most part, a collection of papers presented in the three-day onference, held in Los Angeles, May 30 - June 1,2002, celebrating the 70th bIrthday of Professor Solomon W. Golomb. All contributions to the proceedings were peer-reviewed. Reflecting the interests of Professor Golomb, the major topics include sequences and combinatorial structures and range in treatment from pure theory" t...

Nowakowski R.J. More Games of No Chance

  • формат pdf
  • размер 4.68 МБ
  • добавлен 28 октября 2011 г.
Издательство Cambridge University Press, 2002, -547 pp. This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains articles by some of the foremost researchers and pioneers of combinatorial game theory, such as Elwyn Berlekamp and John Conway, by other researchers in mathematics and computer science, and by top game players. The articles run the gamut from new theoretical a...

Ore O. Graphs and their Uses

  • формат djvu
  • размер 1.07 МБ
  • добавлен 28 октября 2011 г.
The Mathematical Association of America, 1996, -158 pp. This book is one of a series written by professional mathematicians in order to make some important mathematical ideas interesting and understandable to a large audience of high school students and laymen. Most of the volumes in the New Mathematical Library cover topics not usually included in the high school curriculum; they vary in difficulty, and, even within a single book, some parts req...