Questions tagged [minimax]

Use for questions involving minimax and variants such as maximin. Applies both to algorithms and the minimax theorem.

14 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3
votes
0answers
109 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 ...
3
votes
0answers
54 views

What kind of decision rule algorithm is usable in this situation?

I am trying to write an AI to a game, where there is no real adversary. This means, that only the AI player has choices in which move to perform, his opponent may or may not react to the move the AI ...
2
votes
0answers
75 views

How can I apply the alpha-beta pruning algorithm to the “1-2 steal marbles” problem?

I have the following problem called "1-2 steal marbles". Initially, there are 6 marbles on the board. One of the players can choose to remove 1 or 2 marbles leaving 5 or 4. After that, the other ...
2
votes
0answers
83 views

How do GAN's generator actually work?

I have implemented DCGAN's myself and have been studying GAN's for over a month now. Now I am implementing the pggans but I encountered a sentence When we measure the distance between the ...
1
vote
0answers
25 views

Minimax algorithm with only partial visibility

I'm trying to implement the minimax algorithm with alpha beta pruning on a game that works like this: Player 1 plays (x1, y1). Player 2 can only see the x-value (x1) that Player 1 played (and not ...
1
vote
0answers
75 views

How do you prove that minimax algorithm outputs a subgame-perfect Nash equilibrium?

At every node, MAX would always move to maximise the minimum payoff while MIN choose to minimise the maximum payoff, hence there is nash equilibrium. By using backwards induction, at every node, MAX ...
1
vote
1answer
243 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 ...
1
vote
0answers
111 views

Understanding alpha-beta pruning for simplified NIM

This is a simple version of NIM: Two players alternately remove one, two or three coins from a stack initially containing 5 coins. The player who picks up the last coin loses. What does alpha-beta ...
1
vote
0answers
77 views

Can't grasp MiniMax diagram (no alpha beta pruning)

The image is one of many similar exam questions can anyone pelase help me understand it fully? 'Internal node': This is simply every node except A? Move choices: His only options are B, C and D for ...
0
votes
0answers
35 views

MCTS: What if all children of a node are terminal?

If all children Nodes of the selected node are terminal in the selection phase - you obviously run into a problem. So how do I prevent a Node to be selected that only has terminal children?
0
votes
0answers
25 views

How to interpret the output of alpha-beta pruning in terms of which position to play next in a game

I'm trying to understand question 4 of this paper. This is a tree pruned with alpha-beta pruning: I understand technically how this pruning worked (i.e. calculating mix/max/alpha/beta values). My ...
0
votes
1answer
62 views

Does the alpha/beta value of parent nodes change if the alpha beta value of the child node changes?

I want to do alpha-beta pruning on this tree: Consider nodes J and K. K is the max. Therefore, node D has an alpha value of 20, node B has a beta value of 20. Move to Node E. Pass the beta value of ...
0
votes
0answers
45 views

When is shallow pruning possible in alpha-beta pruning for multi-player games?

I have read up on some research papers that state that shallow pruning is possible when ...
0
votes
1answer
116 views

How does the MCTS tree look like?

I have come across the Monte Carlo tree search (MCTS) algorithm, but I can't find what the tree should look like. For example, does it still represent a minimax process, i.e. player 1 from the root ...