Author: Fernando Villegas
Date: 12:42:19 03/10/00
Go up one level in this thread
I am not mathematician neither programmer, but I presume having enough common sense to say that: a)if a so called knowledgeable program -good or bad- is one with more lines of code than a no-knowledgeable program, that means it takes more time for each move to evaluate and so with more time has a better chance to reach the critical deep in plys that can give it a relevant better output. b) on the contrary, a more tactical program, more based in search techniques than in algorithms, will tend to fall in a decreasing rate of profit with more time as much a deeper search for an already deep search has less meaning than a deeper search for a non-deep search. Of course all this is very debatable. Is there a critical number of plys that produces dramatic improvement if you reach there with more time? Has sense the notion of "decreasing profit" when just one better move discovered by a deeper search can make all the difference? Etc Fernando
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.