Author: José Carlos
Date: 14:25: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? > >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 I find your idea very interesting. I had never though it that way. All in all, it's very rare that the program knows nothing about a position. Most probably it applies wrong knowledge, but it always applies knowledge: material, pawn structure, strong / weak squares, open lines, king safety, piece mobility. These things are always there. It could be that they don't matter at all in certain position, but then the program can do nothing to know it... or am I missing something? José C.
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.