A SkillsCast for this session is not available.
We will spend the evening writing game strategies for the "iterated prisoner's dilemma" problem. This is a simple round-based game with two players. In each round, each player can choose to cooperate with or betray the other play. If you betray but the opponent cooperates, you win 3 points. If you both cooperate, you both get 2 and if you both betray, you both get 1.
There are many interesting strategies that you can write - for example, cooperate until the opponent starts deceiving; do the same thing as the opponent in the previous round or choose randomly. They can be simple with just a few lines of F# or elaborate with sophisticated machine learning, so there will be something fun to try for both F# beginners and experts. And a simple strategy can often turn out to be better than a complex one.
You'll learn everything you need to know in the meetup, but if you want, you can read about Prisoner's Dilemma online: ahttps://en.wikipedia.org/wiki/Prisoner%27s_dilemma
Tomas Petricek is a computer scientist, open-source developer and Lecturer at the University of Kent's School of Computing. He wrote a popular book called "Real-World Functional Programming" and has interests in programming language design and the philosophy of science.
YOU MAY ALSO LIKE:
Prisoner's Dilemma Coding dojo with Tomas Petricek
Tomas is a computer scientist and open-source developer. He is a Visiting Researcher at the Alan Turing Institute working on tools for open data-driven storytelling. He wrote a popular book called "Real-World Functional Programming" and is a lead developer of several F# open-source libraries.