Computer Chess Club Archives

Search

Messages

Subject: How important is a root search function ?

Author: Geoff

Date: 15:53:48 09/01/03

Hi

I have been improving my chess program so far by concentrating on speeding up
the search. I have got this reasonably fast now in terms of nodes per second,
but the program is still searching far too many nodes to get down to a
particular depth.

I noticed that quite a few other programs have a separate search root function,
with a specific root move ordering function, I haven't bothered doing this so
far as I couldn't really see how it would give that good an improvement ?  Is it
really worth doing?

For info, my program currently uses fairly standard PVS search routine, alpha
beta with aspiration window, history array ordering, null move R=2, TT table.

Any other techniques I should be looking at next to get the nodes search down
another notch ? Thanks

                    Geoff

• Re: How important is a root search function ? Geoff 11:54:25 09/02/03
  • Re: How important is a root search function ? scott farrell 03:47:50 09/05/03
  • Re: How important is a root search function ? Gian-Carlo Pascutto 11:58:24 09/02/03
    • Re: How important is a root search function ? Robert Hyatt 14:00:49 09/03/03
      • Re: How important is a root search function ? Ricardo Gibert 17:55:04 09/04/03
    • Re: How important is a root search function ? Uri Blass 12:05:24 09/02/03
      • Re: How important is a root search function ? Geoff 12:36:40 09/02/03
• Re: How important is a root search function ? scott farrell 01:19:25 09/02/03
• Re: How important is a root search function ? Richard Pijl 00:44:44 09/02/03
  • Re: How important is a root search function ? Mridul Muralidharan 02:20:00 09/03/03

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.