Variant form of minimax search that relies on the zero-sum property of a two-player game. The objective is to find the best move for the player that's playing at the root node.
Questions tagged [negamax]
62 questions
-1
votes
1 answer
Java Connect 4 MinMax Algorithm
EDIT: I don't know why somebody links me a TicTacToe as duplicate for my question, there isn't even a MinMax-Algorithm in it.
Currently i'm working on a Connect4 game against the computer which should use the MinMax-Algorithm.
Before that, we wrote…
Max Kirsch
- 441
- 5
- 24
-1
votes
1 answer
Tic tac toe implemented with lisp is finishing game instead of making a single move
I'm making a simple CLI tic-tac-toe game with an AI that uses a negamax algorithm with alpha-beta pruning using LISP and I am having problems with how the AI makes its move. Instead of making the single move that it should, it is playing out the…
Christian.M
- 173
- 8