Author: Vincent Diepeveen
Date: 04:17:03 06/04/02
Go up one level in this thread
On June 04, 2002 at 02:33:55, Russell Reagan wrote: I have been wasting a lot of time in search past years. Like last months i have wasted my time working on forward pruning. Sure i can search 3 ply deeper with it (and kicking out singular extensions and other extensions). However if i do that, then it scores simply 20-25% worse in tests against commercial programs. The reason was not so hard to find for me. It simply goes for 1 move and stays with that move. The rest gets forward pruned. Chances to find a superb move is way smaller. So in short what i used in i-csvn2 and what i will keep remaining to use for the foreseeable future is a combination of nullmove, hashtables, PVS and quiescencesearch. Only thing that might get worked at, are a few extensions like i don't like SE too much, but i have no good alternative yet to replace them. In short the search is pretty simple compared to what you have to do for a forward pruning search. >On June 04, 2002 at 02:26:57, Dann Corbit wrote: > >>You can do things in parallel. When you are bored with search, work on eval. >>When you are bored with eval, work on search. A lot of time will be spent >>removing bugs. > >What exactly is there to work on in terms of search? Does this include things >like move ordering? Other than that, it sounds like somewhat of a black art. >Like you say that the "limit" is the number of nodes in the principle variation, >so theoretically there is a TON of room for improvement, but it also seems like >there isn't any clear way of achieving that. So it sounds like other than move >ordering, it's kind of a research area, unless I'm missing some other things >that are included in the area of "search", when you speak of improving it. > >Russell
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.