Computer Chess Club Archives

Search

Messages

Subject: Re: Starting position to 30 ply

Author: Rudolf Huber

Date: 04:01:21 06/04/01

Go up one level in this thread

On June 04, 2001 at 06:44:26, Dan Andersson wrote:

>Impressive branching factor. Do you use ETC to reduce the tree/graph? And do you
>try to search smaller subtrees by finding irregular branching factors? I think
>it would be interesting to see its search performance without Q-search.
>
>Regards Dan Andersson

Just normal (i.e. recursive nullmove) pruning, no ETC, nothing else.
A search without Q-search? Why would that be interesting?


My post should say two things:

1. mtd(f) is very efficient when the score does not change from one iteration
to the other

2. You can not win material within the first 30 ply


Rudolf

• Re: Starting position to 30 ply Graham Laight 10:33:08 06/04/01
  • Re: Starting position to 30 ply Mike S. 12:12:41 06/04/01
    • Re: Starting position to 30 ply Gian-Carlo Pascutto 15:03:43 06/04/01
    • Re: Starting position to 30 ply Dan Andersson 12:17:02 06/04/01
      • Re: Starting position to 30 ply Gian-Carlo Pascutto 14:54:28 06/04/01
• Re: Starting position to 30 ply Dan Andersson 04:24:22 06/04/01

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.