Questions tagged [expectiminimax]

For questions related to the ExpectiMinimax algorithm (or tree), which is a variation of the minimax algorithm (or tree). In addition to "min" and "max" nodes of the traditional minimax tree, this variant has "chance" nodes (which take the expected value of a random event occurring), which are interleaved with the max and min nodes. The ExpectiMinimax was proposed in "Game-playing and game-learning automata" (1966) by Donald Michie.

Filter by
Sorted by
Tagged with
2
votes
1answer
46 views

Is there a probabilistic version of minimax?

How would a probabilistic version of minimax work? For example, we may choose a move that could result in a very bad outcome, but that outcome might just be extremely unlikely so we might think it ...
3
votes
0answers
33 views

How to choose the weights for a linear combination of heuristic functions?

I need to write a minimax algorithm with alpha-beta pruning in limited time for the 2048 game. I know expectimax is better for this work. Assume I wrote different heuristic functions. If I want to ...
1
vote
1answer
85 views

Is this ExpectiMinimax Tree correctly drawn?

I need help with ExpectiMinimax problem: Start a game. The first player flips a coin. The second player flips a coin. The first player decides if he wants to flip another coin. The second player ...
4
votes
1answer
123 views

What is the variant of the minimax tree with 3 types of nodes called?

I have a task on my class to find all the nodes, calculate their values and choose the best way for the player on the given game graph: Everything is fine, but I have no idea what these dots are. Is ...