Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Which Algorithm is considered the best ?

Author: Dan Andersson

Date: 09:35:19 08/05/00

Go up one level in this thread


MTD is plain alpha-beta search w. a minimal window, no more complex than that.
The theory of it MTD is more involved, but the implementation is not. i.e. if
you have alpha-beta with transposition tables it is at most a few minutes work
implementing it, that includes compilation and cut and paste (I believe you have
ab implemented?). PVS Negascout is conceptually simpler but slightly more work
implementing, IMO.



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.