Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: DPerft resistence is futile!

Author: Albert Bertilsson

Date: 12:58:54 12/14/03

Go up one level in this thread


I have a database with all the perft(3) positions (8902 positions). The clients
calculate perft(8) for each position, this gives a perft(11) for the whole
problem. For perft(12) the client have to do perft(9) calculations or the
database could have all the perft(4) positions. Duplicate positions are handled
be the server, when the result arrives for a specific position the result is
written for all positions that are identical.

/Regards Albert



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.