Author: Daniel Clausen
Date: 12:05:59 01/24/02
Go up one level in this thread
On January 24, 2002 at 14:56:59, Russell Reagan wrote: >So perft is the number of unique positions encountered to a given depth? >Duplicate positions are not counted twice, as I understand it from your >explaination. > >If it counts the number of unique chess positions, it seems like that would be >quite a task to generate the entire search tree and store it in memory, remove >duplicates, and count the nodes. How is this usually implemented? > >Russell Sorry I wasn't clear enough in my previous post. Duplicate positions are counted twice. 'perft n' calculates the number of differeny n-ply games from a given position. Here's the relevant finger-info about kiwipete's position: 3: There are 119,060,324 different 6ply (3 moves) chess games 4: there are 4,865,609 different 5ply chess games 5: The following position is a move generation test. Listed are the number of different games from that position to ply 1,2,3,4, and 5. 6: r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 7: 48; 2,039; 97,862; 4,085,603; 193,690,690 Sargon
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.