Author: Tony Werten
Date: 00:49:02 05/17/02
Go up one level in this thread
On May 16, 2002 at 11:32:52, Uri Blass wrote: >On May 15, 2002 at 21:09:14, Joe McCarro wrote: > >>Sometimes I have my computer analyze a position overnight. I have an amd 1gig >>with 256 ram and a p2 266 with 512 ram. >> >>Q: If I set the hash tables at say 192 for the p2-266 and 92 meg hash for the 1 >>gig athlon which will have better analysis in the morning. >> >>I'm wondering if once the hash is full tif the computer slows ddown so much the >>difference in processor is effectively nullified. >>thanks in advance. >>Joe > >No >The difference in proccesor speed dominates. > >The computer does not run slower when the hash tables are full. Right, but the branchingfactor goes up. If it goes up by 10% only, by the time you reach ply 15, the difference in processorspeed is gone. > >I can often get with my program (movei) a branching factor of less than 4 even >without hash tables. Doesn't matter. It's the difference that counts. ie If without hashtables you get a bf of 4, what would you get with HT? Now, how much faster does the program without HT has to be to get to the same ply in the same time ? If you let a program run for 12 hours, you'll get pretty amazing numbers. Computerchess is all about getting low branching factors. Tony > >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.