All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Where's Bob? (Posted on 2018-05-01) Difficulty: 3 of 5
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?

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 4.6667 (3 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(2): An improvement, but not a provable minimumPatronSurvey2019-03-04 07:02:54
re: An improvement, but not a provable minimummario2018-05-28 05:06:19
No SubjectSteven Lord2018-05-04 11:09:52
Solution10 daysMath Man2018-05-01 20:32:30
An improvement, but not a provable minimumPaul2018-05-01 15:04:51
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information