A Fundamentally Better Search

Discussion of chess software programming and technical issues.

Moderator: Ras

Mike Sherwin
Posts: 965
Joined: Fri Aug 21, 2020 1:25 am
Location: Planet Earth, Sol system
Full name: Michael J Sherwin

A Fundamentally Better Search

Post by Mike Sherwin »

It counts the iterations the same way (1 2 3 ...) but with a twist. The iteration depth is for both sides. Both sides are allowed to insert that many non captures in any line of the search tree and when the allowance of non capture moves is used up that side can only generate captures after that.