Computer Chess Club Archives

Search

Messages

Subject: Best non-captures ordering function in my experiments

Author: Sergei S. Markoff

Date: 01:15:22 03/19/04

int NonCaptureRank(MOVE m,int Depth)
{
 int index=((m&4095)<<1)|SideToMove;
 int index1=history_group[M_PIECE(m)];
 int r=(history[index1][index]);

 if(Depth>2*INCPLY) do
 {
  int sw=Swabbing(M_TO(m),M_FROM(m));
  if(sw<0) r-=MAX_HISTORY; else
  {
   if((!ENDING(ChangeSide(SideToMove)))&&CheckingMove(m))
   {
    r+=MAX_HISTORY;
    break;
   }

   if(M_CAPTURE(ThreatMove[ply]))
   {
    if(M_FROM(m)==M_TO(ThreatMove[ply])) r+=MAX_HISTORY;
   }
  }
 } while(0);

 return r;
}

• Re: Best non-captures ordering function in my experiments Uri Blass 01:32:24 03/19/04
  • Re: Best non-captures ordering function in my experiments Sergei S. Markoff 01:45:09 03/19/04
  • Re: Best non-captures ordering function in my experiments Sergei S. Markoff 01:43:13 03/19/04
    • Re: Best non-captures ordering function in my experiments Vasik Rajlich 17:04:05 03/19/04
    • Re: Best non-captures ordering function in my experiments martin fierz 02:29:25 03/19/04
      • Re: Best non-captures ordering function in my experiments Sergei S. Markoff 14:15:43 03/19/04

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.