Here's the new thread for posting quotes, with the usual rules:
- Please post all quotes separately, so that they can be voted up/down separately. (If they are strongly related, reply to your own comments. If strongly ordered, then go ahead and post them together.)
- Do not quote yourself.
- Do not quote comments/posts on LW/OB.
- No more than 5 quotes per person per monthly thread, please.
Are you familiar with the seemingly similar question about the prisoners, king, and coin? I don't know the name, but it goes like this:
The answer is yes, and there's a known bound on how long it takes. (Got this from slashdot a long time ago.)
Edit: Found it. Here's the discussion that spawned it, and here's the thread that introduces this problem, and here's a comment with a solution. Apparently, the problem has a name it goes by.
Edit2: This also serves as a case study in how to present a problem as succinctly as possible. The only thing I got wrong about its statement was that the king chooses the order of the prisoners going into the CC (rather than it being random), although given the constraint that each prisoner is eventually brought in infinite times, and the strategy must work all the time, I don't think it changes the problem.
Doesn't your comment on Slashdot indicate that there is no solution?