#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2001

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Robert A. Hearn, Erik D. Demaine
- Theor. Comput. Sci.
- 2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum inflow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACE-complete by a reduction from Quantified Boolean Formulas. We… (More)

- Robert A. Hearn
- 2006

There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea… (More)

- Robert A. Hearn, Erik D. Demaine
- ICALP
- 2002

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum inflow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACE-complete by a reduction from Quantified Boolean Formulas. We… (More)

- ROBERT A. HEARN
- 2007

Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [3] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. 1 Konane is an ancient Hawaiian game,… (More)

- Erik D. Demaine, Robert A. Hearn
- 2008 23rd Annual IEEE Conference on Computational…
- 2008

We introduce a simple game family, called constraint logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be interpreted in many different game-theoretic settings, ranging from zero-player automata to a more economic setting of team multiplayer games with hidden information. Each setting… (More)

- Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
- CCCG
- 2002

We prove PSPACE-completeness of a class of pushing-block puzzles similar to the classic Sokoban, extending several previous results [1, 5, 12]. The puzzles consist of unit square blocks on an integer lattice; some of the blocks are movable. The robot may move horizontally and vertically in order to reach a specified goal position. The puzzle variants differ… (More)

- Richard Granger, Robert A. Hearn
- Scholarpedia
- 2007

- Robert A. Hearn
- 2003

Sliding-block puzzles have long fascinated aficionados of recreational mathematics. From Sam Loyd's infamous 14-15 puzzle to the latest whimsical variants such as Rush Hour TM , these puzzles seem to offer a maximum of complexity for a minimum of space. In the usual kind of sliding-block puzzle, one is given a box containing a set of rectangular pieces, and… (More)

- Robert A. Hearn
- ArXiv
- 2005

Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [2] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that… (More)

We show several natural questions about hinged dissec-tions of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them, can we swing the pieces on the hinges to transform one configuration to the other? We also consider variants in which the configurations must be convex, the placement of hinges… (More)