Computer Chess Club Archives

Search

Messages

Subject: Re: root move ordering

Author: Tony Werten

Date: 01:14:15 09/23/04

Go up one level in this thread

On September 23, 2004 at 04:10:18, martin fierz wrote:

>[snip]
>
>>There is _no_ overhead.  It is done only at the root, once per iteration.  For a
>>12 ply search, a total of 12 times.  That won't use measurable CPU time.  The
>>point is that root move ordering is critical for efficiency..
>
>exactly how critical for efficiency would you believe it to be?

Depends on the bestmove. If that is constant, it's less important than after a
rootfaillow.

Tony

>
>cheers
>  martin

• Re: root move ordering martin fierz 02:10:40 09/23/04
  • Re: root move ordering Stuart Cracraft 09:23:23 09/23/04
    • Re: root move ordering Robert Hyatt 10:25:46 09/23/04
      • Re: root move ordering Stuart Cracraft 14:23:48 09/23/04
  • Re: root move ordering Robert Hyatt 06:53:41 09/23/04
  • Re: root move ordering Tony Werten 03:37:33 09/23/04
  • Re: root move ordering Peter Fendrich 02:35:27 09/23/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.