An interesting(?) new(?) search algorithm

Discussion of chess software programming and technical issues.

Moderators: hgm, Rebel, chrisw

Michael Sherwin
Posts: 3196
Joined: Fri May 26, 2006 3:00 am
Location: WY, USA
Full name: Michael Sherwin

An interesting(?) new(?) search algorithm

Post by Michael Sherwin »

It is sort of a cross between PVS-null-window, MTD(f), a high jump competition and a bubble sort. :mrgreen:

http://wbforum.vpittlik.org/viewtopic.php?t=6801
If you are on a sidewalk and the covid goes beep beep
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
CRoberson
Posts: 2055
Joined: Mon Mar 13, 2006 2:31 am
Location: North Carolina, USA

Re: An interesting(?) new(?) search algorithm

Post by CRoberson »

Since (as you claim) you are not getting an exact score then you
must factor in the variance of the scores returned. If the margin is
wide then your second best move could be rated as best.