Author: Robert Hyatt
Date: 05:10:44 01/20/00
Go up one level in this thread
On January 20, 2000 at 01:45:49, David Blackman wrote: >On January 18, 2000 at 23:20:29, Robert Hyatt wrote: > > >> >>That isn't necessarily true. I have seen 100 move games with queens and rooks >>still on the board. And (at least in my case) we can take evasive action to >>recognize some zug positions and not let them become a problem... >> > >But the nodes in the search tree have different characteristics on average than >the positions likely to come up in an actual game. For one thing, most programs >tend to do at least some captures early in the movelist at any given node. That >results in most lines in the tree shedding material very quickly. We try "good" captures early. But a good capture simply refutes a bad move, which reduces the chance that a null-move failure is going to create a bad error in the tree. See my other post about an actual test over 10 positions. Most of the material comes off in the q-search, not in the full-width part of the search, because in an average position, most moves are not captures.
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.