Author: Jaime Benito de Valle Ruiz
Date: 13:08:13 12/14/03
Go up one level in this thread
On December 14, 2003 at 15:58:54, Albert Bertilsson wrote: >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 Sorry, let me see if I get this... we're going to keep doing perft(8) for 197281 positions, right? I don't think that do 8902 perft(9) is a very good idea, because even for powerful computers they could easily take hours for a single position. Just wondering, Jaime
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.