alt Hacker NewsThe core search algorithm is very simple though. 4KB engines may not run that fast if they do exhaustive search, but they’ll be quite accurate.
According to TCEC the time control is 30 mins + 3 sec, that’s a lot of compute!
The core search algorithm is very simple though. 4KB engines may not run that fast if they do exhaustive search, but they’ll be quite accurate.
According to TCEC the time control is 30 mins + 3 sec, that’s a lot of compute!
If you look at the current winner [1], it does a lot more than just brute force tree search. The space state for chess is simply too big to cover without good heuristics. Deep Blue may have been a pure brute force approach to beat Kasparov after Deep Thought failed using the same core algorithm, but modern chess engines search far deeper on the tree with far fewer nodes than Deep Blue ever could thanks to better heuristics.
[1] https://github.com/MinusKelvin/ice4