Questions tagged [brute-force]

Questions about brute-force search or exhaustive search, a problem solving technique that relies on systematically enumerating all possible candidate moves and systematically analysing each candidate.

Filter by
Sorted by
Tagged with
3 votes
1 answer
548 views

Why is Ne4 considered as an inaccuracy whereas it is one of very few moves which saves d3 pawn?

[FEN "r2q1rk1/1p3ppp/p4n2/2Pp4/1Pn5/P1Bp3P/3N2P1/R2QN2K b - - 4 21"] With Black to move Ne4 is not even in top 5 moves and engine says its an inaccuracy. I know it considers fastest winning ...
user avatar
10 votes
6 answers
4k views

Is there a chess engine that does NOT use brute-force search?

Every chess engine I've ever heard of (including all I found listed on Wikipedia) uses brute-force search with an evaluation function (minmax algorithm) to decide on its move. This is not how most ...
user avatar
37 votes
5 answers
28k views

How do chess engines "think"?

What I want to know is how engines are programmed to find moves. I'm sure they first calculate the most forcing lines such as captures and checks. But what about subtle, deep positional moves? They ...
user avatar