Author: Pham Minh Tri
Date: 15:18:09 08/30/01
Go up one level in this thread
On August 30, 2001 at 16:43:47, Roy Eassa wrote: >On August 30, 2001 at 10:30:53, Koundinya Veluri wrote: > >>But here he's pruning not only the last ply of the search, but also the qsearch >>that comes after the last ply. I think a qsearch should be done before the >>"unmake move". I do something different. >> >>This code comes before any moves have been searched at the last ply, but after >>the null move is done. >> >>IF depth == 1 && not extended for check && not extended for mate threat && not a >>forced position (according to hash table) && not following pv THEN >> window = ???; >> qscore = Quiesce(alpha - window, beta + window); >> if(qscore <= alpha - window) >> return alpha; >> if(qscore >= beta + window) >> return beta; >>END IF >> >>Seems to be safe and improves speed on tactics a lot, when the correct window is >>chosen. Although it may look like a waste doing qsearch for every position at >>depth == 1, this does a lot more pruning than it does add to the tree. I tried >>the other futility pruning mentioned in the original post, but it didn't work as >>well for me. >> >>Koundinya > > >You were born in 1982?! Bob Hyatt was already an "old" (meant in the best way) >veteran of computer chess by then. And I was buying my second chess computer. >Man, I feel so old! Age tells nothing in science and computer chess, but only your works and contributions. If you have interesting knowledge or experience, please discuss us and teach newers. People should highly appreciate. In my case, if I feel tired, I will retire from computer chess first ;)
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.