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?
3 Commits 1 Branch 0 Tags 34 KiB
Python 100%
Go to file
taxicomics 56f499c67a Inital Version 2024-04-26 18:01:54 +00:00
__pycache__ Inital Version 2024-04-26 18:01:54 +00:00
README.md Update README.md 2024-04-26 19:32:48 +02:00
contenders.py Inital Version 2024-04-26 18:01:54 +00:00
helper_functions.py Inital Version 2024-04-26 18:01:54 +00:00
main.py Inital Version 2024-04-26 18:01:54 +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.