You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-7Lines changed: 5 additions & 7 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,7 +1,7 @@
1
1
# 100 Prisoners Simulator
2
2
3
3
A Python simulation of the **100 prisoners problem**, where each prisoner must find their own number hidden in one of 100 boxes.
4
-
This project allows you to run multiple simulations using **custom strategies**, view success rates, and manage runs through a clean working directory system.
4
+
This project allows you to run multiple simulations using **custom strategies**, view success rates, and manage runs through a clean **simulation ID** system.
5
5
6
6
If you have any questions or suggestions, feel free to open an issue or submit a pull request! It would make my day. 😊
7
7
@@ -15,12 +15,12 @@ If you have any questions or suggestions, feel free to open an issue or submit a
15
15
- Overall chance of success
16
16
- Average number of checked boxes per prisoner
17
17
- Percentage of finds per prisoner
18
-
- Built-in directory management for saving results and configurations
18
+
- Built-in simulation management using IDs for saving and loading configuration and progress
19
19
20
20
---
21
21
22
22
## 🧠 About the Project
23
-
I created this simulator because I wanted a way to **easily prove the math** behind the 100 prisoners problem, and to **experiment with different strategies** that people have come up with, maybe even stumble upon a new, better one. 😉
23
+
I created this simulator because I wanted a way to **easily prove the math** behind the 100 prisoners problem, and to **experiment with different strategies** that people come up with, maybe even stumble upon a new, better one. 😉
24
24
25
25
The 100 prisoners problem is a classic probability and logic puzzle. Each prisoner may open up to half the boxes (50) to find their number.
26
26
If **all** prisoners succeed, they are freed; if even one fails, they all lose.
0 commit comments