Author: Peter Fendrich
Date: 08:37:17 01/18/00
Go up one level in this thread
On January 17, 2000 at 16:47:24, Dann Corbit wrote: >I have a theory that NULL move hurts at very, very long calculation times. > >The reason I suspect that it is true is that if one position in ten thousand is >a zugzwang type and you consider a billion positions, a lot of them will be NULL >moves. Most of them will be the kind that really should be avoided (maybe 99% >or even 99.9%) but the 0.1-1% that really should be responded to get ignored. >When only a few million nodes are searched, I doubt if there is a problem except >in rare circumstances. > >Opinions? Am I all wet? Your statistics is probably good enough but the problem is that these probablilities aren't evenly distributed among all kinds of root positions. In ordinary middle game positions, yes and then it doesn't hurt a lot. In many end game and some other kind of positions it hurts so badly that you just can't ignore it. If the risk was evenly and "randomly" distributed among all root positions we could completely ignore the bad effects ... ... but reality is more beautiful than that! //Peter
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.