Author: Omid David
Date: 08:26:56 07/16/02
Go up one level in this thread
On July 16, 2002 at 10:10:52, Vincent Diepeveen wrote: >On July 15, 2002 at 08:37:34, Omid David wrote: > >The below story is like saying doing alfabetapruning is not a good idea, >because minimax gives the same value, and that >Knuth's writing, proving alfabeta to give the same value is good >to show it is giving the same value! > >BTW, did you make a chessprogram of your own and is it using nullmove already? GENESIS, it's a slow searcher (100k nps) used for algorithmic research, since almost all current algorithms (including null-move pruning) are implemented. I merely use it for my MSc thesis research. Omid.
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.