Author: Dann Corbit
Date: 16:34:44 07/25/00
Go up one level in this thread
On July 25, 2000 at 19:30:28, Tom Kerrigan wrote: [snip] >If my evaluation function gave positive scores to winning positions, it would >win all of its games, period. If the positive scores were random, it would >probably win in stupid ways, but it would still win. I think this is back to square one. This assumes that we have perfect knowlege so we *really* know that a winning move is a winning move. We don't really know that. Also, from any given position, it seems likely that about half the moves are bad and half are good from some abstract sense (but it probably won't work out that way -- but with an incalculable number of possibilities we can't find out). At any rate, from some position, the forward positions may have many positive scores, but only one best score. If we have 'ideal' information, then any positive score is as good as any other. But I don't think we have it nor are we likely to receive it.
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.