Author: Uri Blass
Date: 07:41:05 02/02/04
Go up one level in this thread
On February 02, 2004 at 10:20:37, Robert Hyatt wrote: >On February 02, 2004 at 09:58:14, Uri Blass wrote: > >>On February 02, 2004 at 09:42:31, Robert Hyatt wrote: >> >>>On February 02, 2004 at 06:51:46, Vasik Rajlich wrote: >>> >>>>Congratulations on the victory. >>>> >>>>Also some food for thought in the selective search vs brute force search debate >>>>- maybe with great hardware and a longer time control, a fast brute force search >>>>re-enters the picture as a promising option. >>> >>>It has never left the picture. :) >> >>null move pruning is kind of selective search. >>I do not know of top programs that do not use selective search today. >> >>Uri > >I assumed he was talking about pure selective search, which is forward pruning. >I'm not doing that. However, I did run with the FUTILITY stuff turned on and it >ran just fine, but rather than pruning that just does depth reduction. I consider depth reduction as pruning. If it is no pruning then except null move I do not pruning. There are no moves that I never search independent of the remaining depth except cases of being 100% sure about the result(in KB vs K I do not search but return 0.00). Uri
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.