Author: Ren Wu
Date: 11:18:04 05/23/98
Go up one level in this thread
I think KK miss the point here. Don's paper has outlined a framework to apply TD methods to chess evaluator. In fact, it is not just for chess, his framework can be easily applied to most other games as well. And what it can learn is not just piece values but can be any evaluaion terms. For me, the method, or the way to solve the problem, is a lot more important. I doubt that the search depth will effect the knight value that much, but that is once again not the point, the point here is the way doing things, not the experiment results. If you suspect that search depth will effect the knight's value, why don't you repeat the experiment but with greater depth? And report the result here. Even if you come up a vast different values, there is still no flaw in this framework, because you are still in the same framework. The framework has no search depth limitations. There is no major flaw in that research. ( And maybe there was flaws in your way to look things. :-) ) Ren (renw@iname.com)
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.