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

 Catching your enemy (Posted on 2008-08-25)
You are hot on the trail of an enemy, who is hiding in one of 17 caves.

The caves form a linear array, and every night your enemy moves from the cave he is in to one of the caves on either side of it.

You can search two caves each day, with no restrictions on your choice. For example, if you search (1, 2), (2, 3), ..., (16, 17), then you are certain to catch him, though it might take you 16 days.

What is the shortest time in which you can be guaranteed of catching your enemy?

 See The Solution Submitted by pcbouhid Rating: 2.3333 (3 votes)

 Subject Author Date re: Better solution than The Solution - Yes, it is pcbouhid 2008-12-26 12:33:30 re: Better solution than The Solution - can be pcbouhid 2008-12-23 14:55:33 Better solution than The Solution AvalonXQ 2008-12-22 17:34:40 re(2): solution jpy 2008-09-07 23:59:16 re: Where's Paulo? pcbouhid 2008-09-06 19:01:19 Where's Paulo? ed bottemiller 2008-09-05 17:00:58 re: solution Dej Mar 2008-09-05 01:32:33 solution jpy 2008-09-05 00:48:03 re: question ed bottemiller 2008-08-28 19:01:05 question Gamer 2008-08-25 23:17:02 re(3): interesting question Gamer 2008-08-25 23:12:29 re(3): interesting question ed bottemiller 2008-08-25 23:08:28 re(2): interesting question Daniel 2008-08-25 22:38:27 re: interesting question brianjn 2008-08-25 21:55:53 interesting question Daniel 2008-08-25 21:15:49 14 or 15? ed bottemiller 2008-08-25 16:24:56 re: Slowly, slowly, catchee... Dej Mar 2008-08-25 13:20:26 Slowly, slowly, catchee... ed bottemiller 2008-08-25 13:00:19 Solution Dej Mar 2008-08-25 11:45:59 Solution K Sengupta 2008-08-25 10:31:32

 Search: Search body:
Forums (0)