Author: John Coffey
Date: 19:12:44 03/23/00
Go up one level in this thread
Say hypothetically the computer is looking 3 moves ahead. Quiescent search is causing is to look even deeper on some lines. It might try some useless move and then the quiescent search causes it to look deep enough to see that there is still a win there (which could happen in some endgames.) So it has now chosen a continuation that is 5 moves long. Now when it comes across the same win in a 3 move continuation (without the useless move to begin with) then it will reject it because it has the same score. Maybe this scenario wouldn't happen because on the 2 ply search it would have found the win using quiescent search. I suspect that this is the answer. I just want to avoid a situation that I have seen many many years ago where a program will keep making useless moves because it still sees the win but isn't particular about how fast that win occurs. John
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.