ePrints

Finding a princess in a palace: A pursuit-evasion problem

Lookup NU author(s): Dr John Britnell

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied 'Cops and Robbers Game', the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to and the princess.

Publication metadata

Author(s): Britnell JR, Wildon M

Publication type: Article

Publication status: Published

Journal: Electronic Journal of Combinatorics

Year: 2013

Volume: 20

Issue: 1

Online publication date: 05/02/2013

ISSN (electronic): 1077-8926

Publisher: Australian National University

URL: https://doi.org/10.37236/2296

DOI: 10.37236/2296

Altmetrics

Share