Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: the correctness of alpha-beta pruning with respect to min-max

Author: Vincent Diepeveen

Date: 08:58:01 09/28/00

Go up one level in this thread


On September 28, 2000 at 03:54:35, Gregor Overney wrote:

>If you want to find out more you might want to run LPTP (a logic program theorem
>prover). Check out
>
>http://www.inf.ethz.ch/personal/staerk/lptp/examples/alpha/main.html
>
>for more. However, it's something for UNIX boxes. But you might get a copy of
>Emacs for NT.
>
>Gregor

I think Knuth proved it some years ago that alfabeta is finding everything
which minimax also finds.



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.