Author: Uri Blass
Date: 03:18:08 01/03/01
Go up one level in this thread
On January 03, 2001 at 06:07:08, David Dahlem wrote: > >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 No. This is not what I meant. I meant to a regular long search when the only difference is that the program tells me more information For every illogical move of black that was considered for more than 1 second it should tell me the killer move. (the killer move does not have to be the best move because the program has no idea about the best move after a long search). It should also tell me the killer move for every illogical move of white that was considered for more than 1 second. It should not tell me about lines when both sides played illogical moves because these lines are not relevant to prove the score. This is all the information that I need to understand the reason for the score of the program. Uri
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.