4 ms·

Thanks for your comment. The answer is that I am still hoping to trim the tree like other engines. The simplicity of my engine lies solely in the evaluation fun

Thanks for your comment. The answer is that I am still hoping to trim the tree like other engines. The simplicity of my engine lies solely in the evaluation function. What I hope to save in CPU cycles on the evaluation might enable me to go deeper on the tree. That's the idea at least.

gus_massa 7y ago
Have you look at the method used by DeepBlue or Alpha(Chess)Zero? IIRC they use a simple evaluation function and a lot of brute force ...