Author: chandler yergin
Date: 01:08:20 10/11/05
Go up one level in this thread
On October 11, 2005 at 02:26:24, Dann Corbit wrote: >On October 10, 2005 at 23:05:39, chandler yergin wrote: > >>Use basically the same Alpha Beta Mini/Max search functions? > >Everyone uses some variant of Alpha-Beta. > >There is a paper that shows that MTD(f), C* and other variants can all be >formualted in terms of a common architecture. > >Basically the same is a big stretch though. > >The important thing is the branching factor. The best programs will have (on >average) a branching factor less than 3 most of the time. The alpha-beta >branching factor is about 6 in a perfectly ordered tree. Therefore, there is >some pruning besides alpha beta going on in all the really strong programs. Thanks Dann
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.