Begin modularization of prolog prisoners dilemma implementation

1 files changed, 49 insertions, 0 deletions

diff --git a/prisoners_dilemma.pl b/prisoners_dilemma.pl
new file mode 100644
index 0000000..66578e8
--- /dev/null
+++ b/prisoners_dilemma.pl
@@ -0,0 +1,49 @@
+/*
+ * Copyright (c) 2012 Benjamin Franzke <benjaminfranzke@googlemail.com>
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+:-initialization(start).
+
+pay(c,d,1).
+pay(d,d,2).
+pay(c,c,3).
+pay(d,c,4).
+
+pay2(A, B, PayA, PayB) :- pay(A, B, PayA), pay(B, A, PayB).
+
+decide(Module, A, Hist, PayA, PayB) :- call(Module, A, Hist, PayA, PayB).
+
+sum([], 0).
+sum([H|T], S) :- sum(T, TMP), S is TMP + H.
+
+do(e, _,  _, _, _) :- !.
+do(Choice, Module, Hist, PayedA, PayedB) :-
+	decide(Module, Choice, Hist, PayA, PayB),
+
+	write('A Pay: '), write(PayA), write('\t'),
+	write('B Pay: '), write(PayB), write('\t'),
+	write('A: '), sum([PayA|PayedA], SumA), write(SumA), write('\t'),
+	write('B: '), sum([PayB|PayedB], SumB), write(SumB), nl,
+
+	loop(Module, [Choice|Hist], [PayA|PayedA], [PayB|PayedB]).
+
+loop(Module, Hist, PayedA, PayedB) :-
+	write('Type c,d or e to end: '), read(Choice),
+	do(Choice, Module, Hist, PayedA, PayedB).
+
+
+start(Module) :- consult(Module), loop(Module, [], [], []), halt.
+start :- start(tit4tat).