Author: Ratko V Tomic
Date: 21:22:26 10/20/01
Go up one level in this thread
>adds (2^H)*P/2^P bits per position, i.e. a small fraction Oops, the formula should read: (2^H)*(P-H)/2^P, i.e. (P-H)/2^(P-H) bits of hash overhead per position (which then correctly handles the boundary case P=H, with zero hash overhead).
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.