Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Research idea? re: weight optimization

Author: Tom Kerrigan

Date: 04:39:37 12/29/01

Go up one level in this thread


On December 29, 2001 at 05:41:02, Uri Blass wrote:

>It is possible to  choose only moves that your program can find after a long
>search but in this case you need to waste a lot of time to find big number of
>positions

I would not trust my program to produce moves that are any better than GM moves.
I'm not sure I'd trust anybody else's program, either. It is not hard to find
examples of programs giving you bad moves after "long" searches.

>2)It is possible that after you change your evaluation based on position A and
>change your evaluation based on position B your program is unable again to find
>the right move in position A.

Right.

-Tom



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.