Author: JW de Kort
Date: 06:03:45 01/25/04
Dear Friends,
I have been trying to improve my move ordering using SEE but uptil now I have
not found a efficient method to do so. Now I’am trying the code of Phalanx. This
contains the following lines:
if(color(dest)==WHITE)
{ while(wl[minw]<=val)
minw++;
for(j=wn+1; j!=minw; j--)
wl[j]=wl[j-1];
wl[minw]=val;
wn++;
wl[wn]=CHECKMATE;
minw++;
}
Can anyone explain what is happaning here?
Regards Jan Willem
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.