Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-06-16T21:31:55.799Z Has data issue: false hasContentIssue false

The complexity of Dyson Telescopes

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 give a PSPACE-completeness reduction from QBF (quantified Boolean formulas) to the Dyson Telescopes puzzle where opposing telescopes can overlap in at least two spaces. The reduction does not use tail ends of telescopes or initially partially extended telescopes. If two opposing telescopes can overlap in at most one space, we can solve the puzzle in polynomial time by a reduction to graph reachability.

Introduction

The complexity of many motion-planning problems has been studied extensively in the literature. This work has recently focused on very simple combinatorial puzzles (one-player games) that nonetheless exhibit the theoretical difficulty of general motion planning; see, e.g.,. Two main examples of this pursuit are a suite of pushing-block puzzles, culminating in, and a suite of problems involving sliding-block puzzles. In pushing-block puzzles, an agent must navigate an environment and push blocks in order to reach a goal configuration, while avoiding collisions. The variations of pushing blocks began with several versions that appeared in video games (the most classic being Sokoban), and continued to consider simpler and simpler puzzles with the goal of finding a polynomially solvable puzzle. Nonetheless, all reasonable pushing-block puzzles turned out to be NP-hard, and many turned out to be PSPACE-complete, with no problems known to be in NP, except in one trivial case where solution paths are forced to be short. Similarly, sliding-block puzzles are usually PSPACE-complete, even in very simple models.

Type
Chapter
Information
Games of No Chance 3 , pp. 271 - 286
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 coreplatform@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
×