Author: Andrew Williams
Date: 07:50:53 01/19/03
Go up one level in this thread
On January 19, 2003 at 09:08:51, Joel wrote: >Hello All, > >Just finished writing a simple Quiscient Search function, using MVV/LVA... > >Now, previously my engine was using MTD(f) to power it. This obviously relies >heavily on the transposition table for good performance. > >So this brings me to the question of hashing Quiscient nodes. I would like to >know what the generally accepted thing to do is? > My MTD(f) program *does* hash qsearch nodes. Every time I test it, it is better than not doing so. But I'd guess that it depends a lot on the individual engine. The only answer is to test it both ways to see what's best for your program. >Btw, I am really envious of everyone who has an engine thats able to compete in >CCT5. Hopefully mine will be in an acceptable state next time round. :) > CCT tourneys are a *lot* of fun. Hope to see you there in the next one! Andrew >Thanks, >Joel
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.