Use this for the negamax variant of minimax. max(a,b) = -min(-a,-b)
Questions tagged [negamax]
3 questions
14
votes
1 answer
How could I use reinforcement learning to solve a chess-like board game?
I invented a chess-like board game. I built an engine so that it can play autonomously. The engine is basically a decision tree. It's composed by:
A search function that at each node finds all possible legal moves
An evaluation function that…
Pigna
- 295
- 2
- 6
1
vote
0 answers
Negamax: how should you avoid the horizon effect in the connect four game?
I'm trying to implement a quiescence search in the negamax algorithm, for a connect four game.
The algorithm is as follow for a chess game:
int Quiesce( int alpha, int beta ) {
int stand_pat = Evaluate();
if( stand_pat >= beta )
…
Carmellose
- 151
- 7
0
votes
2 answers
What is the meaning of the terms in this evaluation function for chess?
I'm trying to improve my evaluation and I saw this here
materialScore = kingWt * (wK-bK)
+ queenWt * (wQ-bQ)
+ rookWt * (wR-bR)
+ knightWt* (wN-bN)
+ bishopWt* (wB-bB)
+ pawnWt …
James Urian
- 3
- 1