Author: Alessandro Damiani
Date: 10:52:58 12/01/02
Go up one level in this thread
On December 01, 2002 at 11:17:34, Jean Bouchat wrote: >We have made a Winboard chess program that can make a brute force search only to >a fixed (for the whole game) depth before calling quiescence. Our move-ordering >is none to zero wich make it rather slow (espescially for the quiescence: it >considers crazy sequences like 1.Qxa7 Qxh2 2.Qxa8 Qxh1... when there were rooks >on a8 and h1 !). >We wish now to implement iterative deepening in order to improve the speed and >adaptibility to various time controls. Does anybody know were we can find >detailled (we already have some) informations on the subject (move ordering, >killers, what to keep in memory to speed up search of the next ply, ...). >Generally speaking, how does the search tree look like: > - brute force + quiescence > - brute force + selectivity + quiescence > - selectivity + quiescence > - ... ? >Thanks Did you try the CCC search engine? Alessandro
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.