Author: leonid
Date: 14:31:04 08/03/00
Go up one level in this thread
On August 03, 2000 at 14:14:38, Tom Kerrigan wrote: >I have 3 search functions: > >root_search() >search() >quiesce() > >The first two are almost identical, except root_search has some extra stuff for >the root of the search tree. What exactly is the root search? Have the impression that we have identical way of searching. If we start search, for instance, 8 ply deep and our search goes down to the ply 1, so ply one is root ply? I have those plys 1 and two that are different. >Quiesce is not important to you, as you have no inclination to do a quiescence >search. > >So yes, my program basically searches all plies the same way. > >In the endgame, my program usually searches between 800k and 1.1M NPS. (Pentium >III/800) Never reached this in my program. Tom, do you have some special program, that you can send to me, and that will permit me to send back here one doubtful position in graphics. I stroke one strange position that brought me initially to try it in few different ways. One was by homogeneous plys search and one by usual. All the time the same result. But my move is different from found by one leading program. Would like to find if some bug is in my program, or just two solutions have sense. My program say that two moves are different in almost one pawn value. Thanks in advance, Leonid. >-Tom
This page took 0.01 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.