Author: Ingo Lindam
Date: 09:54:00 12/03/02
Go up one level in this thread
On December 03, 2002 at 11:29:56, Robert Hyatt wrote: >Within the framework of alpha/beta there is no way to do this. > >Why? > >Because alpha/beta doesn't search the entire tree. It searches the first branch >at the >root, for the score, then it uses that score to prove that the other root moves >are worse, >without proving exactly how much worse they are. > >And therein lies the problem. To get the second best move, you don't just prove >that it >is worse than the best, you have to search it completely to see exactly how much >worse >it is, and that drives up the time exponentially. Sorry, but to me is not clear... WHAT drives up WHAT TIME exponentially in comparisson to the TIME it takes to OBTAIN WHAT? or in different words: It takes time t to obtain ............(single best variation?) then it takes aprox. time t^n to obtain ............(n best variations?) where n is ............(n(best variations)?) assume t = const. (?) or exponentially with number of plys...? (don't need an exact formula, just want to understand what you mean / think of) Internette Gruesse, Ingo
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.