AP CSP Halving Hunter Game | Binary Search in log2(n) Guesses | Topic 3.11

Halving Hunter

Find the number the way binary search would - and see why a list twice as long costs one more guess

Round 1 / 5 Guesses: 0 Par: 4 Score: 0

How to play: a number is hidden in the range below. Guess, and the range narrows to whatever is still possible. Par is the number of guesses binary search needs in the worst case, which is how many times you can halve the range before one value is left.

Somewhere from 1 to 16

116

Get in Touch

Whether you're a student, parent, or teacher — I'd love to hear from you.

Just want free AP CS resources?

Enter your email below and check the subscribe box — no message needed. Students get daily practice questions and study tips. Teachers get curriculum resources and teaching strategies.

Typically responds within 24 hours
✓

Message Sent!

Thanks for reaching out. I'll get back to you within 24 hours.

🏫 Welcome, fellow educator!

I offer curriculum resources, practice materials, and study guides designed for AP CS teachers. Let me know what you're looking for — whether it's classroom materials, a guest speaker, or Teachers Pay Teachers resources.

✉

Email

[email protected]

📚

Courses

AP CSA, CSP, & Cybersecurity

⏱

Response Time

Within 24 hours

Prefer email? Reach me directly at [email protected]