Skip to main content Accessibility help
×
Hostname: page-component-6bb9c88b65-kfd97 Total loading time: 0 Render date: 2025-07-24T05:27:11.395Z Has data issue: false hasContentIssue false

Eyespace Values in Go

Published online by Cambridge University Press:  27 June 2025

Richard J. Nowakowski
Affiliation:
Dalhousie University, Nova Scotia
Get access

Summary

Most of the application of combinatorial game theory to Go has been focussed on late endgame situations and scoring. However, it is also possible to apply it to any other aspect of the game that involves counting. In particular, life-and-death situations often involve counting eyes. Assuming all surrounding groups are alive, a group that has two or more eyes is alive, and a group that has one eye or less is dead.

This naturally raises the question of which game-theoretical values can occur for an eyemaking game. We define games that provide a theoretical framework in which this question can be asked precisely, and then give the known results to date. For the single-group case, eyespace values include 0, , and several ko-related loopy games, as well as some seki-related values. The eye is well-understood in traditional Go theory, and only a little less so, but, and

may be new discoveries, even though they occur frequently in actual games.

For a battle between two or more opposed groups, the theory gets more complicated.

1. Go

1.1. Rules of Go. Go is played on a square grid with Black and White stones. The players alternate turns placing a stone on an unoccupied intersection. Once placed, a stone does not move, although it may sometimes be captured and removed from the board.

Stones of the same color that are adjacent along lines of the grid are considered to be connected into a single indivisible unit For example, if one takes the subgraph of the board grid whose vertices are the intersections with Black stones and whose edges are the grid lines that connect two such vertices, the Black units are the connected components of that subgraph.

Information

Type
Chapter
Information
Games of No Chance
Combinatorial Games at MSRI, 1994
, pp. 227 - 258
Publisher: Cambridge University Press
Print publication year: 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

Accessibility standard: Unknown

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge-org.demo.remotlog.com is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×