Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T17:06:30.857Z Has data issue: false hasContentIssue false

Loopy games

Published online by Cambridge University Press:  28 February 2011

Michael H. Albert
Affiliation:
University of Otago, New Zealand
Richard J. Nowakowski
Affiliation:
Dalhousie University, Nova Scotia
Get access

Summary

Abstract. We strengthen the usual notion of simplest form for stoppers and show that under the stronger definition, equivalence coincides with graphisomorphism. We then show that the game graph of a canonical stopper contains no 2- or 3-cycles, but may contain n-cycles for all n ≥ 4.

We also introduce several new methods for simplifying games γ whose graphs contain alternating cycles. These include a generalization of dominated and reversible moves.

Introduction

A loopy game is a combinatorial game in which repetition is permitted. The history and basic theory of loopy games are discussed in [Siegel 2009]. In this article we focus on two fundamental problems left unresolved by Winning Ways.

Long irreducible cycles. The first problem concerns the cycles that appear in the game graph of a stopper. Conway showed that every stopper s admits a simplest form [Conway 1978], so one would expect that certain cycles are intrinsic to the play of s. All canonical stoppers discussed in Winning Ways are plumtrees: their graphs contain only 1-cycles. It is therefore natural to ask whether longer canonical cycles are possible, and to attempt to characterize the structure of such cycles.

Conway defined the simplest form of s to be a representation with no dominated or reversible moves. This is not quite strong enough for our purposes, as illustrated by the example t shown in Figure 1. Certainly t has no dominated or reversible options, but it is easy to check that t = on.

Type
Chapter
Information
Games of No Chance 3 , pp. 215 - 232
Publisher: Cambridge University Press
Print publication year: 2009

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.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] 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
×