---
# System prepended metadata

title: AA 228 Project Direction

---

# AA 228 Project Direction

## Opponent exploitation

This one would probably involve implementing an NE solver, and then trying to think about how we can use observations about our opponent's play to develop an exploitative strategy. It looks like there's some prior research in this area, so I think we should start by reading a bit.

- https://www.cs.cmu.edu/~sandholm/safeExploitation.teac15.pdf
- https://www.aaai.org/Papers/AAAI/2005/AAAI05-123.pdf
- http://nn.cs.utexas.edu/downloads/papers/li.phd18.pdf

Imo this could make a really cool project, but it might not be too easy to come up with new ideas in this area given that lots of people have worked on this before.

## Developing a new NE solver for Poker

All the current ones discretize the action space and then just solve an abstracted version of the game, but maybe we can do better? I'm thinking maybe we can either adjust the action space abstraction during the algorithm (i.e. shift the allowed bet sizes around while solving), or do something like this paper: https://link.springer.com/chapter/10.1007/978-3-030-32430-8_15, which uses neural networks as density estimators for the actions instead of abstracting them (I think).

Imo this is the hardest of the three, but also the one with the least prior research and thus probably the most likely to make for a cool publication.

## Pluribus++

We could also try to implement this paper https://www.cs.cmu.edu/~noamb/papers/19-Science-Superhuman.pdf. Afaik, noone has done this before. If successfull, this could result in a really useful poker training software or something similar. And if we wanted to, we could try to improve the algorithm too. The bet size abstraction it uses is still fairly coarse, and I think with more time/compute or some new ideas, we could make it better. It'd also be cool to make the strongest poker AI in the world xD.

The downside for this one is that most of the effort will probably go into trying to replicate the paper, so it'd be hard to get someting novel and publication-worthy out of it.

Also maybe this is the hardest, not sure.