From 188670069af1432e4d2dc24a9ca6de526ca6bc40 Mon Sep 17 00:00:00 2001
From: Benjamin Franzke <benjaminfranzke@googlemail.com>
Date: Wed, 7 Nov 2012 14:22:44 +0100
Subject: Prisoners Dilemma: Add naive prober algorithm

---
 naive_prober.pl | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 naive_prober.pl

diff --git a/naive_prober.pl b/naive_prober.pl
new file mode 100644
index 0000000..946dd0d
--- /dev/null
+++ b/naive_prober.pl
@@ -0,0 +1,14 @@
+% Naive Prober: Like Tit for Tat, but sometimes, after the
+% opponent has cooperated, it defects (e.g. at random, in
+% one of ten rounds in average).
+
+naive_prober_random(Number, d):-Number < 0.1,!.
+naive_prober_random(_, c).
+
+% Use opponents last decision
+naive_prober([d|_],d,_,_).
+% but only for for 90% if coorporated
+naive_prober([c|_],Choice,_,_):-
+	random(Number), naive_prober_random(Number, Choice).
+% Fallback to coorporate if history is empty.
+naive_prober([],c,_,_).
-- 
cgit