m_ipd 0.1.0

Library for working with the modified iterated prisoner's dilemma
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

use m_ipd::strategies::{*, axelrod::{self, *}};
use m_ipd::policies::{self, *};

pub fn main() {
    // The policies we want to test
    let policies: [(_, m_ipd::RevealPolicy); 4] = [
        ("Always Show", always_show),
        ("Never Show", never_show),
        ("Random", || policies::random(0.5)),
        ("By Cooperate Rate", || show_cooperate(1f32)),
    ];

    // The strategies we want to test
    let strategies: [(_, m_ipd::Strategy); 10] = [
        ("Tit for Tat", tit_for_tat),
        ("Optimistic Tit for Tat", optimistic_tit_for_tat),
        ("Punishing Tit for Tat", punishing_tit_for_tat),
        ("Defect Streaks", defect_streaks),
        ("Decreasing Tit for Tat", decreasing_tit_for_tat),
        ("Random Tit for Tat", random_tit_for_tat),
        ("Random", || axelrod::random(0.5)),
        ("Opportunistic", opportunistic),
        ("Tit for Two Tats", tit_for_two_tats),
        ("Always Defect", always_defect),
    ];

    let strat_names = strategies.iter().map(|(n, _)| n).collect::<Vec<_>>();
    let strategies = strategies.iter().map(|(_, s)| *s).collect::<Vec<_>>();

    for &(p_name, p) in policies.iter() {
        println!("{}", p_name);
        let res = m_ipd::tournament(&strategies[..], p);
        for (name, points) in strat_names.iter().zip(res){
            println!("{}\t{}", name, points);
        }
        println!("");
    }
}