-
Notifications
You must be signed in to change notification settings - Fork 3.6k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implementing a stochastic game example(Backgammon) in games.py #705
Comments
As far as I know, expectiminimax is not an algorithm. It is a (mathematical) function that "generalizes the minimax value for deterministic games to an expectiminimax value for stochastic games". It is something like a heuristic for stochastic games and (as far as I know) isn't used by the currently implemented algorithms in games.py |
Yes, you are right @ad71 . It is not an independent algorithm but just a variant of minimax for stochastic games. Currently there isn't any implementation for a stochastic game in games.py. Thus Expectiminimax is not used anywhere. @MrDupin , will it be good if I try implementing a stochastic game(Backgammon) in games.py? I will update this issue accordingly. |
Sure, sounds good! |
The Expectiminimax algorithm from the chapter 'Adversarial Search'(section : stochastic games) is not implemented in games.py. Also, it is not added to the list of algorithms. Should I work on it's implementation?
The text was updated successfully, but these errors were encountered: