Author: TEERAPONG TOVIRAT
Date: 18:46:09 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 ? Hi, From time to time in this forum,there is someone posting this idea. As I remember,nobody agreed. From Turbo Gameworks Owner Handbook in 1985 ,the author(a Dennish ?) of Turbo Chess P.61.... ..... Some programs maintain tables with this information,which are then updated incrementally. However,it is just as fast to generate the moves directly from a given position.Although tables don't change very much when you move a single piece, it is still rather time consuming to update and restore them.. ...... But he didn't use bitboard move generation.So,I think you should try it yourself especially with bitboard. Teerapong
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.