Re:Show HN: Probabilistic Tic-Tac-Toe
by orlp on Monday June 10, 2024 @04:17PM
(#40638401)
Usually those are for additive/linear systems, the problem with game theoretic graphs like these is that you alternate between max and min nodes, so the system is highly nonlinear.
[ Parent
| on HN ]
You're right.
I'll work on the simpler problem of :) / :( first. I think that can be done with just minimax
And then maybe win chance for each possible state of a purely random game
If it were just solely :) / :( then it is a freshman's exercise in expectiminimax.
it turns out you don't need anything more than minimax for the general case Here's my solution https://github.com/pvillano/probabalistic-tic-tac-toe