Author: Ricardo Gibert
Date: 02:11:58 04/07/03
Go up one level in this thread
On April 06, 2003 at 18:30:29, Igor Polyakov wrote: >In aspiration search, the "estimated" values for Alpha and Beta, are they aimed >to cause cut-offs in the very first part of the tree without having to generate >Alpha and Beta values by evaluating the branch completely? Can you please >provide a very detailed response? I am kind of confused on WHY it's an >improvement since I only see improvement in one branch with the risk of doing >re-searches. > >About PVS and null windows...how do null windows cause more cut-offs? I would >really appreciate if you pointed me to a very good website with detailed >explanation, and a lot of pictures, etc. I kind of don't get it. > >Thank you for your time. This might help: http://www.brucemo.com/compchess/programming/index.htm
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.