Author: Dann Corbit
Date: 10:44:55 08/26/02
Go up one level in this thread
On August 26, 2002 at 13:32:23, Steffen Basting wrote: >On August 26, 2002 at 13:29:02, Stan Arts wrote: > >>Hello Steffen, >> >>But do you use null-move pruning or similair technique in your program yet? >>If not, the searchresults you are getting would make sence, and seem perfectly >>normal to me. (actually very good in that case!) And I think the only way to >>really start reducing branching factor in a program with alpha-beta and a Q- >>search would be to implement an idea such as null-move pruning. >> >>Goodluck! >> >>Stan > >Yes, i use nullmove prunning with R=2 and principal variation search. I think 7 >plies in blitz are ok if I don't use hashtables, but i don't reach more than 8 >plies in tournament time control, which seems rather "weak" to me... Hashtables will help an enormous amount. You will get better move ordering which will shrink your trees a lot. Your NPS figure seems very low. What sort of machine are you using?
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.