Computer Chess Club Archives

Search

Messages

Subject: Re: Is crafty the fastest program to calculate perft with no hash tables?

Author: Dann Corbit

Date: 13:06:34 06/20/01

Go up one level in this thread

On June 20, 2001 at 16:00:53, Peter McKenzie wrote:
[snip]
>Oh, btw, LambChop can count the 6ply tree from the root in 20sec on PIII
>1000mhz.  It is faster than crafty because it counts moves at depth 5 not
>positions at depth 6 and hence effectively it has to search one ply less in the
>tree.  It can do this because I have implemented a fully legal static move
>generator that does not need makemove to exclude illegal moves.

!!!
How did you do that?
Smoke and mirrors?  Lookup tables?  Plugged into a cray?
!!!

• Re: Is crafty the fastest program to calculate perft with no hash tables? Peter McKenzie 15:41:59 06/20/01
  • Re: Is crafty the fastest program to calculate perft with no hash tables? Heiner Marxen 16:06:53 06/20/01
    • Re: Is crafty the fastest program to calculate perft with no hash tables? Dann Corbit 17:28:39 06/20/01
      • Re: Is crafty the fastest program to calculate perft with no hash tables? Heiner Marxen 04:53:12 06/21/01

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.