Questions tagged [minimax]

Minimax is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player, assuming that your opponent also plays optimally. It is widely used in two player turn-based games such as Tic-Tac-Toe, Backgammon, Mancala, Chess, etc.

3 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1 vote
0 answers

Negamax A/B pruning rate. Move ordering

I have a typical negamax with a/b pruning setup and thoroughly checked line by line. What is expected cutoff rate normally? Kind of surprisingly, in my case cutoff rate is rarely greater than 5%. Is ...
Artem Yagodin's user avatar
1 vote
0 answers

Why is my negamax/quiescence search slow?

I'm currently making a chess engine in Java and my search function is extremely slow to the point that it's slower than my perft function. My search function is currently a negamax search that uses ...
wdk23's user avatar
  • 90
1 vote
0 answers

Relation between Elo and search depth for basic minimax

If we use the most basic approach to a chess engine (for example, for a codegolf): minimax to a fixed depth with the material count as static evaluation, then how strong is this algorithm? This of ...
Jens Renders's user avatar