undefined | Better HN

0 pointsorlp1y ago0 comments

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.

0 comments

pvillano1y ago

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

orlpOP1y ago

If it were just solely :) / :( then it is a freshman's exercise in expectiminimax.

pvillano1y ago

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

1 more reply

j / k navigate · click thread line to collapse

0 pointsorlp1y ago0 comments

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.

0 comments

pvillano1y ago

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

orlpOP1y ago

If it were just solely :) / :( then it is a freshman's exercise in expectiminimax.

pvillano1y ago

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

1 more reply

j / k navigate · click thread line to collapse