Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Gian-Carlo Pascutto

Date: 08:04:23 05/02/01

Go up one level in this thread


On May 02, 2001 at 10:08:09, JW de Kort wrote:

>I noticed that mr Hyatt uses a far more advanged methode of ordering but his
>methode is not clear to me.

A simply but effective technique is to count the number of nodes you
spent in searching a move and to order then based on that. It will take
more effort (nodes) to prove that a good move is worse than the pv than
a bad one.

>Also i ask myself if it it worth the effort to try to do a good root move
>order.

It helps, but it won't do wonders.

--
GCP



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.