// Best move score
const BEST_MOVE_SCORE = 30_000;

pub fn moves(search: *const Search, ml: *MoveList) void {

pub fn moves(search: *const Search, ml: *MoveList, best: BitMove) void {

        mp.score = scoreMove(search, mp.move);

        mp.score = scoreMove(search, mp.move, best);

fn scoreMove(search: *const Search, move: BitMove) isize {

fn scoreMove(search: *const Search, move: BitMove, best: BitMove) isize {
    if (@bitCast(BitMoveType, move) == @bitCast(BitMoveType, best)) {
        return BEST_MOVE_SCORE;
    }

    best: BitMove,

                .best = @bitCast(BitMove, @as(BitMoveType, 0)),

        var best_move: BitMove = @bitCast(BitMove, @as(BitMoveType, 0));

                best_move = entry.best;

        nodes += 1;

        nodes += 1;

        score.moves(self, &ml);

        score.moves(self, &ml, best_move);

                best_move = mp.move;

                        .best = best_move,

            .best = best_move,

        var alpha = alpha_orig;

        var alpha = alpha_orig;

        score.moves(self, &ml);

        score.moves(self, &ml, @bitCast(BitMove, @as(BitMoveType, 0)));