Author: Marc van Hal
Date: 10:22:26 01/10/03
Go up one level in this thread
On January 10, 2003 at 05:19:58, Hans Christian Lykke wrote: >On January 09, 2003 at 14:17:06, Stan Arts wrote: > >>Hello, >> >>I often read computerprograms are so bad at correspondence chess. That would >>make sence, since they run up a very steep wall after about 10-15 full moves of >>analysis. >> >>Wouldn´t it be possible however to write a program, that could spend it´s hours/ >>days of time for a move in a different way, searching much shorter, say just 5 >>minutes or less per move and then automaticly "play" (like in normal games) >>lines against itself to great depths, sometimes discovering refutations, and >>then disregarding this move and try to resolve other moves this way. >> >>So it would be sort of like replacing the human doing the analysis with computer >>help by another part of computer-code. >> >>Wouldn´t it be possible for the program to get to greater "depths" than it can >>in >>normal search? And find much deeper ideas and refutations like this? >> >>BUT, there are no programs doing this..so that would usually mean this idea >>doesn´t work. :) >> >>Why wouldn´t this work? >> >>Well, just a thought i have been having, >> >>Stan > >I think that "Deep Postion Analysis" can do most things that you want. >Best Regards >Hans Chr. Lykke This for sure is no treu At least not in the methode of the Chessbase products Because you come to a certain point where no or to less branches are made. Or you should do it over and over again after each move Stil then you might not have the corect vieuw because instead of the 5 move the 6 move is the best Which will not be covered. Marc
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.