Computer Chess Club Archives

Search

Messages

Subject: Re: Perft vs Search Re: Cache size does matter

Author: Reinhard Scharnagl

Date: 19:21:20 12/03/05

Go up one level in this thread

On December 03, 2005 at 22:14:20, Brian Richardson wrote:

>How similar are perft and alpha/beta trees?
>Can perft caching can really be used to guide PVS or other actual search
>caching?

The test was targeting to find a relation between intended thinking time and
cache size. Thus the absence of specialized search strategies has been intended.

Reinhard.

• Re: Perft vs Search Re: Cache size does matter Brian Richardson 06:18:53 12/04/05
  • Re: Perft vs Search Re: Cache size does matter Reinhard Scharnagl 07:29:21 12/04/05
    • Re: Perft vs Search Re: Cache size does matter Ed Trice 22:33:24 12/04/05
      • Re: Perft vs Search Re: Cache size does matter Reinhard Scharnagl 23:42:53 12/04/05
        • Re: Perft vs Search Re: Cache size does matter Reinhard Scharnagl 01:42:38 12/05/05
        • Re: Perft vs Search Re: cached Perft Results and Times Reinhard Scharnagl 01:28:10 12/05/05
    • Re: Perft vs Search Re: Cache size does matter Reinhard Scharnagl 07:35:01 12/04/05

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.