وبلاگ بلیان

بازی‌های ترکیبی [یادداشت‌های سخنرانی آماده‌شده برای دوره کوتاه بازی‌های ترکیبی انجمن ریاضی آمریکا، برگزار شده در کلمبوس، اوهایو، ۶-۷ اوت ۱۹۹۰]

Combinatorial games [lecture notes prepared for the American Mathematical Society Short Course Combinatorial Games, held in Columbus, Ohio, August 6 - 7, 1990

معرفی کتاب «بازی‌های ترکیبی [یادداشت‌های سخنرانی آماده‌شده برای دوره کوتاه بازی‌های ترکیبی انجمن ریاضی آمریکا، برگزار شده در کلمبوس، اوهایو، ۶-۷ اوت ۱۹۹۰]» (با عنوان لاتین Combinatorial games [lecture notes prepared for the American Mathematical Society Short Course Combinatorial Games, held in Columbus, Ohio, August 6 - 7, 1990) نوشتهٔ Richard K. Guy; John H. Conway; Elwyn R. Berlekamp; Vera Pless; Aviezri S. Fraenkel; Richard J. Nowakowski، منتشرشده توسط نشر American Mathematical Society در سال 1991. این کتاب در فرمت djvu، زبان انگلیسی ارائه شده است.

The subject of combinatorics is only slowly acquiring respectability and combinatorial games will clearly take longer than the rest of combinatorics. Perhaps this partly stems from the puritanical view that anything amusing can't possibly involve any worthwhile mathematics. from the Preface. Based on lectures presented at the AMS Short Course on Combinatorial Games, held at the Joint Mathematics Meetings , the ten papers in this volume will provide readers with insight into this exciting new field. (BULLET) In the opening paper, Guy contrasts combinatorial games, which have complete information and no chance moves, with those of classical game theory. Conway introduces a new theory of numbers, which has emerged as a special case of the theory of games. Guy describes impartial games, with the same options for both players, and the Sprague-Grundy theory. Conway discusses a variety of ways in which games can be played simultaneously. Berlekamp uses the theory of "hot" games to make remarkable progress in the analysis of Go Endgames. Pless demostrates the close connection between several impartial games and error-correcting codes. Fraenkel explains the way in which complexity theory is very well illustrated by combinatorial games, which supply a plethora of examples of harder problems than most of those which have been considered in the past. Nowakowski outlines the theory of three particular games - Welter's Game, Sylver Coinage, and Dots-and-Boxes. A list of three dozen open problems and bibliography of 400 items are appended

Based on lectures presented at the AMS Short Course on Combinatorial Games, held at the Joint Mathematics Meetings in Columbus in August 1990, the ten papers in this volume will provide readers with insight into this exciting field. Because the book requires very little background, it will likely find a wide audience that includes the amateur interested in playing games, the undergraduate looking for a new area of study, instructors seeking a refreshing area in which to give new courses at both the undergraduate and graduate levels, and graduate students looking for a variety of research topics. In the opening paper, Guy contrasts combinatorial games, which have complete information and no chance moves, with those of classical game theory. Conway introduces a new theory of numbers, including infinitesimals and transfinite numbers, which has emerged as a special case of the theory of games. Guy describes impartial games, with the same options for both players, and the Sprague-Grundy theory. Conway discusses a variety of ways in which games can be played simultaneously. Berlekamp uses the theory of ''hot'' games to make remarkable progress in the analysis of Go Endgames. Pless demonstrates the close connection between several impartial games and error-correcting codes. Fraenkel explains the way in which complexity theory is very well illustrated by combinatorial games, which supply a plethora of examples of harder problems than most of those which have been considered in the past. Nowakowski outlines the theory of three particular games—Welter's Game, Sylver Coinage, and Dots-and-Boxes. A list of three dozen open problems and a bibliography of 400 items are appended.

Lecture notes prepared for the American Mathematical Society short course Combinatorial games, held in Columbus, Ohio, August 6-7, 1990. What is a game? / Richard K. Guy Numbers and games / John Horton Conway Impartial games / Richard K. Guy More ways of combining games / John Horton Conway Introductory overview of mathematical go endgames / Elwyn Berlekamp Games and codes / Vera Pless Complexity of games / Aviezri S. Fraenkel ..., Welter's game, Sylver coinage, dots-and-boxes, ... / Richard J. Nowakowski Unsolved problems in combinatorial games / Richard K. Guy Contrasts combinatorial games, which have complete information and no chance moves, with those of classical game theory. This book introduces a theory of numbers, including infinitesimals and transfinite numbers, which has emerged as a special case of the theory of games. It also describes impartial games. Based on lectures presented at an AMS Short Course on combinatorial games, the ten papers in this volume are intended to provide insight into the new field of combinatorial games.
دانلود کتاب بازی‌های ترکیبی [یادداشت‌های سخنرانی آماده‌شده برای دوره کوتاه بازی‌های ترکیبی انجمن ریاضی آمریکا، برگزار شده در کلمبوس، اوهایو، ۶-۷ اوت ۱۹۹۰]