Author: Uri Blass
Date: 07:39:21 12/13/01
Go up one level in this thread
On December 13, 2001 at 09:38:37, Steve Maughan wrote: >Uri, > >>The evaluation is always inacuurate so I do not see why it is more inaccurate >>when you search deeper. > >Virtually *all* evaluations are inaccurate to some degree :-) > >The reason is is more inaccurate is that it is further away from the root where >the piece table was initialised. For example at the root black may have a king >on g8 and white may think it is a good idea to have a rook on the 7th, >increasing the value of rook-on-the-7th piece values. However in the search, >Black may move his king from g8 to g6 but white will still give a bonus for a >rook on the 7th. This is a simple example but you can see the idea. > >Steve You assume that the table is initialized every time in the root. My original thought was about the case when the table is initialized only once for all the game. Uri
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.