CMPS240, Spring 2013, Section 01: Lecture 9 Tuesday, April 30, 2013

topics covered:

     why saintpetersburgh formula is so awful:

           In N turns only log2(N) terms get involved each paying 1.

 

Cute theorem: An event with probability p will somewhat outperform p of the time!

Fundamental Theorem of Gambling

Kelly Criterion

====================

Heuristics for chess:

      remove the defender!

      increase the number of attacks