divy-07 / chess-engine

Implementing a basic Java chess engine
Apache License 2.0
1 stars 0 forks source link

Quiescence move search #28

Open divy-07 opened 1 year ago

divy-07 commented 1 year ago

At the leaves of our mini-max search tree, we should evaluate the critical positions.

As an example let's say we captured a defended pawn with or rook and then we stopped our search. Then we would evaluate the position as better for us, even though on the next move, we will be loosing the rook.

See more info here: https://www.chessprogramming.org/Quiescence_Search