Do not attempt this problem until you have solved
The Hardest Prisoner Problem Ever (Part 1)
and
The Hardest Prisoner Problem Ever (Part 2)
.
This problem is the same as Part 1 except:
Assuming that the prisoners use the fastest possible strategy, approximately how long will the game take as a function of the number of prisoners, ? (i.e. what is O(fastest strategy)?)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I guessed, wow i'm smart!