Can Gürses on one of his tweets last month asked a brain teaser to his followers: https://twitter.com/canitti/status/1220030550238515201
The next day he gave the answer:
https://twitter.com/canitti/status/1220342105119383552?s=20
If you check the answer you will see that the best strategy for player “Can” is to not shoot one of his opponents when both of them are alive, but to shoot an empty space. Write a Python program that will simulate 1 million times the game to prove that this is the best strategy for “Can” compared to shooting “Ahmet” or “Berkay” (when both are alive).
You are required to submit only the Python source code of your program, nothing more (I will test your program by executing it).
The grading of your homework will be as follows:
- Working program: 20 points
- Use of understandable and appropriate output: 5 points
- Use of appropriate comments: 5 points
If you use any method/function/structure that we have not covered in our course you will receive 0 (zero).
If you have any questions about the homework you are required to ask them through our Moodle forum.1
