Author: David Dahlem
Date: 03:07:08 01/03/01
Go up one level in this thread
On January 03, 2001 at 05:07:12, Uri Blass wrote: >The problem after a long search is the fact that I do not understand the reason >for the score. > >I think that it is possible to give a tree. > >The idea is that only lines that were searched by the program for more than one >second(or different time control that the user choose) are going to be included >in the tree. > >The tree should include also only killers move for one side. >I mean that if the program analyzed 1.e5 dxe5 2.a3 when 2.a3 is not the killer >move of 1...dxe5 then the tree is not going to include 2.a3 > >Uri Hiarcs 7.32 has a correspondence analysis that the user can set either time control or depth and it will give a tree. I think Fritz 6 has something similar. Possibly this may be what you want. Dave
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.