Author |
Topic: Guards (Read 519 times) |
|
R
Senior Riddler
   
 Addicted!!!
Gender: 
Posts: 502
|
57 security guards are positioned so that no two pairs of guards are the same distance apart. Every guard watches the guard closest to him. Is there an arrangement of the guards so that every guard is being watched?
|
|
IP Logged |
The first experience seems like Magic, but the second tells you the Trick behind it.
|
|
|
towr
wu::riddles Moderator Uberpuzzler
    
 Some people are average, some are just mean.
Gender: 
Posts: 13730
|
 |
Re: Guards
« Reply #1 on: Mar 19th, 2010, 2:41am » |
Quote Modify
|
If you have a series of guards where A watches B watched C etc, then each distance from one to the next is smaller, which means that last one cannot be watching A, because then A would also watch him. So with the exception of isolated pairs of agents we have a graph without cycles). Which means the graph is a collection of pairs and trees, and in the trees the leaves are unwatched.
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
Grimbal
wu::riddles Moderator Uberpuzzler
    

Gender: 
Posts: 7527
|
 |
Re: Guards
« Reply #2 on: Mar 19th, 2010, 3:02am » |
Quote Modify
|
And with an odd number of guards, you can not have only 2-cycles (bi-cycles?).
|
« Last Edit: Mar 19th, 2010, 3:02am by Grimbal » |
IP Logged |
|
|
|
|