Author: Brian Richardson
Date: 15:34:25 04/24/00
Go up one level in this thread
On April 24, 2000 at 17:31:39, Andrew Williams 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 > >Actually, I feel a bit foolish posting this. PostModernist has just finished >this test, taking 1686 (sic) seconds on my 300MHz K6-2. It keeps 64-bit pawn >and position hash keys, counts for pieces and pawns, plus 32-bit attack boards >up-to-date during move generation. > >Andrew Andrew don't feel foolish. OK, PM is 20x slower than Tinker at move generation, but PM has won vs Tinker 24 out of 26 games on ICC...
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.