Timeline for Puzzle to find one good person
Current License: CC BY-SA 3.0
7 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/
|
|
| Jun 26, 2016 at 0:30 | comment | added | Jonathan Allan | There is one more optimisation for $N$ computers/people and unknown $j<\frac{N}2$ jokers/faulty computers - if $N>4$ and even we can discard one person from the pool right at the start and use $N−3$ questions. The full solution to a puzzle of the same form was provided by Chris Peikert, Grant Wang, and Abhi Shelat of MIT (I don't know if they were the first to ever solve it this way though). | |
| Jun 24, 2016 at 22:56 | history | edited | Gareth McCaughan♦ | CC BY-SA 3.0 |
added 380 characters in body
|
| Jun 24, 2016 at 19:36 | history | edited | Jonathan Allan | CC BY-SA 3.0 |
added 1 character in body
|
| Jun 24, 2016 at 17:12 | history | edited | Gareth McCaughan♦ | CC BY-SA 3.0 |
added 2757 characters in body
|
| Jun 24, 2016 at 16:25 | comment | added | Jonathan Allan | Yes, I was thinking about ways to use who answered what to improve upon my strategy. I didn't think to check for the similar problem (of which it looks like this is indeed a sub-problem). | |
| Jun 24, 2016 at 16:09 | history | answered | Gareth McCaughan♦ | CC BY-SA 3.0 |