Author: Marc Boulé
Date: 16:58:18 04/10/02
Go up one level in this thread
>It's possible that a large reported qsearch is either the result of counting >nodes differently than other progs, or doing checks, or both. I count nodes in >make_move, and test for checks only in the first ply of qsearch, which results >in about 50% qsearch vs internal nodes. > >It's odd, but I think if people aren't aware of differences caused by how nodes >are counted, they may spend time trying to fix things that aren't broken, or >vice-versa. > >Will This might be a stupid question but how does one use the transposition table during q search? Since 50% of nodes are in q search, it would be very usefull (I currently don't do any hashing during qsearch). Writing and reading to/from the hash table is not legal since the subtrees aren't complete (only captures are expanded, and to variable depths). Marc
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.