Author: Dann Corbit
Date: 10:46:57 02/26/99
Has anyone who writes a chess playing program tried Dynamic Hashing like Popeye uses? I was wondering, because I saw the tables Dr. Hyatt posted showed what looks to be a logarithmic decrease in payback with increased memory [that is, you invest x bytes ram, your payback is only O(log(x))].
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.