Author: Ingo Lindam
Date: 00:57:56 12/03/02
Go up one level in this thread
On December 03, 2002 at 01:53:22, Les Fernandez wrote: >On December 03, 2002 at 01:24:57, Uri Blass wrote: >>I plan to continue to make progress by better search rules. >>I believe that better pruning rules can help movei to be significantly faster. >> >>I believe that programs search too big trees and it is possible to reduce them >>by at least 90% if you make the right observations. > >Wow ! 90%? Uri do you think that is obtainable? That would be a most significant >contribution to chess research if that can be done. Lots of luck and please >keep me posted occassionally as to how you are progressing. > >Les >>Uri I agree with Uri... or just imagine the same. Atleast 90% in atleast... a lot of positions. Ofcourse there will keep some positions or roots of subtrees where a lot more than 10% of the variations is needed to verify a tactical solution of the problems of the given position. One solution could be to prune /cut off variations having a bad score AND also having a bad second score in an evaluation that just measures the chance of big changes (in the right direction) in the first score. Ofcourse this needs to have a reasonable evaluation for the second score. Internette Gruesse, Ingo
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.