I’ve quite happy with the global list of possible move. Now I need to turn my attention to move generation. For the pieces which don’t slide (i.e. pawns, knight and kings) this is trivial. For sliding pieces I’m going to use the “new kid on the algorithmic block” – Magic Bitboards. I’m in the process of going over Pradu Kannan’s 2007 paper. I need to think about how I will generate my magic multipliers. At this stage I’m not sure if I’ll do it in Delphi or C. I also think a fixed shift seem to be sensible (from simplicity).
http://www.chessprogramming.net/wp-content/uploads/2015/05/ChessProgramming-Logo-20151-300x138.png 0 0 Steve Maughan http://www.chessprogramming.net/wp-content/uploads/2015/05/ChessProgramming-Logo-20151-300x138.png Steve Maughan2013-03-12 19:48:342013-03-12 19:48:34Bitboards Magic Number Research