Skip to main content Accessibility help
×
Hostname: page-component-77f85d65b8-5ngxj Total loading time: 0 Render date: 2026-04-14T08:49:38.354Z Has data issue: false hasContentIssue false

Navigating the MAZE

Published online by Cambridge University Press:  30 May 2025

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

Summary

The game of MAZE was introduced in 2006 by Albert, Nowakowski and Wolfe, and is an instance of an option-closed game and as such each position has reduced canonical form equal to a number or a switch. It was conjectured that because of the 2-dimensional structure of the board there was a bound on the denominator of the numbers which appeared as numbers or in the switches. We disprove this by constructing, for each number and each switch, a MAZE position whose reduced canonical form is that value. Surprisingly, we can also restrict the interior walls to be in one direction only, seemingly giving an advantage to one player. This also gives a linear time algorithm that determines the best move up to an infinitesimal.

MAZE was introduced in [Albert et al. 2007], but apart from a few scattered observations, nothing was known about the values of the game. In the original article, MAZE is played on a rectangular grid oriented 45 to the horizontal.

The token starts at the top of the board and highlighted edges are walls that may not be crossed. Left is allowed to move a token any number of cells in a southwesterly direction and Right is allowed to move similarly in a southeasterly direction. However, for ease of referring to specific places in the position, we re-orient the sides parallel to the page so that Left moves downward and Right moves to the right; see Figure 1. One interesting feature is that any number of consecutive Left (Right) moves also can be accomplished in one move. This feature had been noted in several games, including HACKENBUSH strings [Berlekamp et al. 2001], and given the name of option-closed in [Nowakowski and Ottaway 2011], a reference we henceforth abbreviate as [NO]. Siegel [2011] notes that the partial order of option-closed games born on day n forms a planar lattice.

Information

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

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org 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
×