I used Claude to help me figure this out. First time using AI for coding. It was actually rather helpful! Calculate BitBoards representing the various kinds of pawn moves when the move generator is created, and then iterate through them. En passant still isn't implemented here. This code has not been tested yet either.
12 lines
192 B
Rust
12 lines
192 B
Rust
// Eryn Wells <eryn@erynwells.me>
|
|
|
|
mod pawn;
|
|
|
|
pub use pawn::PawnMoveGenerator;
|
|
|
|
use crate::Move;
|
|
|
|
#[derive(Clone, Debug, Eq, PartialEq)]
|
|
pub struct GeneratedMove {
|
|
pub(crate) ply: Move,
|
|
}
|