Author: James Swafford
Date: 20:17:45 05/11/04
Go up one level in this thread
On May 11, 2004 at 20:07:58, Dan Honeycutt wrote: >On May 11, 2004 at 10:26:44, James Swafford wrote: > >>On May 11, 2004 at 09:55:42, Jeff GAZET wrote: >> >[snip] >> >>I think you misunderstood my question: I wasn't asking "why store >>moves?" as a general question- but specifically for this case. >>Keep in mind there are (at least) two main uses for hash tables: >>to store scores (bounds or exact) and to store moves, presumably >>to help with move ordering. In this case, if you are going to >>do a hash insert, you simply don't have a move to store, so >>don't try to come up with one. >> > >I try. If the position is already in the table with less depth, but with a >move, I salvage the old move. I figure something is better than nothing. That's a pretty good idea. :) I'll rephrase: "... don't try to come with one [out of thin air]." -- James > >Dan H.
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.