En Passants Advanced Java Chess Engine Tutorial 7

Summary

Outlining how to find possible moves for a given board. Generate move possibility bitboards for Sliding Pieces (Bishops, Rooks, and Queens) in Rotating bitboards and tying everything together. The Write a simple brute force perft search algorithm with variable depth. This algorithm is used to debug search Generate all Knight moves using bitboards quickly and efficiently in Learn how to code the Principal Variation Search as simply and efficiently as possible. This is the main search algorithm used by ... Move the pieces on the board according to the possible moves list. As well, discover how to unmake those moves. Castling is a very useful move, but knowing when castling is and is not allowed is more challenging, yet the code is simple. Here is a quick, real example of how to use perft to find a bug right down to the very line of code where the bug is. It is really easy ... Evaluating attacks based on piece-value. Allows for a more aggressive game-play.