Timeline for Two Sheriffs and Eavesdroppers - 2
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 18, 2023 at 15:34 | comment | added | mathlander | We can use your method combined with this method. | |
| Sep 18, 2023 at 2:06 | comment | added | mathlander | This question might be good for this method. puzzling.stackexchange.com/questions/122397/… | |
| Apr 22, 2015 at 17:33 | history | edited | LowIntHighCha | CC BY-SA 3.0 |
more explanation
|
| Apr 22, 2015 at 16:16 | history | edited | LowIntHighCha | CC BY-SA 3.0 |
fixing problems
|
| Apr 22, 2015 at 16:01 | comment | added | LowIntHighCha | You're right... Hmm. Think I need to manipulate the shortlists suggested by sheriff 2 for this to work properly. | |
| Apr 22, 2015 at 15:29 | comment | added | Yoav Kallus | Unfortunately, when S1 says the criminal is in either {a,d} or {b,f}, they are unwittingly tipping the mob off to the fact {a,b} was their list: that's the only pair from the original list with both elements represented in the new lists. Since we are assuming the mob knows the detail of the protocol (e.g. sheriffs can't simply speak in code), the mob knows that the pair satisfying that criterion is S1's list. | |
| Apr 22, 2015 at 14:43 | history | answered | LowIntHighCha | CC BY-SA 3.0 |