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.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
No Subject | Comment 3 of 4 |
There is some ambiguity in the word "catch". If the search only deduces which cave he is in, has he been caught? For example, if there are only three caves and he is not in the two searched, has he then been caught in the third?
  Posted by Steven Lord on 2018-05-04 11:09:52
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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