Author: Tom Kerrigan
Date: 17:44:02 05/25/00
Go up one level in this thread
On May 25, 2000 at 19:08:11, Oliver Roese wrote: >On several occasions it was said, that Fritz 6 is a so called "root-processor". >Could someone explain this approach, or point to some papers? >Thank you very much in advance!:) > >Oliver Roese A root processor is a program that does its positional evaluation at the root of the search tree (root = the position that the computer is supposed to analyze). For example, if black's king is on e8, the root processor may assign a very high value for a white queen on e7 before it starts searching. The problem is that if black's king moves (e.g., castles) then a white queen on e7 is no longer as valuable, but the root processor can't take this into account because the king was not castled at the root of the search tree. The advantage is that root processors are extremely fast--they just do a table lookup to see what a queen on e7 is worth. They don't have to calculate the distance between the queen and the king at every position that's searched. -Tom
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.