All right. So, I have done some other work that I did not discuss. One thing I did not discuss, well I guess I talked about it briefly is how we actually solve these games. We use an algorithm called counterfactual regret minimization, which has been around for about 10 years now. Works extremely well, even though the theoretical guarantee on convergence is only 1 over square root t. I just had a paper that I released, where I developed a new form of CFR which beats the prior state-of-the-art by a factor of three.