Author: Tom Kerrigan
Date: 13:44:14 12/29/01
Go up one level in this thread
On December 29, 2001 at 04:49:49, Otello Gnaramori wrote: >On December 29, 2001 at 04:40:03, Tom Kerrigan wrote: > >>On December 29, 2001 at 04:24:55, Otello Gnaramori wrote: >> >>> >>>Taking as an example Kasparov, he is renowned for his powerful calculations >>>capabilities of the variations (...tree), both in analysis and both in OTB. >> >>Being able to come up with variations does not a tree searcher make. > >Don't you think that variations are made in a tree form, and the variation can >be also searched in a decisional process to establish the *best* move? >(Actually is what Kaspy do staring at the board in important tournaments...) > >> >>A SEE can come up with a variation and it's not searching anything. >> >>-Tom > >What is a SEE ? Anyway I think is just a matter of terminology misunderstanding, >probably we are SEEING in the same way this matter but from different p.o.v.'s >(point of views...) > >Otello A SEE is a Static Exchange Evaluator. Based on the attacks of _the current position_, it guesses whether or not an exchange can be won. This is used to prune the quiescence tree. -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.