So, I'm really excited about that, and that's going to be used in all the future research. I have some work on pruning in CFR. So, it turns out that CFR you end up exploring the entire game tree which is a big waste, because a lot of actions are suboptimal and you don't want to waste time coming up with what you should do if you play a really crappy poker hand, because in reality you just fold it right away. So, I have this pruning technique that provably reduces to computing and memory costs of running CFR asymptotically.