Author: Dann Corbit
Date: 14:46:37 06/25/04
Go up one level in this thread
On June 25, 2004 at 16:55:47, Stuart Cracraft wrote: >On June 25, 2004 at 16:46:31, Dann Corbit wrote: > >>What is your branching factor? >> >>The best programs have a branching factor between 2 and 3. >> >>If you already have a branching factor in that range, do not expect any more >>really dramatic speedups. > >This seems like a very useful measure to implement but I am not >sure how it might be done. > >Take the # of total legal moves searched at each node (prior >to cut) and divide by the total number of nodes searched across >all nodes? > >Time between iterations in mine goes up about 2x >to 6x per iteration but this is obviously a different measure >than what you are suggesting. That is close enough. Look at the deeper plies to see what sort of time ratio you are seeing. If those average around 2-3, there is not a huge amount of fat to trim. If they average around 5-6, then you will still see some huge speedups. Are you using a pvs search? That cuts a lot of nodes. IID gives better move ordering and sometimes cuts nodes because of that. Without knowing what techniques you are using, it is hard to speculate about what sort of speedups you might see.
This page took 0.01 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.