Author: Daniel Kang
Date: 10:44:42 11/19/00
Go up one level in this thread
On November 19, 2000 at 13:09:26, Ricardo Gibert wrote: >On November 19, 2000 at 12:31:20, Daniel Kang wrote: >>Right. But we are talking about a *perfect* evaluation function. If the >>evaluation function can only distinguish between the three ultimate outcomes, >>search (beyond one ply) becomes completely redundant. I guess it depends on how >>you see it but I'd expect a perfect eval to be able to tell if a position is >>drawn or not. >Well, the trouble is, what we are discussing here is a three-value-eval >consisting of win, lose, or draw. I don't see how you can do it in eval rather >than in search without at least *implicitly* using Mate-in-N information. This >would represent the use of a much finer eval than a three-value-eval. At some level, you need to tell if a position can be mated in N moves or not. That is part of what it's meant by whether a position is won, drawn, or lost. I think we're taking the original comment way too seriously though. It wasn't meant to be this precise and we're basically arguing about how precisely that could be interpreted. Clearly, if you were to be able to tell the theoretical value of a position, the same algorithm should, at some intermediate level, have information on how to get there. >The other problem is, to be consistent, you must also incorporate repetition >detection in the eval rather than in the search. This is really stretching >things. > >Your interpretation is possible, but I don't see its "real world" value. My >interpretation is actually doable in a limited domain such as K+R vs K. I'm just >exploring the "real-world" consequences of using a three-value-eval and in that >light, I think I am making the more reasonable assumption. Yes? No? Maybe? Interesting. The idea is probably way too impractical for us to draw the line between reasonable and unreasonable. Btw, does anyone know if there has been a competitive chess program that uses as its score the probability of each of the three outcomes and how close the position to its probable outcome? Dan.
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.