Author: Zach Wegner
Date: 14:18:43 08/18/02
I am very new to chess programming on the whole, and have started programming a chess engine. I have chosen bitboards as the board representation mostly because everyone seems to agree it is the best. Now that I have started to go deeper in the move generation and search functions, I ran into a problem. I have a bitboard that has all of the side to moves' places that they can move to plus bitboards for the captures they can make and the squares they attack. Now, in the search function, I have no clue as to how the computer knows which piece goes to the square they can move to. If someone could give me an example or exlpian it really well, I would be much happier. Thanks, Zach
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.