Author: Joshua Lee
Date: 14:38:12 07/31/01
Go up one level in this thread
How much memory for hash tables did they use? I know that fritz will take a long time but will find Qe3 but the explination as to why Deeper Blue did not is that it has to look over 14ply to find it and Full width search is what it did Fritz extends out 30+ moves so it comes up As i type this i say this sounds dumb I think you have a point here but maybe someone else can explain why this is so. However this is just one position and there are still 518 others so 259 others that you should test minus the positions from book!
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.