NashCoding Yet Another Artificial Intelligence Blog


Evolving Nash Equilibria – A Quick Correction

As I noted in my first post, I was a little skeptical about whether a Nash Equilibrium (NE) could be evolved by taking the squared loss of each hand. My conclusions were that, given an expected value evaluation function, it was possible using a best-opponent fitness but not using a squared-loss fitness. There turns out to be a small bug in the squared loss code which caused a big change in results. Below are the results for the correct fitness function implementation.


hand2xml – A Simple, Plug-in Framework for Hand History Parsing

A while back I needed to analyze some of my Full Tilt hand histories. Since at the time there was no simple parser that was publicly available, I wrote my own.

Filed under: C#, Poker Continue reading

A Comment on “Evolving Nash-Optimal Poker Strategies Using Evolutionary Computation”

I recently read this paper where the authors claim that they are evolving psuedo-optimal strategies for poker. Given that we know evolutionary processes do not necessarily minimize losses, I was skeptical.