Author: William H Rogers
Date: 08:03:56 07/25/03
Go up one level in this thread
Dann In my understanding of qsearch when upon entering this part of the search tree the program is taking the last move and trying to see if the piece being moved can be captured and could the capturing piece be captured in exchange. I know that this over states the whole algorithm, but then consider the following: If during qsearch and a check is discovered, does the program try to move the piece out of check? In other words are you checking check extensions while in qsearch? It should not be hard to add a little more to your qsearch subroutine to help quell this matter although I do realize that checks and rechecks can go on for a long time. Not all implementations of qsearch do check extensions. I don't know if this helps or if I am even on base as far as your question goes. Bill
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.