/**
 * Minimal, fast negamax alpha-beta search.
 *
 * Goals:
 * - Browser-friendly: bounded work, no expensive root guardrails.
 * - Deterministic.
 * - Uses TT + basic move ordering for practical strength.
 */
import { InternalBoard } from '../types';
import { SearchResult } from '../types/ai.types';
export declare class Search {
    private nodesSearched;
    private qMaxDepth;
    private checkExtension;
    private transpositionTable;
    private killerMoves;
    constructor(ttSizeMB?: number);
    clear(): void;
    findBestMove(board: InternalBoard, baseDepth: number, qMaxDepth?: number, checkExtension?: boolean, options?: {
        analysis?: boolean;
        randomness?: number;
    }): SearchResult | null;
    private negamax;
    private quiescence;
    /**
     * Check if a move was illegal (left own king in check) after applyMoveComplete.
     * After applyMoveComplete, board.turn has switched, so the "previous" side
     * is the opponent of board.turn.
     */
    private isIllegalMove;
}
//# sourceMappingURL=Search.d.ts.map