Early search termination

Discussion of chess software programming and technical issues.

Moderators: hgm, Dann Corbit, Harvey Williamson

bob
Posts: 20943
Joined: Mon Feb 27, 2006 7:30 pm
Location: Birmingham, AL

Re: Early search termination

Post by bob »

I simply wimped out, being unable to predict the LMR/zugzwang/etc issues. I now use max iteration = 2 * mate + 5. Once it finds the mate, the iterations whiz by quickly, and this seems to catch most of the "find the shortest mate" issues by searching 4 plies deeper than would be needed if there was no LMR issues...

It means nothing for Elo, as you said...