[Guest]

100 prisoners are assigned a random number 1-100, no repeats. no prisoner knows what their number is.

two prisoners chosen at random enter a room. each time they enter, they can communicate, and the warden will tell them which greater or less, but still won't be given their number. when a prisoner knows everyone's number, he can declare so. if he's wrong however it means five more years of prison for everyone.

what's the best strategy they can make?

[Quantum.Mechanic]

100 prisoners are assigned a random number 1-100, no repeats. no prisoner knows what their number is.

two prisoners chosen at random enter a room. each time they enter, they can communicate, and the warden will tell them which greater or less, but still won't be given their number. when a prisoner knows everyone's number, he can declare so. if he's wrong however it means five more years of prison for everyone.

what's the best strategy they can make?

Assumptions?

* No communication after the experiment starts?

* Can communicate before experiment starts?

[Guest]

Each time two prisoners meet they share with each other ALL the information they know, as in let's say prisoner a knew that a>t, t<k, k>l

prisoner b knew that

b<i, i<l

They'd both combine their info and also add the info that a>b or b>a, once one of the prisoners have enough info to sort everyone he'll speak, but you'd have to have ALOT of info and also for each neighboring prisoners (one's who's numbers come after each other, i.e 21 & 22) the only way you can know which is which is when they're both compared with each other, cause otherwise their comparison with every other prisoner is the same...