Tag Archives: Kristoffer Arnsfelt Hansen

Is Heads-Up Poker in P?

Five years ago I wrote a post entitled Is Backgammon in P? It was based on conversations with Peter Bro Miltersen and Uri Zwick (shown together in the above picture) about the computational complexity of computing the values (and equilibrium … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Games | Tagged , , , , | 3 Comments