Hi!

I realized that the InCheck function of my chess programm is a bottleneck.
While the tablebased movegeneration seems fast enough, and also MakeMove is
acceptable, InCheck is really slow. Currently I do MakeMove and check the
legality by InCheck. Looking one ply deeper and getting the information
about illegal positions by generating all moves and recognizing a king
capture didn't really show a better performance.
So I ask: Could this be an issue for bitboards?
I have neither thought about nor really looked at bitboards that much, they
just seems difficult to handle.
(And what about move generation when transforming the bitboard informations
into a move list)?

Thanks
-delphi-