Author: Heiner Marxen
Date: 12:21:19 04/12/02
Go up one level in this thread
On April 12, 2002 at 10:06:34, Oren Avraham wrote: >I've made some mistakes in my explenation: >positions on the same ply (siblings) has lot's of similar moves comparing to the >change. >my idea is to take the last sibling's moves and recalculate only the moves that >might have chainged, but leave the moves of pieces that does not relate to the >change intact. >my rules of thumb are: >1) delete all the moves of the moved piece. >2) delete all the moves of the pieces that attacks the moving piece >3) delete all the moves of the pieces that attacks the destination of the moving >piece >4) in case of attack, delete the moves of the attacked piece as well >5) regenerate all the moves of the pieces that were deleted before. > >- is that all or am i missing something ? Just some hints: - [un]blocking pawns - e.p. - castling >- will it work ? It surely can be made to work. >- will it give any improvement or it is already known as a failure ? I don't know about any public results for this. Also, I would expect the timing to be highly dependant on your exact data structures. It may even go the other way round: the data structures may get changed just to speed up some cute algorithms. Happened to me, at least. Cheers, Heiner
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.