Computer Chess Club Archives

Search

Messages

Subject: Re: DEEP BLUES AVERAGE PLY?

Author: Gian-Carlo Pascutto

Date: 07:45:51 08/21/02

Go up one level in this thread

On August 21, 2002 at 10:35:13, Vincent Diepeveen wrote:

>2 * sqrt(40)^18 = 524288000000000 nodes needed to search it *minimum*.

That is pure alphabeta. Simple PVS will already reduce this tremendously.

I'm quite sure we already did all the math five times, actually, but
you keep 'forgetting' the details which don't coincide with your
point of view.

--
GCP

• Re: DEEP BLUES AVERAGE PLY? Robert Hyatt 08:21:38 08/21/02
  • Re: DEEP BLUES AVERAGE PLY? Vincent Diepeveen 11:28:35 08/21/02
    • Re: DEEP BLUES AVERAGE PLY? Robert Hyatt 20:02:40 08/21/02
      • Re: DEEP BLUES AVERAGE PLY? Gian-Carlo Pascutto 02:32:53 08/22/02
        • Re: DEEP BLUES AVERAGE PLY? Robert Hyatt 08:08:45 08/22/02
• Re: DEEP BLUES AVERAGE PLY? Bas Hamstra 08:02:30 08/21/02
  • Re: DEEP BLUES AVERAGE PLY? Gian-Carlo Pascutto 08:28:59 08/21/02
    • Re: DEEP BLUES AVERAGE PLY? Bas Hamstra 08:36:02 08/21/02
      • Re: DEEP BLUES AVERAGE PLY? Gian-Carlo Pascutto 09:07:49 08/21/02
        • Re: DEEP BLUES AVERAGE PLY? Robert Hyatt 20:04:11 08/21/02
          • Re: DEEP BLUES AVERAGE PLY? Gian-Carlo Pascutto 02:25:20 08/22/02
  • Re: DEEP BLUES AVERAGE PLY? Robert Hyatt 08:22:37 08/21/02

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.