Author: Tim Foden
Date: 03:30:59 08/18/00
Go up one level in this thread
On August 17, 2000 at 18:50:19, David Rasmussen wrote: >On August 16, 2000 at 21:02:37, Peter McKenzie wrote: > >>On August 16, 2000 at 18:52:03, David Rasmussen wrote: >> >>>My Qsearch usually takes up 70-80 % of the nodes searched. >>>What are the, say, 10 best ideas/techniques to cut this number down? >> >>Very important is to be able to dump your search tree to a text file so you can >>figure out EXACTLY what is going on. If you do this (for shallow searches only >>of course :-), you will surely have many ideas for reducing the qsearch size. >> > >How do I do this the best way? > >I have a "SearchTrace"-like function now, that is able to do what you suggest, >but it's not esp. easy to read such a printout. I ended up writing a tree view program that read in the search trace file and displayed the info as a tree. The search file has all the iterative depths in it, and you can select which one to display. Writing the search trace output slows down my program a lot though. :) Cheers, Tim.
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.