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

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

2012-04-24

arxiv.org/abs/1204.5490v1

Mathematics

Combinatorics

8 pages

Scientific paper

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 find the princess.

Affiliated with

Also associated with

No associations

Rating

Finding a princess in a palace: A pursuit-evasion problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding a princess in a palace: A pursuit-evasion problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding a princess in a palace: A pursuit-evasion problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136930