If you want to avoid scanning for bits, use piece lists (updating their locations as the pieces move around).

Can you explain piece list algo a little bit ? I am not getting any idea about this .

I have got the concept of knight moves in bitboard. I need an array knight[64] in which all possible knight moves will be stored.
But how can I get the position of my knights in bitboard without looping through the bits of knight ??

i.e. How can I know , where my knights are placed in chessboard ...

Nice approach..At this time, I dont want any optimizations. First I want to complete my initial work.Then, I'll go for optimizations.

Thanks a lot for this approach.Made my way...and many thanks to your implementation

Hi,all.
I am a newbie..II've gone through http://chessprogramming.wikispaces.com and http://www.cis.uab.edu/hyatt/pubs.html and many other programming tutorials. They all cover most of the theoretical part but none of them have good pictorial examples. I am perhaps not a good learner or programmer ...