Author: Russell Reagan
Date: 10:44:06 06/15/02
Go up one level in this thread
On June 15, 2002 at 11:36:29, Christophe Theron wrote: >About the "fork" example: I would not treat it by evaluation. I have tried and >it does not work. The solution of this problem must be found in search or >QSearch improvements. Why doesn't it work? It seems to me that as long as you are able to hammer out the details of detecting forks and special cases you should be able to implement this (or any other tactical recognition) statically in the evaluation function. Of course, I have never tried it myself, so you surely know better than I do, but I'm curious if you could provide us with some information as to WHY it won't work. Is it because there are too many special cases to handle to make it accurate? Thanks, Russell
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.