100 prisoners problem
The 100 prisoners problem is a mathematical problem in probability theory and combinatorics. In this problem, 100 numbered prisoners must find their own numbers in one of 100 drawers in order to survive. The rules state that each prisoner may open only 50 drawers and cannot communicate with other prisoners. At first glance, the situation appears hopeless, but a clever strategy offers the prisoners a realistic chance of survival. Danish computer scientist Peter Bro Miltersen first proposed the problem in 2003.
Link from a Wikipage to another Wikipage
primaryTopic
100 prisoners problem
The 100 prisoners problem is a mathematical problem in probability theory and combinatorics. In this problem, 100 numbered prisoners must find their own numbers in one of 100 drawers in order to survive. The rules state that each prisoner may open only 50 drawers and cannot communicate with other prisoners. At first glance, the situation appears hopeless, but a clever strategy offers the prisoners a realistic chance of survival. Danish computer scientist Peter Bro Miltersen first proposed the problem in 2003.
has abstract
The 100 prisoners problem is a ...... proposed the problem in 2003.
@en
Link from a Wikipage to an external page
Wikipage page ID
43,181,502
page length (characters) of wiki page
Wikipage revision ID
1,004,471,313
Link from a Wikipage to another Wikipage
date
2014-07-14
direction
horizontal
@en
footer
Graph representations of the permutations and
@en
image
@en
@en
wikiPageUsesTemplate
hypernym
type
comment
The 100 prisoners problem is a ...... proposed the problem in 2003.
@en
label
100 prisoners problem
@en