taxicomics/PrisonersDilemma
1
0
Fork 0
mirror of https://github.com/taxicomics/PrisonersDilemma.git synced 2026-07-28 04:17:47 +02:00
Code Issues Packages Projects Releases Wiki Activity
3 Commits 1 Branch 0 Tags
56f499c67ad3b5842599dec1494a9c8aa553f682
T
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
taxicomics 56f499c67a Inital Version
2024-04-26 18:01:54 +00:00
__pycache__
Inital Version
2024-04-26 18:01:54 +00: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
Update README.md
2024-04-26 19:32:48 +02: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.

Reference in New Issue View Git Blame Copy Permalink
S
Description
Prisoners Dilemma Battlearena - which algorithm can get most points?
Readme
188 KiB
Languages
Python 100%