Author: Robert Hyatt
Date: 13:42:13 10/22/99
Go up one level in this thread
On October 22, 1999 at 11:43:37, KarinsDad wrote: >Does any program currently do a sacrifice search? > >By this, I mean the program intuits that a sacrifice may be in order (within the >first 3 ply maybe), and then pretends that the sacrifice move is the PV and >searches down it's ply to a deeper depth or somesuch in order to find out it's >validity. > >Or, do all current programs only make a sacrifice if they perceive a definitive >gain within the same ply depth as most other moves? > >KarinsDad :) I find them via a normal search. The point being that you should see how many times a sacrifice works, how many times you 'think' it works, and then figure out how much effort you spend proving that most don't work. As opposed to spending that effort on a normal tree search...
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.