4 ms·
There is an easier way to solve each recursion! I just wrote a blog post on it: https://louisabraham.github.io/articles/probabilistic-tic-tac-toe https://louisa
by Labo333 2y ago
There is an easier way to solve each recursion! I just wrote a blog post on it: https://louisabraham.github.io/articles/probabilistic-tic-tac-toe https://louisabraham.github.io/articles/probabilistic-tic-ta...
- orlp 2y agoI think you have an error in the equation defining V(s). You have component n_c * V(s) for the 'nothing happened' case, but I don't think that's correct. If you rolled that nothing happens the turn still passes to your opponent, so I think it should be n_c * V'(s).
- Labo333 2y agooh RIGHT. Gotta fix it
- deleted 2y ago[deleted]
- yshui 2y agoYep, this is what I ended up doing as well! With how the game generate boards, the player that goes first always have a ~5% advantage. Since players switch hands each around they should have 50% win rate if both play optimally. In practice, playing against author's AI I barely get ~60% win rate (small caveat, I count ties as 0.5 to both players). What about yours? Edit: nvm I saw you did the same with ties.