Author: Sune Fischer
Date: 07:30:10 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 ? >- will it work ? >- will it give any improvement or it is already known as a failure ? > >10x again... Sibling positions can be far apart, a lot more than one move, probably at least two as far as I can see, and this you also need to keep track of in some way :( With the incremental approch I suggested, it is also 2 moves, so how many moves you can actually reuse maybe less than 80%, and you still need to design a very fast method of finding which moves should be updated. The knights and pawns are probably doable, but the sliding pieces present a problem. -S.
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.