10

Improvement on the 2-explorer case: First attempt at 3-explorer case, using the same strategy and formatting:


5

I think it's a safe assumption that the answer will be of the form: The reasoning is that Now, we want to get the longest sequence. To achieve this For instance, if we try Let's try another: Going even lower is not an alternative, since: Without a rigorous proof I'm going to say the combination is:


1

Here a possible a possible solution to the 4 explorer case, inspired by hdsdv's answer:


1

Assuming that water cannot be dropped, and return trips cannot be made, which leaves the puzzle as the simplest form described in the question: Reasoning:


1

Question 3 (2 Explorers): Question 2 (3 Explorers): Question 1 (4 Explorers):


1

For the sake of this example, I assume a ball to be removed from the set once its position has been identified. I got it in 10 steps. (Thanks for the improvements) Steps 1-3: Step 4: Step 5: Step 6: Step 7: Step 8/9: Step 10) Please note that this solution may exit differently and take different logic in non-worst-case scenarios.


1

to move 3000 bananas by 1 km, camel consumes 5 bananas which with five trips. so not when number of bananas are less than or equal to 2000 the trips required is 3. so to consume 1000 bananas 5x = 1000 move 3000 bananas for x=200 miles ( 5 trips). we are left with 2000 bananas. now we have 2000 bananas and we can move bananas in 3 trips 3x =1000 move ...


Only top voted, non community-wiki answers of a minimum length are eligible