FBI Agent Alice is hot on the trail of computer hacker Bob, who is hiding in one of 17 caves. The caves form a linear array, and every night Bob moves from the cave he is in to one of the caves on either side of it. Alice can search two caves each day, with no restrictions on her choice.
For example, if Alice searches (1 2), (2 3), ..., (16 17), then she is certain to catch Bob, though it might take her 16 days.
What is the shortest time in which Alice can be guaranteed of catching Bob?
(In reply to
An improvement, but not a provable minimum by Paul)
Start with (2-4) and you save one move
|
|
Posted by mario
on 2018-05-28 05:06:19 |
re: An improvement, but not a provable minimum
