ENCHANTED FOREST
Firefly Halfway Hunt
A moon-firefly is hiding in one numbered tree. Search every tree and dawn will arrive first—so use the forest's halfway secret!
🧠 Before we start
At the Spellbook, you followed dependency links instead of guessing task order. Today, binary search uses another smart rule: in sorted data, test the middle and throw away the half that cannot contain the answer.
🔢 Keep it sorted→🎯 Test the middle→✂️ Remove half→🔁 Repeat
Challenge 1 of 4Prepare sorted trees
1
Choose a searchable tree row
Binary search needs values in order. Tap the row that rises from smallest to largest.
WHICH FOREST ROW IS SORTED?
Look from left to right: every next number must be larger.
2
Follow the halfway clues
The firefly is in tree 27. Tap the glowing middle of the remaining trees. The clue will keep only the possible half.
GUIDED HUNT · TARGET 270 checks
CLUES
Start with the middle—not the first tree.
3
Lead your own fast hunt
Now find tree 6. Recalculate the middle each time the remaining range gets smaller.
SOLO HUNT · TARGET 60 checks
CLUES
One-by-one worst case16checks
Halfway hunt at most5checks
Only the middle tree can split the remaining choices fairly.
4
Debug the missing boundary
The target is 24. We tested 20 and learned “higher,” but a buggy rule threw away 24 too. Choose the safe range update.
BOUNDARY BUG
12 · 16 · 20 · 24 · 28 · 32 · 36→ higher →28 · 32 · 36
24 vanished!
24 vanished!
A discarded boundary can hide the answer forever.
🌟 What you learned
- Binary search works when values are sorted.
- Testing the middle splits the remaining search space.
- A higher or lower clue lets the program discard half.
- Repeating that rule finds items with far fewer checks than one-by-one search.
- Range boundaries matter: skipping one valid item creates a search bug.