Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

statics data

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-08 17:39:50 +01:00
parent 11a38315cd
commit faee825af9
532 changed files with 8189 additions and 99 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
www/statics/euler/euler_084_explanation.md Normal file
View File

@@ -0,0 +1,9 @@
This is not really a mathematical problem (or at least not with my solution).
All I did was implement the rules in my befunge program and run a randomized game for `1 000 000` turns.
This is called an [Monte Carlo algorithm](https://en.wikipedia.org/wiki/Monte_Carlo_algorithm) and if we have enough runs it becomes pretty improbable to get a wrong result.
Perhaps there are some fancy mathematical solutions out there, but this works too.
A note to the befunge code: It got pretty messy because of all the decisions we have to implement for the different monopoly rules,
but all we needed as storage was an 40-element array. So it wasn't that hard to fit it all in the 80x25 space.