Author: Tom Kerrigan
Date: 02:39:56 04/23/00
Here's Peter McKenzie's move generator test position: r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - There are 193690690 possible 5-ply "games" starting from this position. How long does it take your program to visit all the positions of these games? It takes my program 178 seconds. I have a 400MHz Celeron. My code incrementally updates a 64-bit hash key, a 64-bit pawn hash key, and four material counters (white pieces, white pawns, black pieces, black pawns). I'd like to find out if anyone is doing significantly better than this, and hopefully what methods they're using. :) -Tom
This page took 0.15 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.