Author: Robert Hyatt
Date: 07:09:53 04/23/00
Go up one level in this thread
On April 23, 2000 at 10:08:46, Robert Hyatt wrote: >On April 23, 2000 at 05:39:56, Tom Kerrigan wrote: > >>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 > > >using bitmaps: > >total moves=4865609 time=66.60 that was run on a PII/400 Sony Z505rx notebook (66mhz FSB)
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.