1
CSCI 100
Think Like Computers
Lecture 24
Fall 2008
Last Time …
•Implementing algorithms
•Binary search
•Sorting
Homework 4 – Due December 12
•Javascript programming: simulation!
•We are going to run simulations for the
Prisoner’s Dilemma problem:
Two men are collectively char ged with a crime and
held in separate cells.
They can’t communicate with each other.
They are told:
(1) if one of them confesses to the crime and the other does
not, the confessor will be freed, and the other jailed for 5
years
(2) if both confess, each will be jailed for 2 years
(3) if neither confesses, they will each be jailed for 1 year
Homework 4
•Write a program to play the iterated
version:
Each round is the Prisoner’s Dilemma: the
program chooses C or D
At each round, the program has previous
choices (both players) stored, and can use
that information to choose C or D
Play 200 rounds
Homework 4
•You are going to play against other
“programs” (you’ll simulate them as well):
All-D: Always choose D.
Random: choose C or D randomly.
Tit-for-Tat: first round, choose C; later, at
round t, do what your opponent did on round
t-1.
•Now check your program’s score (total
years) against them and print out.
Homework 4
•Hints: you can be as creative as you can –
but you do want to score the best. You
may try:
Some variation of the Tit-for-tat
Combination of random and Tit-for-tat
Switch/repeat strategies from time to time
•But don’t try overly complicated methods!
Docsity.com
