Reaching high search depths

Discussion of chess software programming and technical issues.

Moderators: hgm, Dann Corbit, Harvey Williamson

Forum rules
This textbox is used to restore diagrams posted with the [d] tag before the upgrade.
User avatar
hgm
Posts: 26134
Joined: Fri Mar 10, 2006 9:06 am
Location: Amsterdam
Full name: H G Muller
Contact:

Re: Reaching high search depths

Post by hgm » Tue Mar 02, 2021 7:51 pm

I think that is the point. When your static evaluation becomes better at distinguishing good positions from poor ones, it will happen much less often that poor moves will be able to cause beta cutoffs, and that way find their way to early in the move ordering, pushingthe truly good moves to the back, where they are reduced too much.

Post Reply