May to June 2026
Solvers that compute approximate Nash equilibrium strategies for the two-player version of the card game Love Letter.
- Built CFR+ and external-sampling MCCFR+ solvers, with exact and Monte Carlo exploitability evaluation.
- Diagnosed an imperfect-recall issue in the game abstraction. Fixing it cut the solver’s exploitability from 0.05 to 0.0017.
- Designed state abstractions that made the full game’s billion-node tree tractable to solve.