Computer Chess Club Archives

Search

Messages

Subject: Is there a program that gives a tree after a long search?

Author: Uri Blass

Date: 02:07:12 01/03/01

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

• Re: Is there a program that gives a tree after a long search? Walter Koroljow 10:32:30 01/03/01
• Re: Is there a program that gives a tree after a long search? Dieter Buerssner 06:27:35 01/03/01
  • Re: Is there a program that gives a tree after a long search? Uri Blass 04:07:20 01/05/01
• Re: Is there a program that gives a tree after a long search? David Dahlem 03:07:08 01/03/01
  • Re: Is there a program that gives a tree after a long search? Uri Blass 03:18:08 01/03/01
    • Re: Is there a program that gives a tree after a long search? Uri Blass 03:30:45 01/03/01
    • Re: Is there a program that gives a tree after a long search? Mogens Larsen 03:26:09 01/03/01

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.