Author: Frank Phillips
Date: 11:25:45 11/28/98
Go up one level in this thread
[snip] >>Try them after the hash table move. The HT move should always the first move you >>try. >>If you search captures before the other moves, try without storing captures in >>the killer tables. >>Try killers before or after the captures. Compare the 2 versions. >>Try with and without killers in the QSearch. Depending on your program it may >>impact in the wrong direction. Thanks. Order seems important . Killer moves are a big help in some positions. >>At what time control, on which computer and with how many HT? 10 seconds per move. PII 450MHz. Refutation/transposition and pawn hash tables – 0.25M entries. >>In assembly or with interpreted Basic? C. >>And on which planet? :) Earth. If my question seemed strange put this down to inexperience. This is my first attempt. But I thought that the number of moves that the search considered out of each position’s (node’s) move list would be an important performance indicator. Mine averages around 9 in the middle game, which seems high. I got the impression from posts here that 2 or 3 is probably closer to the norm? My program manages about 7-8 ply (plus check and recapture extensions, and quiescent search) in 10 seconds at about 80k nps. Crafty, at twice this speed, goes disproportionately deeper. Something badly messed up I guess. >> Christophe Frank
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.