Author: Stuart Cracraft
Date: 12:43:18 07/06/04
Go up one level in this thread
On July 06, 2004 at 14:58:31, Cesar Contreras wrote: >>3 3 1 futility > >First time i implemented futility was on qsearch, and it took about 10 minutes, >and the gain was big. Maybe you could divide futility, on qsearch, on frontier >nodes and on prefrontier nodes. > >On frontier nodes the win was almost nothing, i acuse my slow implementation for >it. > >Maybe you could increase your numbers, to see a difference. ie two tier >transposition table it's more dificult to implement-debug than one thier. EFFORT RETURN RETURN/EFFORT Feature 1 10 10 capture ordering 3 4 1.33 null move 4 4 1 null move with verification 4 4 1 search pv first 2 1 .5 fractional extensions 4 6 1.5 static exchange evaluator 4 5 1.25 transposition table 4 5 1.25 transposition table with 2-tier repl. 3 3 1 history heuristic, killers, other ordering 2 1 .5 aspiration 4 5 1.25 book learning 3 3 1 position learning 2 2 1 iterative deepening 3 1 .33 internal iterative deepening 2 2 1 pawn hashing w/ complex pawn evaluation 3 3 1 king+pawn hashing w/ king safety evaluation 3 2 .66 capture extension 1 5 5 check extension 1 1 1 pawn to 6th/7th extension 2 3 1.5 futility in qsearch 3 3 1 futility on frontier 3 3 1 futility on pre-frontier 3 2 .66 razoring 5 3 .6 mate-at-a-glance
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.