taxicomics
/
PrisonersDilemma
mirror of https://github.com/taxicomics/PrisonersDilemma.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Prisoners Dilemma Battlearena - which algorithm can get most points?
6 Commits 1 Branch 0 Tags 34 KiB
Python 100%
Go to file
taxicomics 96eae218c6 reworked presentation 2024-04-26 19:45:42 +00:00
__pycache__ reworked presentation 2024-04-26 19:45:42 +00:00
README.md Improved usability 2024-04-26 18:37:23 +00:00
contenders.py reworked presentation 2024-04-26 19:45:42 +00:00
helper_functions.py reworked presentation 2024-04-26 19:45:42 +00:00
main.py reworked presentation 2024-04-26 19:45:42 +00:00

README.md

PrisonersDilemma

Prisoners Dilemma Battlearena - which algorithm can get most points?

The prisoner's dilemma is a game theory thought experiment that involves two rational agents, each of whom can COORPERATE for mutual benefit or betray their partner ("defect") for individual reward.

YOUR algorithm goes in the contender.py-file. You then go to main and pit it against another contender or itself.