Skip to main content Accessibility help
×
Hostname: page-component-6bb9c88b65-9c7xm Total loading time: 0 Render date: 2025-07-26T02:52:17.325Z Has data issue: false hasContentIssue false

The Economist's View of Combinatorial Games

Published online by Cambridge University Press:  27 June 2025

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

Summary

We introduce two equivalent methodologies for defining and computing a position's mean (value of playing Black rather than White) and temperature (value of next move). Both methodologies apply in more generality than the classical one. The first, following the notion of a free market, relies on the transfer of a “tax” between players, determined by continuous competitive auctions. The second relies on a generalized thermograph, which reduces to the classical thermograph when the game is loop-free.

When a sum of games is played optimally according the economic rules described, the mean (which is additive) and the temperature determine the final score precisely.

This framework extends and refines several classical notions. Thus, finite games that are numbers in Conway's sense are now seen to have negative natural temperatures. All games can now be viewed as terminating naturally with integer scores when the temperature reaches —1.

Introduction

At every position of a game such as Go or Domineering, there are two very important questions:

Who is ahead, and by how much?

How big is the next move?

Following Conway [1976], classical abstract combinatorial game theorists answer these questions with a value and an incentive, as discussed in Winning Ways [Berlekamp et al. 1982]. These answers are precisely correct when the objective of the game is to get the last legal move. Values and incentives are themselves games, and can quickly become complicated.

Our ideal economist takes a different view. Following Hanner [1959] and Milnor [1953], he views the game as a contest to accumulate points, which can eventually be converted into cash.

Information

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