Author: Gian-Carlo Pascutto
Date: 02:44:56 12/17/02
Go up one level in this thread
On December 17, 2002 at 05:34:31, JW de Kort wrote: >Indeed i did. Most of its time is pend in the evualation code but that is nomal. >Also a lot of time is spend in the capture move generation and the in check >function. If i could speed of these things i would get a large pay off. > >But ther is another question involved. Iám not realy a good prograamer and i >just want to learn more about efficient programming. SO if this will only give a >small benefit i would be (partly) happy. Here's some typical tricks: a) In the incheck test, use the information about the previous move to limit what to test. I.e. if the previous move was a bishop move, you can only have a diagonal check or a discovered attack. b) Depending on how your qsearch looks, you might not have to check for being in check at all. Just return a special value that says 'the king was captured' whenever it happens, and assume the move was illegal one level up in the tree. -- GCP
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.