Matches in DBpedia 2015-10 for { ?s ?p "The 100 prisoners problem is a mathematical problem from probability theory and combinatorics. In this problem, in order to survive, 100 prisoners have to find their own numbers in one of 100 drawers. Thereby, each prisoner may open only 50 of the drawers and cannot communicate with the other prisoners. At first glance the situation appears hopeless, but a clever strategy exists which offers the prisoners a realistic chance of survival. The problem was first posed in 2003 by Danish computer scientist Peter Bro Miltersen."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- 100_prisoners_problem abstract "The 100 prisoners problem is a mathematical problem from probability theory and combinatorics. In this problem, in order to survive, 100 prisoners have to find their own numbers in one of 100 drawers. Thereby, each prisoner may open only 50 of the drawers and cannot communicate with the other prisoners. At first glance the situation appears hopeless, but a clever strategy exists which offers the prisoners a realistic chance of survival. The problem was first posed in 2003 by Danish computer scientist Peter Bro Miltersen.".