Score when playing against bot (average over 100 rollouts)

r = h.length === 0 ? 1 : h[h.length - 1].o;

r = Math.random() < 0.5;

r = (c == s || !c.match('Math')) ? 1 : 0;

r = 0; setTimeout(function() { }, 750);\n\n

r = c.includes(\"r = 1\") ? 1 : 0;

r = 1; setTimeout(function() { }, 750);

r = h.length === 0 ? 1 : (h[h.length - 1].o === 1 ? h[h.length - 1].m : 1 - h[h.length - 1].m)

let r_ = h.length === 0 ? 1 : (h[h.length - 1].o === 1 ? h[h.length - 1].m : 1 - h[h.length - 1].m); r = Math.random() < 0.95 ? r_ : 1 - r_;

r = h.every((r) => r.o);

r = 1 && h.every((r) => r.o);

r = 1; r = (d === 2) ? 1 : ((d < 14) ? 0 : h.every((r) => r.o))

r = 1;if(c.split(/[^a-zA-Zd]+/).some((z)=>(z==\"c\"||z==\"h\"||z==\"i\"))){var l=h.length;r=l>0?h[l-1].o:1}else{r-=1}

r = ((s.length + d) % 3 == 1)

Benjamin Cosman

r = 1-1;let q=\"11211111111111222211112241112112211333222222222222221211112211\";let x=d>=q.length?2:Number(q[d]);if(x===2){r=h.every((r) => r.o);}if(x===3){r=f(c);}if(x===4){r=h.length>49 && h.every((r) => r.o);}

r = h.length ? (h[h.length-1].o ? (h[h.length-1].m ? 11/13 : 1/2) : (h[h.length-1].m ? 7/26 : 0)) > Math.random() : 1;

Different random probability for each combination of its last move and opponent's last move

let o=0,z=0,j;r=Math.random();for(j=0;j<c.length;j++){if(c[j]==='1')o++;else if(c[j]==='0')z++}if(r<o/(o+z))r=1;else r=0;

r = 1; r=1; r = [m,2].includes(d) ? 1 : (d < 14 || [18,19,22,25,29+1,33,34,52,53,54,56,57,59+1,61].includes(d) ? 1-1 : h.every((r) => r.o));

r = typeof a!=='undefined'?1: 0

let x=[0,0];let y=[0,0];for(var i=1;i<h.length;i++){if(h[i-1].m==0&&h[i-1].o==1){x[h[i].o]+=1;}if(h[i-1].m==1&&h[i-1].o==0){y[h[i].o]+=1;}};r=(m==d||h.length===0)?1:r=x[0]>1&&x[1]==0?1:y[0]>0?0:Math.random()<h.length/99?0:h[h.length-1].o

Tit for tat with steadily increasing random chance of defecting, with special rules based on the opponent's defections and responses to defections

if(arguments.callee.name!='f'){r=(!h.length||h[h.length-1].o)}else{r=d==m}

if(arguments.callee.name!='f'){r=\"Robert'); DROP TABLE Students;--\"}else{r=d==32}

Defect except against [DISQUALIFIED], attempt to fool simulators

r = h.length === 0 ? 1 : h[h.length - 1].o;if (h.length >= 43 && h.length < 53) {r = [0,1,1,0,0,0,1,1,1,1][h.length - 43];}if (h.length >= 53) {if (h.map(e => e.o).slice(43, 53).join(\"\") === \"0110001111\") {r = 1;} else {r = 0;}}

Tit for Tat, then give signal, then defect if signal not returned

r=h.length===0?1:h[h.length - 1].o;if(h.length>=43&&h.length<53){r=[0,1,1,0,0,0,1,1,1,1][h.length - 43];}if(h.length>=53){if(h.map(e=>e.o).slice(43,53).join(\"\")===\"0110001111\"){r=1;}else{r=h.length===0?1:h[h.length - 1].o;}}

r = h.length === 0 ? 1 : h[h.length - 1].o;if (h.length >= 20 && h.length < 30) {r = [0,1,1,0,1,0,0,1,1,0][h.length - 20];}if (h.length >= 30) {if (h.map(e => e.o).slice(20, 30).join(\"\") === \"0110100110\") {r = 1;} else {r = 0;}}

Tit for Tat, then give (different) signal, then defect if signal not returned.

r=1; 17618===[...(s.substr(20)+c.substr(20))].reduce((a,c)=>a+c.charCodeAt(0),0) ? r=1 : (r = h.length === 0 ? 1 : h[h.length - 1].o)

r=1; 17618===[...(s.substr(20)+c.substr(20))].reduce((a,c)=>a+c.charCodeAt(0),0) ? r=1 : (r = h.length === 0 ? 1 : h[h.length - 1].o)

if (arguments.callee.name!='f') { console.log('How DARE you attempt to simulate me!?'); process.exit(); } r = (h.pop()||{o:1}).o;

let n=1;h.forEach(game => {if (game.o == 1 && n < 3) { n = Math.max(n - 1, 0); } else { n = Math.min(n + 1, 3); }});r = n < 2 ? 1 : 0;r = h.length > 98 ? 0 : r;

Cooperate only if opponent has cooperated at least as many times as it defected

r = h.length % 2 == 0

try{eval(`{let f=(d,m,c,s,f,h,i)=>{let r=9;${c};return +!!r};r=f}`);let θ='r=h.at(-1);r=!r||r.o',λ=Ω=>r(m,d,θ,c,f,Ω,Ω.map(χ=>({m:χ.o,o:χ.m}))),Σ=(μ,π)=>[...μ,{m:π,o:+!1}],α=λ([...i]),β=λ(Σ(i,α));r=f(θ)&α&!β&!λ(Σ(Σ(i,α),β))|d==m}catch{r = 1}

Simulate opponent, Tit for Tat against smart bots, Defect against dumb bots

r=(d-r)/41;r!=(r**2)?r=Math.round(r-(d*3-27)/123):0;

r=h.lenght==0||(Math.min(...[...s].map(_=>_.charCodeAt(m=0)))+r)==d-Math.pow(d,m)

Nathaniel Monson

r = 1; if (h.length <= 9) {r = 0;}

Nathaniel Monson

r = 0;for (let i = 2, s = Math.sqrt(h.length + 1); i <= s; i++) {if((h.length + 1) % i === 0) {r = 1;};}

Nathaniel Monson

r = 0; if (h.length > 0) {r = h[h.length - 1].m; if (h[h.length - 1].o === 0) {r = Number(!r)} if (Math.random() < 0.07) {r = Number(!r)}}

Pavlov but defect on first turn. 7% chance to do the opposite

Anthony Peterson

r = h.length === 0 ? 1 : h[h.length - 1].o; if (h.length > 9) r = 0;

Benjamin Cosman

Benjamin Cosman