Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Collecting PVs: hashtables vs. lists passing in search

Author: David Hanley

Date: 12:50:42 06/18/02

Go up one level in this thread



5% sounds way too high to me as well, but perhaps I'm/we're misunderstanding.

My method of PV updating uses dynamic allocation for PV updates, and it consumes
less than 1% of search time.



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.