Presents mathematical techniques for solving late-stage endgame problems. Uses combinational game theory, which Berlekamp (mathematics, UC Berkeley) helped develop, to solve Go-related problems. The theory presented assigns each active area on the board an abstract value and shows how to compare them to select the optimum move or add them up to determine the ideal outcome. Values can be familiar numbers and fractions, or other abstractions. Includes an overview of the mathematics of games, Go rules and history, and a glossary. Annotation copyright Book News, Inc. Portland, Or.
The ancient game of Go is one of the less obvious candidates for mathematical analysis. With the development of new concepts in combinatorial game theory, the authors have been able to analyze Go games and find solutions to real endgame problems that have stumped professional Go players. Go players with an interest in mathematics and mathematicians who work in game theory will not want to miss this book because it describes substantial connections between the two subjects that have been, until now, largely unrecognized.
The ancient game of Go is one of the less obvious candidates for mathematical analysis
Foreword, Preface, List of Figures, 1: Introduction, 2: An Overview, 3:
Mathematics of Games, 4: Go Positions, 5: Further Research, A Rules of Go A
Top-down Overview, Foundations of the Rules of Go, Bibliography, Index
David Wolfe, Elwyn Berlekamp