Mathematical Go: An analysis.
Item
-
Title
-
Mathematical Go: An analysis.
-
Identifier
-
AAI9315498
-
identifier
-
9315498
-
Creator
-
Rappaport, Melvin.
-
Contributor
-
Adviser: Michael Anshel
-
Date
-
1993
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Computer Science | Recreation
-
Abstract
-
Elwyn R. Berlekamp presented the first major paper on Mathematical Go in August 1990 (BE2). David S. Wolfe, his student, completed his thesis on certain specific shapes occurring in Mathematical Go in 1991 (WD1). Both of these works addressed an audience familiar with the combinatoric developed in "Winning Ways for your mathematical plays" (BE1).;This thesis attempts to bring the ideas of Mathematical Go to the computer science and go playing communities. It discusses how to play Mathematical Go, how to solve Mathematical Go problems, and how to design Mathematical Go problems.;It introduces the methodology of tiles in analyzing problems. It discusses an enumeration of tiles suitable for a computer program.;It introduces new notation to clarify ideas: complete game trees, chilled and unchilled trees, labeled immortal stones, actual values instead of normalized values, settled territory, and Black-White-Shared-Empty symmetries.;The correspondence Mathematical Go outcomes and go scoring, both Japanese and Chinese, is developed.;Berlekamp's and Wolfe's approaches to ko and sente/gote are explained and alternative views are presented.;The relevance of Mathematical Go to computer go is discussed.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
