Computer Chess Club Archives

Search

Messages

Subject: Re: Artificial Intelligence in Computer Chess - *DETAILS* as promised

Author: martin fierz

Date: 07:03:39 03/29/04

Go up one level in this thread

On March 29, 2004 at 09:19:19, Dan Andersson wrote:

> I recommend a review of  the Knuth&Moore paper 'An Analysis of Alpha-Beta
>Pruning'. Especially Theorem 2. It concerns the 'optimum' properties of
>Alpha-Beta. The short of it is that A-B is an optimum limited by the ordering of
>the tree. And it gets worse with transpositions and Graph properties factored
>in.
>
>MvH Dan Andersson

hi dan,

if you have that paper, why don't you give me the answer to my question? :-)

cheers
  martin

• Re: Artificial Intelligence in Computer Chess - *DETAILS* as promised Dan Andersson 07:15:03 03/29/04
  • Re: Artificial Intelligence in Computer Chess - *DETAILS* as promised martin fierz 07:31:53 03/29/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.