Author: Stuart Cracraft
Date: 12:44:22 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. Done -- perhaps you can elaborate on your implementation of futility in qsearch -- I was just thinking about it and would like to see a practical result -- include pseudocode if possible and I'll implement in this research program here and write back with results!
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.