Skip to main content Accessibility help
×
Hostname: page-component-6bb9c88b65-znhjv Total loading time: 0 Render date: 2025-07-25T00:32:56.573Z Has data issue: false hasContentIssue false

Where Is the "Thousand-Dollar Ko"?

Published online by Cambridge University Press:  27 June 2025

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

Summary

This paper features a problem that was composed to illustrate the power of combinatorial game theory applied to Go endgame positions. The problem is the sum of many subproblems, over a dozen of which have temperatures significantly greater than one. One of the subproblems is a conspicuous four-point ko, and there are several overlaps among other subproblems. Even though the theory of such positions is far from complete, the paper demonstrates that enough mathematics is now known to obtain provably correct, counterintuitive, solutions to some very difficult Go endgame problems.

1. Introduction

Consider the boards in Figures 1 and 2, which differ only by one stone (the White stone a knight's move south-southwest of E in Figure 1 is moved to a knight's move east-southeast of R in Figure 2). In each case, it is White's turn to move. Play will proceed according to the Ing rules, as recommended by the American Go Association in February 1994. There is no komi. Both sides have the same number of captives when the problem begins.

We will actually solve four separate problems. In Figure 1, Problem 1 is obtained by removing the two stones marked with triangles, and Problem 2 is as shown. Does the removal of the two stones matter? In Figure 2, Problem 3 is obtained by removing the two marked stones, and Problem 4 is as shown. (Problem 3 appeared on the inside cover of Go World, issue 70.)

In each case, assume that the winner collects a prize of $1,000. If he wins by more than one point, he can keep the entire amount, but if he wins by only one point, he is required to pay the loser $1 per move.

Information

Type
Chapter
Information
Games of No Chance
Combinatorial Games at MSRI, 1994
, pp. 203 - 226
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
×