Author: Severi Salminen
Date: 09:47:04 12/28/01
Go up one level in this thread
>I think that I will not continue to argue about this point >but it does not mean that I agree. Oh, we are not arguing, just discussing like polite men do ;) >I know that selective search is something that >I cannot be sure about but there is a difference >if there is a result that I can be sure in 90% that >it is correct tatctically and if there is a result that >I can be sure only in 40%. > >It may be interesting to look at many qsearches of more than >7 plies in order to find out how many of them have >a tactical mistake that means that >there is a better move at some ply >that is not considered in the qsearch. I just don't understand what you do in those cases where you return from qsearch at 7 plies deep in the middle of sequence. Your engine will go crazy and might give totally wrong results. But I have no idea how much 7 is as I've never actually tested how deep my search goes. I think 7 is quite a lot and there are no many situations (at least with SEE) where qsearch goes further. So you might go even slower because you have to pass and test the depth variabe more often. I mean that if you start qsearch at the first place you should also complete it, not terminate before the end. Tomorrow I'll try to test different values of this limit and it'll be interesting to see how (if at all) it affects. I'll return to this. Severi
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.