Timeline for Infinite wizards and hats
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:50 | history | edited | CommunityBot |
replaced http://puzzling.stackexchange.com/ with https://puzzling.stackexchange.com/
|
|
| Jan 20, 2016 at 18:14 | comment | added | dshin | Great, this looks much cleaner. Enjoy the check-mark! | |
| Jan 20, 2016 at 18:13 | vote | accept | dshin | ||
| Jan 20, 2016 at 18:04 | comment | added | Etoplay | I kept the complex version too because the simple version didn't specify the group sizes. But I realized that the group sizes are easily calculated from the win probabilities. | |
| Jan 20, 2016 at 18:01 | history | edited | Etoplay | CC BY-SA 3.0 |
Removed complex version and added group size calculation
|
| Jan 20, 2016 at 16:37 | comment | added | dshin | To expound on my comment, imagine a solution to a different problem that starts, "Partition the infinite wizards into groups of size 1, 2, 3, 4, 5, ...". That does not just prove existence; it provides construction. Assigning countably infinite elements to finite sets of given size is trivial and needs no further explanation. | |
| Jan 20, 2016 at 16:33 | comment | added | dshin | Nice. You have both shown existence and constructed the strategy through your edit. Now you can delete everything from "Complex constructing version..." onwards. | |
| Jan 20, 2016 at 12:39 | history | edited | Etoplay | CC BY-SA 3.0 |
added 1 character in body
|
| Jan 20, 2016 at 11:11 | comment | added | Etoplay | @dshin I have added that version. But it only shows that such a strategy exists. I think that isn't enough for the wizards; they also want to know what the strategy is. | |
| Jan 20, 2016 at 11:07 | history | edited | Etoplay | CC BY-SA 3.0 |
Added simplified answer
|
| Jan 20, 2016 at 1:10 | comment | added | dshin | This is the only submission that is correct. I would like to accept it but feel it can be greatly simplified. Why not simply cite xnor's answer to say that you can partition the wizards into finite groups where the $i$'th group wins with probability $(1-\epsilon)^{2^{-i}}$? | |
| Jan 19, 2016 at 10:45 | history | answered | Etoplay | CC BY-SA 3.0 |