Questions tagged [minimax]

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

Filter by
Sorted by
Tagged with
0
votes
0answers
20 views

Is the MDP value function used in the minimax algorithm? [closed]

Is the MDP value function represented (or used) in the minimax algorithm? If so, could you please give an example?
3
votes
1answer
43 views

Is the minimax algorithm model-based?

Trying to get my head around model-free and model-based algorithms in RL. In my research, I've seen the search trees created via the minimax algorithm. I presume these trees can only be created with a ...
4
votes
1answer
47 views

Why is it possible to eliminate this branch with alpha-beta pruning?

Can someone explain to me why it is possible to eliminate the rest of the middle branch in this image for alpha-beta pruning? I am confused because it seems the only information you know is that Helen ...
2
votes
1answer
144 views

Why does the adversarial search minimax algorithm use Depth-First Search (DFS) instead of Breadth-First Search (BFS)?

I understand that the actual algorithm calls for using Depth-First Search, but is there a functionality reason for using it over another search algorithm like Breadth-First Search?
2
votes
1answer
53 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
1answer
88 views

Minmax algorithm, search time and search depth compromise and acceptability

Currently working on Gomoku AI implementation with minmax + alpha beta implementation. I'm targeting these two rules from 'acceptable implementation' in terms of search time and search depth : ...
4
votes
1answer
59 views

Checkers AI Stuck in Infinite Loops

I have implemented minimax with alpha-beta pruning to play checkers. I am using only the summation of material value on the board regardless of position as my value heuristic. My main issue lays in ...
2
votes
1answer
50 views

create a minimization function

I am not sure if I am in the right place but I am trying to find some infos or tutorial in one of my problem and I do not know where to look at or how this is call to help me in my research... I am ...
3
votes
1answer
64 views

Can alpha-beta pruning be used for applications apart from games?

Can alpha-beta pruning/ minimax be used for systems apart from games? Like for selecting the right customer for a product, etc. (the typical data science problems)? I have seen people do it, but can't ...
3
votes
0answers
43 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
131 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
410 views

Minimax combined with machine learning to determine if a path should be explored

I have an idea for a new type of AI for two-player games with alternating turns, like chess, checkers, connect four, and so on. A little background: Traditionally engines for such games have used the ...
1
vote
0answers
97 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 ...
2
votes
1answer
82 views

Chess Engine for low clock cycle CPU

I'm looking for a simple chess algorithm that works well on a ~132MHz CPU. I know that MiniMax would take too long to go deep in order to find good moves. Is Monte Carlo Tree Search working well on ...
4
votes
1answer
47 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 ...
1
vote
0answers
57 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 ...
2
votes
1answer
259 views

Using the opponent's mixed strategy in estimating the state value in minimax Q learning

In the paper Markov games as a framework for multi-agent reinforcement learning (which introduces the minimax Q Learning algorithm), at the bottom left of page 3, my understanding is that the author ...
1
vote
1answer
257 views

Does quiescence search even improve the minimax algorithm?

Consider this game state: d5 captures c6 Quiescence search returns about 8.0 as evaluation because after dxc6 and bxc6 Qxd6 would be played (then Qxd6 by black). A normal player would not play this ...
5
votes
3answers
1k views

Can someone help me to understand the alpha-beta pruning algorithm?

I understand the minimax algorithm, but I am unable to understand deeply the minimax algorithm with alpha-beta pruning, even after having looked up several sources (on the web) and having tried to ...
3
votes
1answer
164 views

Why do neural nets and machine learning tend to work well with MCTS, but not with regular Minimax game-playing AI?

I've often heard MCTS grouped together with neural nets and machine learning. From what I gather, MCTS uses a refined intuition (from maching learning) to evaluate positions. This allows it to better ...
4
votes
1answer
274 views

Any interesting ways to combine Monte Carlo tree search with the minimax algorithm?

I've been working on a game-playing engine for about half a year now, and it uses the well known algorithms. These include minimax with alpha-beta pruning, iterative deepening, transposition tables, ...
2
votes
1answer
177 views

Is there a way of representing the minimax algorithm mathematically?

I have successfully figured out how the minimax algorithm works for a game like chess, where a game tree is used, and you assign a value to the terminal nodes and propagate that value up the tree. Is ...
4
votes
1answer
208 views

Transposition table is only used for roughly 17% of the nodes - is this expected?

I'm making a Connect Four game using the typical minimax + alpha-beta pruning algorithms. I just implemented a Transposition Table, but my tests tell me the TT only helps 17% of the time. By this I ...
0
votes
1answer
328 views

Connect 4 minimax does not make the best move

I'm trying to implement an algorithm that would choose the optimal next move for the game of Connect 4. As I just want to make sure that the basic minimax works correctly, I am actually testing it ...
2
votes
1answer
442 views

Quiescence search

Games like checkers have compulsory moves. In checkers for instance, if there's a jump available a player must take it over any non-jumping move. My question is, if jumps are compulsory will there ...
3
votes
2answers
196 views

Is an evaluation function as good as an optimization function

I have been so for self-learning basic A.I concepts and would like to know if having a really good evaluation function as good as any of alpha-beta pruning optimization functions such as killer moves, ...
6
votes
1answer
566 views

Alpha-beta pruning algorithms optimizations

I know that they are quite alot of optimizations for alpha-beta pruning but what does it mean exactly: 1) Does it mean that these optimized algorithms are to be integrated into the alpha-beta ...
15
votes
3answers
6k views

How do I choose the best algorithm for a board game like checkers?

How do I choose the best algorithm for a board game like checkers? So far, I have considered only three algorithms, namely, minimax, alpha-beta pruning, and Monte Carlo tree search (MCTS). Apparently,...
1
vote
0answers
70 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 ...
3
votes
1answer
162 views

Can minimax be used when both players want to increase their score?

If both the players want to increase their score (by selecting the highest or best cost path), can this be done using the minimax algorithm, or are there other algorithms for this purpose?
2
votes
1answer
181 views

Adversarial search in the game '2048'

If we model the game '2048' using a max-min game tree, what is the maximal path from a start state to a terminal state? (Assume the game ends only when the board is full This is one of the sub-...
3
votes
1answer
686 views

How do I write a good evaluation function?

I'm currently writing an Alpha-Beta-Pruning algorithm for a board game. Now I need to come up with a good evaluation function. The game is a bit like snakes and ladders (you have to finish the race ...
4
votes
1answer
248 views

Fitness Function altenatives in Genetic Algorithms for game AI

I have created a Gomoku(5 in a row) AI using Alpha-Beta Pruning. It makes moves on a not-so-stupid level. First, let me vaguely describe the grading function of the Alpha-Beta algorithm. When it ...
3
votes
2answers
2k views

How to make minimax optimal?

By optimal I mean that: If max has a winning strategy then minimax will return the strategy for max with the fewest number of moves to win. If min has a winning strategy then minimax will return the ...
4
votes
1answer
130 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 ...
1
vote
2answers
73 views

Whats the name of the value that you add or subtract from a minimax tree node?

I am coding a tic-tac-toe program that demonstrates reinforcement learning. The program uses minimax trees to decide its moves. Whenever it wins, all the nodes on the tree that were involved in the ...
5
votes
1answer
148 views

Illustration of Von Neumann's Minimax theorem in games?

The Von Neumann's Minimax theorem gives the conditions that make the max-min inequality an equality. I understand the max-min inequality, basically ...