xevion/100prisoners
1
0
Fork 0
mirror of https://github.com/Xevion/100prisoners.git synced 2025-12-10 10:06:32 -06:00
Code Issues Packages Projects Releases Wiki Activity

Improve premise explanation in index

Browse Source
This commit is contained in:
Xevion
2022-12-18 00:18:23 -06:00
parent 5e525a9000
commit a7532733f1
1 changed files with 20 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
src/pages/index.tsx
View File

@@ -19,19 +19,33 @@ const Home: NextPage = () => {
This website is dedicated to exploring the intriguing 100 prisoners problem, a mathematical
challenge that seems astronomically impossible at first, yet can leverage mathematics to
raise the chances one hundred octillion.
<br/>
<br/>
</p>
<p>
This thought experiment presents a scenario in which a group of 100 prisoners are tasked
with finding their own numbered slip among a collection of 100 boxes, each containing a
random permutation of the numbers 1 through 100.
</p>
<ul>
<li>
Each prisoner is allowed to open 50 boxes.
</li>
<li>
Each prisoner must find their own number within a box, or they fail.
</li>
<li>
All prisoners must be successful - if even one fails, they all lose.
</li>
<li>
Prisoners cannot mark, relay or in any way communicate with each other.
</li>
</ul>
<p>
The prisoners are allowed to open 50 boxes each in an attempt to find their own number, and
all of the prisoners must be successful in order to be set free. This problem raises
questions about strategy and probability in search of a solution.
Given the premise, the lack of options, and the incredibly tiny odds, one would presume
this challenge to be impossible - but it turns out there is a strategy that guarantees a
<b> 31%</b> chance of success!
</p>
</div>
<div className="pt-5 pb-8">
<div className="pt-7 pb-8">
<NoSSR>
<BoxTable/>
</NoSSR>