Author: Robert Hyatt
Date: 17:56:58 10/27/02
Go up one level in this thread
On October 27, 2002 at 17:14:22, Ingo Lindam wrote: >Hello... > >I just thought about some questions from Bob that lead me to a problem. >I know the engines should have as much knowledge as the programmer can give to >it. But ofcourse in may searchtree may appear some positions I can't apply a lot >(or in worst case any) of that knowledge: material is equal and all the other >knowledge doesn't fit to current position (in the tree). Will my score 0 (or >atleast very near to 0)? > >If yes...I just ask me whether this could lead the computer to optimize the best >move sequence into complete knowing nothing about the position the sequence of >moves end in... as more as I evaluate the positions for my opponent the same >way? > >Shouldn't I better substract something from my score and add something on the >opponents score in case I know nothing about the position? Any such idea is very dangerous. It is amazing how a full-width search to reasonable depth will mangle your evaluation if you have a big hole in it. In the example above, the program is going to try to force such positions that give it a slightly positive score, even if it is wrong. You basically need to make sure your eval is covering all the positional things you are aware of, and then watch as it makes mistakes and continue to add knowledge to fill in each and every hole. If you leave one hole, the search will force the tree into that "no-mans-land" and cause problems... > >Ofcourse I know it is very probably that this is already done by every engine >programmer and I just don't read anything about it yet or that I just make a >mistake thinking about it now. > >Who can tell me? > >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.