Computer Chess Club Archives

Search

Messages

Subject: Re: search speed

Author: Stuart Cracraft

Date: 13:55:47 06/25/04

Go up one level in this thread

On June 25, 2004 at 16:46:31, Dann Corbit wrote:

>What is your branching factor?
>
>The best programs have a branching factor between 2 and 3.
>
>If you already have a branching factor in that range, do not expect any more
>really dramatic speedups.

This seems like a very useful measure to implement but I am not
sure how it might be done.

Take the # of total legal moves searched at each node (prior
to cut) and divide by the total number of nodes searched across
all nodes?

Time between iterations in mine goes up about 2x
to 6x per iteration but this is obviously a different measure
than what you are suggesting.

• Re: search speed Robert Hyatt 18:26:43 06/25/04
  • Re: search speed Stuart Cracraft 21:42:10 06/25/04
• Re: search speed Dann Corbit 14:46:37 06/25/04
  • Re: search speed Stuart Cracraft 16:11:34 06/25/04
    • Re: search speed Andrew Williams 16:24:56 06/25/04
      • Re: search speed Stuart Cracraft 21:22:45 06/25/04
        • Re: search speed Dan Honeycutt 21:57:22 06/25/04
      • Re: search speed Stuart Cracraft 16:27:37 06/25/04
        • Re: search speed Laurens Winkelhagen 03:05:07 06/26/04
          • Re: search speed Andrew Williams 05:33:36 06/26/04
    • Re: search speed Dann Corbit 16:20:08 06/25/04
      • Re: search speed Stuart Cracraft 16:32:31 06/25/04

This page took 0.01 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.