Author: Dann Corbit
Date: 14:17:09 01/06/99
Go up one level in this thread
On January 06, 1999 at 16:06:57, Jay Scott wrote: [snip] >This sounds like a database-oriented variant of what I've called >playout analysis: > > http://forum.swarthmore.edu/~jay/learn-game/inspire/playout.html > >It can also be seen as a selective search with a very large persistent >tree. In fact, if you always started the analysis from the root then it would >be a classical best-first search. > >You sound more optimistic than I am about how well this is going to >work. I'd say you're pretty much guaranteed to discover some interesting >surprises, but I think you'll have a hard time convincing me you've >achieved the "exponentially improved" analysis that you're expecting. Keep in mind that I do not run the process once. I run it again and again as many times as I like. If any data points are missing, I generate them. I could be wrong, but I really do expect an exponential improvement. I knew about "real" simulated annealing. I did not think it would be confused, since I have never seen it used in a chess context. [snip]
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.