Author: William Bryant
Date: 11:02:58 02/06/00
Go up one level in this thread
On February 06, 2000 at 12:17:50, James Robertson wrote: >On February 06, 2000 at 08:08:36, Marek Mahdal wrote: > >>I need a algorithm, that generates all possible moves in a position. Is there >>anybody, who can help me ??? > >As far as I know everybody uses something similar: > >a) scan the entire board finding pieces >b) once you find a pice, generate moves for it and add them to the move list. >c) take care of extras (castling, ep, etc) > >I don't know if I would call this an algorigthm, since everybody does it so >differently, but this is basically how moves are generated. > >James Although this _is_ how I do it at present. You can also keep a piece list, or use piece bitboards and simply walk through the list generating moves for each piece. Some, Dan Corbit comes to mind, feel that significant time is wasted walking through the board to find each piece for the side on move. What I would like is someone to explain a simple method for generating sliding piece moves from bitboards. How to quickly determine where sliding pieces stop moving because their path is blockes. William wbryant@ix.netcom.com
This page took 0.01 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.