js-chess-engine 1.0.2 → 2.0.0

package/dist/ai/Search.js

@@ -0,0 +1,340 @@
+"use strict";
+/**
+ * Alpha-beta search implementation for js-chess-engine v2
+ *
+ * Implements minimax with alpha-beta pruning and extensions for checks and captures.
+ * Phase 5: Enhanced with transposition table, move ordering, and iterative deepening.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Search = void 0;
+const types_1 = require("../types");
+const MoveGenerator_1 = require("../core/MoveGenerator");
+const AttackDetector_1 = require("../core/AttackDetector");
+const Evaluator_1 = require("./Evaluator");
+const TranspositionTable_1 = require("./TranspositionTable");
+const MoveOrdering_1 = require("./MoveOrdering");
+/**
+ * Search engine with alpha-beta pruning, transposition table, and move ordering
+ */
+class Search {
+    nodesSearched = 0;
+    transpositionTable;
+    killerMoves;
+    useOptimizations = true;
+    constructor(ttSizeMB = 16) {
+        // Only create TT if size > 0
+        this.transpositionTable = ttSizeMB > 0 ? new TranspositionTable_1.TranspositionTable(ttSizeMB) : null;
+        this.killerMoves = new MoveOrdering_1.KillerMoves();
+    }
+    /**
+     * Enable or disable optimizations (for testing)
+     */
+    setOptimizations(enabled) {
+        this.useOptimizations = enabled;
+    }
+    /**
+     * Clear search data structures
+     */
+    clear() {
+        if (this.transpositionTable) {
+            this.transpositionTable.clear();
+        }
+        this.killerMoves.clear();
+    }
+    /**
+     * Find the best move using alpha-beta search with iterative deepening
+     *
+     * @param board - Current board position
+     * @param baseDepth - Base search depth
+     * @param extendedDepth - Extended search depth (for checks and captures)
+     * @returns Best move with score
+     */
+    findBestMove(board, baseDepth, extendedDepth) {
+        this.nodesSearched = 0;
+        if (this.transpositionTable) {
+            this.transpositionTable.newSearch();
+        }
+        const playerColor = board.turn;
+        // Generate all legal moves
+        const moves = (0, MoveGenerator_1.generateLegalMoves)(board);
+        if (moves.length === 0) {
+            return null; // No legal moves
+        }
+        // Add small random factor to avoid repeating same moves
+        // Based on halfmove clock (more randomness in opening)
+        const randomFactor = board.halfMoveClock > 10
+            ? board.halfMoveClock - 10
+            : 1;
+        let bestMove = moves[0];
+        let bestScore = Evaluator_1.SCORE_MIN;
+        // Iterative deepening: search progressively deeper
+        // This improves move ordering for deeper searches
+        if (this.useOptimizations && baseDepth > 2) {
+            for (let depth = 1; depth < baseDepth; depth++) {
+                this.searchDepth(board, playerColor, depth, Math.min(depth + 1, extendedDepth), moves);
+            }
+        }
+        // Get PV move from transposition table for move ordering (if available)
+        const pvMove = this.useOptimizations && this.transpositionTable
+            ? this.transpositionTable.getBestMove(board.zobristHash)
+            : null;
+        // Order moves for better alpha-beta pruning
+        const orderedMoves = this.useOptimizations
+            ? (0, MoveOrdering_1.orderMoves)(moves, pvMove, this.killerMoves, 0)
+            : moves;
+        // Search each root move
+        for (const move of orderedMoves) {
+            // Make move (generateLegalMoves already filtered for legality)
+            const testBoard = this.copyBoard(board);
+            (0, MoveGenerator_1.applyMoveComplete)(testBoard, move);
+            // Determine if this move captured a piece
+            const wasCapture = move.capturedPiece !== 0;
+            // Calculate initial score (for capture optimization)
+            const initialScore = wasCapture
+                ? Evaluator_1.Evaluator.evaluate(testBoard, playerColor)
+                : null;
+            // Check if this move delivers checkmate (highest priority)
+            if (testBoard.isCheckmate && testBoard.turn !== playerColor) {
+                // Opponent is in checkmate - immediately return this move
+                return {
+                    move,
+                    score: Evaluator_1.SCORE_MAX,
+                    depth: baseDepth,
+                    nodesSearched: this.nodesSearched,
+                };
+            }
+            // For promotion moves, always prefer queen promotion
+            // (Other promotions are rarely optimal except in special tactical situations)
+            if ((move.flags & types_1.MoveFlag.PROMOTION) && move.promotionPiece) {
+                const isQueenPromotion = move.promotionPiece === types_1.Piece.WHITE_QUEEN ||
+                    move.promotionPiece === types_1.Piece.BLACK_QUEEN;
+                if (!isQueenPromotion) {
+                    // Skip non-queen promotions (they're almost never best)
+                    continue;
+                }
+            }
+            // Search this move
+            const score = -this.alphaBeta(testBoard, playerColor, baseDepth, extendedDepth, 1, // depth = 1
+            wasCapture, initialScore, Evaluator_1.SCORE_MIN, Evaluator_1.SCORE_MAX);
+            // For non-checkmate moves, add positional bonus and randomness
+            let finalScore = score;
+            // Only add randomness for non-decisive moves (not near mate scores)
+            if (Math.abs(score) < Evaluator_1.SCORE_MAX - 100) {
+                // Add positional bonus
+                const positionalBonus = Evaluator_1.Evaluator.evaluate(testBoard, playerColor) -
+                    Evaluator_1.Evaluator.evaluate(board, playerColor);
+                // Add small random factor (v1 compatibility)
+                const random = Math.floor(Math.random() * randomFactor * 10) / 10;
+                finalScore = score + positionalBonus + random;
+            }
+            // Update best move
+            if (finalScore > bestScore) {
+                bestScore = finalScore;
+                bestMove = move;
+            }
+        }
+        // Store in transposition table (if available)
+        if (this.useOptimizations && this.transpositionTable) {
+            this.transpositionTable.store(board.zobristHash, baseDepth, bestScore, TranspositionTable_1.TTEntryType.EXACT, bestMove);
+        }
+        return {
+            move: bestMove,
+            score: bestScore,
+            depth: baseDepth,
+            nodesSearched: this.nodesSearched,
+        };
+    }
+    /**
+     * Search at a specific depth (used for iterative deepening)
+     */
+    searchDepth(board, playerColor, baseDepth, extendedDepth, moves) {
+        const pvMove = this.transpositionTable
+            ? this.transpositionTable.getBestMove(board.zobristHash)
+            : null;
+        const orderedMoves = (0, MoveOrdering_1.orderMoves)(moves, pvMove, this.killerMoves, 0);
+        let bestMove = orderedMoves[0];
+        let bestScore = Evaluator_1.SCORE_MIN;
+        for (const move of orderedMoves) {
+            const testBoard = this.copyBoard(board);
+            (0, MoveGenerator_1.applyMoveComplete)(testBoard, move);
+            const wasCapture = move.capturedPiece !== 0;
+            const initialScore = wasCapture
+                ? Evaluator_1.Evaluator.evaluate(testBoard, playerColor)
+                : null;
+            const score = -this.alphaBeta(testBoard, playerColor, baseDepth, extendedDepth, 1, wasCapture, initialScore, Evaluator_1.SCORE_MIN, Evaluator_1.SCORE_MAX);
+            if (score > bestScore) {
+                bestScore = score;
+                bestMove = move;
+            }
+        }
+        // Store result in transposition table (if available)
+        if (this.transpositionTable) {
+            this.transpositionTable.store(board.zobristHash, baseDepth, bestScore, TranspositionTable_1.TTEntryType.EXACT, bestMove);
+        }
+    }
+    /**
+     * Alpha-beta search with extensions, transposition table, and move ordering
+     *
+     * @param board - Current position
+     * @param rootPlayerColor - Player color at root (for evaluation perspective)
+     * @param baseDepth - Base search depth
+     * @param extendedDepth - Extended search depth
+     * @param depth - Current depth
+     * @param wasCapture - Whether last move was a capture
+     * @param initialScore - Initial score (optimization)
+     * @param alpha - Alpha bound
+     * @param beta - Beta bound
+     * @returns Score from current player's perspective
+     */
+    alphaBeta(board, rootPlayerColor, baseDepth, extendedDepth, depth, wasCapture, initialScore, alpha, beta) {
+        this.nodesSearched++;
+        // Check if game is over
+        if (board.isCheckmate || board.isStalemate) {
+            return Evaluator_1.Evaluator.evaluate(board, rootPlayerColor, depth);
+        }
+        // Probe transposition table (if available)
+        if (this.useOptimizations && this.transpositionTable) {
+            const ttEntry = this.transpositionTable.probe(board.zobristHash, baseDepth - depth + 1, alpha, beta);
+            if (ttEntry && ttEntry.depth >= baseDepth - depth + 1) {
+                // We can use this score
+                if (ttEntry.type === TranspositionTable_1.TTEntryType.EXACT) {
+                    return ttEntry.score;
+                }
+                if (ttEntry.type === TranspositionTable_1.TTEntryType.LOWER_BOUND && ttEntry.score >= beta) {
+                    return ttEntry.score;
+                }
+                if (ttEntry.type === TranspositionTable_1.TTEntryType.UPPER_BOUND && ttEntry.score <= alpha) {
+                    return ttEntry.score;
+                }
+            }
+        }
+        // Determine if we should continue searching
+        let shouldSearch = false;
+        const inCheck = (0, AttackDetector_1.isKingInCheck)(board);
+        // Extend search if in check (always search deeper)
+        if (depth < extendedDepth && inCheck) {
+            shouldSearch = true;
+        }
+        // Continue base search or extend on captures
+        else if (depth < baseDepth || (wasCapture && depth < extendedDepth)) {
+            shouldSearch = true;
+        }
+        // Leaf node - evaluate position
+        if (!shouldSearch) {
+            if (initialScore !== null) {
+                return initialScore;
+            }
+            return Evaluator_1.Evaluator.evaluate(board, rootPlayerColor);
+        }
+        // Generate legal moves
+        const moves = (0, MoveGenerator_1.generateLegalMoves)(board);
+        // Get PV move from transposition table for move ordering (if available)
+        const pvMove = this.useOptimizations && this.transpositionTable
+            ? this.transpositionTable.getBestMove(board.zobristHash)
+            : null;
+        // Order moves for better pruning
+        const orderedMoves = this.useOptimizations
+            ? (0, MoveOrdering_1.orderMoves)(moves, pvMove, this.killerMoves, depth)
+            : moves;
+        // Determine if we're maximizing or minimizing
+        const isMaximizing = board.turn === rootPlayerColor;
+        let bestScore = isMaximizing ? Evaluator_1.SCORE_MIN : Evaluator_1.SCORE_MAX;
+        let bestMove = null;
+        let maxValueReached = false;
+        // Search all moves
+        for (const move of orderedMoves) {
+            if (maxValueReached)
+                break;
+            // Make move (generateLegalMoves already filtered for legality)
+            const testBoard = this.copyBoard(board);
+            (0, MoveGenerator_1.applyMoveComplete)(testBoard, move);
+            // Check if this move captured a piece
+            const moveWasCapture = move.capturedPiece !== 0;
+            // Calculate score if capture
+            const moveInitialScore = moveWasCapture
+                ? Evaluator_1.Evaluator.evaluate(testBoard, rootPlayerColor)
+                : null;
+            // Recursive search
+            const score = this.alphaBeta(testBoard, rootPlayerColor, baseDepth, extendedDepth, depth + 1, moveWasCapture, moveInitialScore, alpha, beta);
+            // Check for exact mate found
+            if (Math.abs(score) >= Evaluator_1.SCORE_MAX - 100) {
+                maxValueReached = true;
+            }
+            // Update best score and bounds
+            if (isMaximizing) {
+                if (score > bestScore) {
+                    bestScore = score;
+                    bestMove = move;
+                }
+                alpha = Math.max(alpha, score);
+            }
+            else {
+                if (score < bestScore) {
+                    bestScore = score;
+                    bestMove = move;
+                }
+                beta = Math.min(beta, score);
+            }
+            // Alpha-beta cutoff
+            if (beta <= alpha) {
+                // Store killer move (non-captures that caused cutoff)
+                if (this.useOptimizations && !(move.flags & types_1.MoveFlag.CAPTURE)) {
+                    this.killerMoves.store(move, depth);
+                }
+                break; // Prune
+            }
+        }
+        // Store in transposition table (if available)
+        if (this.useOptimizations && this.transpositionTable && bestMove) {
+            let entryType;
+            if (bestScore <= alpha) {
+                entryType = TranspositionTable_1.TTEntryType.UPPER_BOUND;
+            }
+            else if (bestScore >= beta) {
+                entryType = TranspositionTable_1.TTEntryType.LOWER_BOUND;
+            }
+            else {
+                entryType = TranspositionTable_1.TTEntryType.EXACT;
+            }
+            this.transpositionTable.store(board.zobristHash, baseDepth - depth + 1, bestScore, entryType, bestMove);
+        }
+        return bestScore;
+    }
+    /**
+     * Copy board for search (fast struct copy)
+     *
+     * @param board - Board to copy
+     * @returns New board instance
+     */
+    copyBoard(board) {
+        return {
+            mailbox: new Int8Array(board.mailbox),
+            whitePieces: board.whitePieces,
+            blackPieces: board.blackPieces,
+            allPieces: board.allPieces,
+            whitePawns: board.whitePawns,
+            whiteKnights: board.whiteKnights,
+            whiteBishops: board.whiteBishops,
+            whiteRooks: board.whiteRooks,
+            whiteQueens: board.whiteQueens,
+            whiteKing: board.whiteKing,
+            blackPawns: board.blackPawns,
+            blackKnights: board.blackKnights,
+            blackBishops: board.blackBishops,
+            blackRooks: board.blackRooks,
+            blackQueens: board.blackQueens,
+            blackKing: board.blackKing,
+            turn: board.turn,
+            castlingRights: { ...board.castlingRights },
+            enPassantSquare: board.enPassantSquare,
+            halfMoveClock: board.halfMoveClock,
+            fullMoveNumber: board.fullMoveNumber,
+            zobristHash: board.zobristHash,
+            isCheck: board.isCheck,
+            isCheckmate: board.isCheckmate,
+            isStalemate: board.isStalemate,
+        };
+    }
+}
+exports.Search = Search;
+//# sourceMappingURL=Search.js.map

package/dist/ai/Search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Search.js","sourceRoot":"","sources":["../../src/ai/Search.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,oCAAuF;AACvF,yDAA8E;AAC9E,2DAAuD;AACvD,2CAA8D;AAE9D,6DAAuE;AACvE,iDAAyD;AAEzD;;GAEG;AACH,MAAa,MAAM;IACP,aAAa,GAAW,CAAC,CAAC;IAC1B,kBAAkB,CAA4B;IAC9C,WAAW,CAAc;IACzB,gBAAgB,GAAY,IAAI,CAAC;IAEzC,YAAY,WAAmB,EAAE;QAC7B,6BAA6B;QAC7B,IAAI,CAAC,kBAAkB,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,uCAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAW,CAAC;QACxF,IAAI,CAAC,WAAW,GAAG,IAAI,0BAAW,EAAE,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,OAAgB;QAC7B,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1B,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACR,KAAoB,EACpB,SAAiB,EACjB,aAAqB;QAErB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1B,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,CAAC;QACxC,CAAC;QACD,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC;QAE/B,2BAA2B;QAC3B,MAAM,KAAK,GAAG,IAAA,kCAAkB,EAAC,KAAK,CAAC,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,CAAC,iBAAiB;QAClC,CAAC;QAED,wDAAwD;QACxD,uDAAuD;QACvD,MAAM,YAAY,GAAG,KAAK,CAAC,aAAa,GAAG,EAAE;YACzC,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,EAAE;YAC1B,CAAC,CAAC,CAAC,CAAC;QAER,IAAI,QAAQ,GAAiB,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,SAAS,GAAG,qBAAS,CAAC;QAE1B,mDAAmD;QACnD,kDAAkD;QAClD,IAAI,IAAI,CAAC,gBAAgB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YACzC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC7C,IAAI,CAAC,WAAW,CACZ,KAAK,EACL,WAAW,EACX,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,aAAa,CAAC,EAClC,KAAK,CACR,CAAC;YACN,CAAC;QACL,CAAC;QAED,wEAAwE;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB;YAC3D,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC;YACxD,CAAC,CAAC,IAAI,CAAC;QAEX,4CAA4C;QAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB;YACtC,CAAC,CAAC,IAAA,yBAAU,EAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YAChD,CAAC,CAAC,KAAK,CAAC;QAEZ,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAC9B,+DAA+D;YAC/D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxC,IAAA,iCAAiB,EAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAEnC,0CAA0C;YAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC;YAE5C,qDAAqD;YACrD,MAAM,YAAY,GAAG,UAAU;gBAC3B,CAAC,CAAC,qBAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC;gBAC5C,CAAC,CAAC,IAAI,CAAC;YAEX,2DAA2D;YAC3D,IAAI,SAAS,CAAC,WAAW,IAAI,SAAS,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC1D,0DAA0D;gBAC1D,OAAO;oBACH,IAAI;oBACJ,KAAK,EAAE,qBAAS;oBAChB,KAAK,EAAE,SAAS;oBAChB,aAAa,EAAE,IAAI,CAAC,aAAa;iBACpC,CAAC;YACN,CAAC;YAED,qDAAqD;YACrD,8EAA8E;YAC9E,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,gBAAQ,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;gBAC3D,MAAM,gBAAgB,GAClB,IAAI,CAAC,cAAc,KAAK,aAAK,CAAC,WAAW;oBACzC,IAAI,CAAC,cAAc,KAAK,aAAK,CAAC,WAAW,CAAC;gBAE9C,IAAI,CAAC,gBAAgB,EAAE,CAAC;oBACpB,wDAAwD;oBACxD,SAAS;gBACb,CAAC;YACL,CAAC;YAED,mBAAmB;YACnB,MAAM,KAAK,GACP,CAAC,IAAI,CAAC,SAAS,CACX,SAAS,EACT,WAAW,EACX,SAAS,EACT,aAAa,EACb,CAAC,EAAE,YAAY;YACf,UAAU,EACV,YAAY,EACZ,qBAAS,EACT,qBAAS,CACZ,CAAC;YAEN,+DAA+D;YAC/D,IAAI,UAAU,GAAG,KAAK,CAAC;YAEvB,oEAAoE;YACpE,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,qBAAS,GAAG,GAAG,EAAE,CAAC;gBACpC,uBAAuB;gBACvB,MAAM,eAAe,GAAG,qBAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC;oBAC9D,qBAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;gBAE3C,6CAA6C;gBAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;gBAElE,UAAU,GAAG,KAAK,GAAG,eAAe,GAAG,MAAM,CAAC;YAClD,CAAC;YAED,mBAAmB;YACnB,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;gBACzB,SAAS,GAAG,UAAU,CAAC;gBACvB,QAAQ,GAAG,IAAI,CAAC;YACpB,CAAC;QACL,CAAC;QAED,8CAA8C;QAC9C,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACnD,IAAI,CAAC,kBAAkB,CAAC,KAAK,CACzB,KAAK,CAAC,WAAW,EACjB,SAAS,EACT,SAAS,EACT,gCAAW,CAAC,KAAK,EACjB,QAAQ,CACX,CAAC;QACN,CAAC;QAED,OAAO;YACH,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,SAAS;YAChB,KAAK,EAAE,SAAS;YAChB,aAAa,EAAE,IAAI,CAAC,aAAa;SACpC,CAAC;IACN,CAAC;IAED;;OAEG;IACK,WAAW,CACf,KAAoB,EACpB,WAA0B,EAC1B,SAAiB,EACjB,aAAqB,EACrB,KAAqB;QAErB,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB;YAClC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC;YACxD,CAAC,CAAC,IAAI,CAAC;QACX,MAAM,YAAY,GAAG,IAAA,yBAAU,EAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAEpE,IAAI,QAAQ,GAAiB,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,SAAS,GAAG,qBAAS,CAAC;QAE1B,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxC,IAAA,iCAAiB,EAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAEnC,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC;YAC5C,MAAM,YAAY,GAAG,UAAU;gBAC3B,CAAC,CAAC,qBAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC;gBAC5C,CAAC,CAAC,IAAI,CAAC;YAEX,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,SAAS,CACzB,SAAS,EACT,WAAW,EACX,SAAS,EACT,aAAa,EACb,CAAC,EACD,UAAU,EACV,YAAY,EACZ,qBAAS,EACT,qBAAS,CACZ,CAAC;YAEF,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACpB,SAAS,GAAG,KAAK,CAAC;gBAClB,QAAQ,GAAG,IAAI,CAAC;YACpB,CAAC;QACL,CAAC;QAED,qDAAqD;QACrD,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1B,IAAI,CAAC,kBAAkB,CAAC,KAAK,CACzB,KAAK,CAAC,WAAW,EACjB,SAAS,EACT,SAAS,EACT,gCAAW,CAAC,KAAK,EACjB,QAAQ,CACX,CAAC;QACN,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,SAAS,CACb,KAAoB,EACpB,eAA8B,EAC9B,SAAiB,EACjB,aAAqB,EACrB,KAAa,EACb,UAAmB,EACnB,YAA0B,EAC1B,KAAY,EACZ,IAAW;QAEX,IAAI,CAAC,aAAa,EAAE,CAAC;QAErB,wBAAwB;QACxB,IAAI,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACzC,OAAO,qBAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CACzC,KAAK,CAAC,WAAW,EACjB,SAAS,GAAG,KAAK,GAAG,CAAC,EACrB,KAAK,EACL,IAAI,CACP,CAAC;YAEF,IAAI,OAAO,IAAI,OAAO,CAAC,KAAK,IAAI,SAAS,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;gBACpD,wBAAwB;gBACxB,IAAI,OAAO,CAAC,IAAI,KAAK,gCAAW,CAAC,KAAK,EAAE,CAAC;oBACrC,OAAO,OAAO,CAAC,KAAK,CAAC;gBACzB,CAAC;gBACD,IAAI,OAAO,CAAC,IAAI,KAAK,gCAAW,CAAC,WAAW,IAAI,OAAO,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;oBACpE,OAAO,OAAO,CAAC,KAAK,CAAC;gBACzB,CAAC;gBACD,IAAI,OAAO,CAAC,IAAI,KAAK,gCAAW,CAAC,WAAW,IAAI,OAAO,CAAC,KAAK,IAAI,KAAK,EAAE,CAAC;oBACrE,OAAO,OAAO,CAAC,KAAK,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QAED,4CAA4C;QAC5C,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,MAAM,OAAO,GAAG,IAAA,8BAAa,EAAC,KAAK,CAAC,CAAC;QAErC,mDAAmD;QACnD,IAAI,KAAK,GAAG,aAAa,IAAI,OAAO,EAAE,CAAC;YACnC,YAAY,GAAG,IAAI,CAAC;QACxB,CAAC;QACD,6CAA6C;aACxC,IAAI,KAAK,GAAG,SAAS,IAAI,CAAC,UAAU,IAAI,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC;YAClE,YAAY,GAAG,IAAI,CAAC;QACxB,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,YAAY,EAAE,CAAC;YAChB,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;gBACxB,OAAO,YAAY,CAAC;YACxB,CAAC;YACD,OAAO,qBAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;QACtD,CAAC;QAED,uBAAuB;QACvB,MAAM,KAAK,GAAG,IAAA,kCAAkB,EAAC,KAAK,CAAC,CAAC;QAExC,wEAAwE;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB;YAC3D,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC;YACxD,CAAC,CAAC,IAAI,CAAC;QAEX,iCAAiC;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB;YACtC,CAAC,CAAC,IAAA,yBAAU,EAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC;YACpD,CAAC,CAAC,KAAK,CAAC;QAEZ,8CAA8C;QAC9C,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,KAAK,eAAe,CAAC;QACpD,IAAI,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,qBAAS,CAAC,CAAC,CAAC,qBAAS,CAAC;QACrD,IAAI,QAAQ,GAAwB,IAAI,CAAC;QACzC,IAAI,eAAe,GAAG,KAAK,CAAC;QAE5B,mBAAmB;QACnB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAC9B,IAAI,eAAe;gBAAE,MAAM;YAE3B,+DAA+D;YAC/D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxC,IAAA,iCAAiB,EAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAEnC,sCAAsC;YACtC,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC;YAEhD,6BAA6B;YAC7B,MAAM,gBAAgB,GAAG,cAAc;gBACnC,CAAC,CAAC,qBAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,eAAe,CAAC;gBAChD,CAAC,CAAC,IAAI,CAAC;YAEX,mBAAmB;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CACxB,SAAS,EACT,eAAe,EACf,SAAS,EACT,aAAa,EACb,KAAK,GAAG,CAAC,EACT,cAAc,EACd,gBAAgB,EAChB,KAAK,EACL,IAAI,CACP,CAAC;YAEF,6BAA6B;YAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,qBAAS,GAAG,GAAG,EAAE,CAAC;gBACrC,eAAe,GAAG,IAAI,CAAC;YAC3B,CAAC;YAED,+BAA+B;YAC/B,IAAI,YAAY,EAAE,CAAC;gBACf,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;oBACpB,SAAS,GAAG,KAAK,CAAC;oBAClB,QAAQ,GAAG,IAAI,CAAC;gBACpB,CAAC;gBACD,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACJ,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;oBACpB,SAAS,GAAG,KAAK,CAAC;oBAClB,QAAQ,GAAG,IAAI,CAAC;gBACpB,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;YAED,oBAAoB;YACpB,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBAChB,sDAAsD;gBACtD,IAAI,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,gBAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC5D,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACxC,CAAC;gBACD,MAAM,CAAC,QAAQ;YACnB,CAAC;QACL,CAAC;QAED,8CAA8C;QAC9C,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,kBAAkB,IAAI,QAAQ,EAAE,CAAC;YAC/D,IAAI,SAAsB,CAAC;YAC3B,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;gBACrB,SAAS,GAAG,gCAAW,CAAC,WAAW,CAAC;YACxC,CAAC;iBAAM,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;gBAC3B,SAAS,GAAG,gCAAW,CAAC,WAAW,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACJ,SAAS,GAAG,gCAAW,CAAC,KAAK,CAAC;YAClC,CAAC;YAED,IAAI,CAAC,kBAAkB,CAAC,KAAK,CACzB,KAAK,CAAC,WAAW,EACjB,SAAS,GAAG,KAAK,GAAG,CAAC,EACrB,SAAS,EACT,SAAS,EACT,QAAQ,CACX,CAAC;QACN,CAAC;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACK,SAAS,CAAC,KAAoB;QAClC,OAAO;YACH,OAAO,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC;YACrC,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,cAAc,EAAE,EAAE,GAAG,KAAK,CAAC,cAAc,EAAE;YAC3C,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,WAAW,EAAE,KAAK,CAAC,WAAW;SACjC,CAAC;IACN,CAAC;CACJ;AAlcD,wBAkcC"}

package/dist/ai/TranspositionTable.d.ts

@@ -0,0 +1,100 @@
+/**
+ * Transposition Table for js-chess-engine v2
+ *
+ * Stores previously evaluated positions to avoid re-computation.
+ * Uses Zobrist hashing for position identification.
+ */
+import { InternalMove } from '../types';
+import { Score } from '../types/ai.types';
+/**
+ * Types of transposition table entries
+ */
+export declare enum TTEntryType {
+    EXACT = 0,// Exact score
+    LOWER_BOUND = 1,// Alpha cutoff (fail-high)
+    UPPER_BOUND = 2
+}
+/**
+ * Transposition table entry
+ */
+export interface TTEntry {
+    zobristHash: bigint;
+    depth: number;
+    score: Score;
+    type: TTEntryType;
+    bestMove: InternalMove | null;
+    age: number;
+}
+/**
+ * Transposition Table
+ *
+ * Implements a hash table with replacement strategy for storing
+ * previously evaluated positions.
+ */
+export declare class TranspositionTable {
+    private table;
+    private size;
+    private currentAge;
+    private hits;
+    private misses;
+    /**
+     * Create a new transposition table
+     *
+     * @param sizeMB - Size in megabytes (default: 16MB)
+     */
+    constructor(sizeMB?: number);
+    /**
+     * Store a position in the transposition table
+     *
+     * @param zobristHash - Position hash
+     * @param depth - Search depth
+     * @param score - Position score
+     * @param type - Entry type
+     * @param bestMove - Best move found
+     */
+    store(zobristHash: bigint, depth: number, score: Score, type: TTEntryType, bestMove: InternalMove | null): void;
+    /**
+     * Probe the transposition table
+     *
+     * @param zobristHash - Position hash
+     * @param depth - Current search depth
+     * @param alpha - Alpha bound
+     * @param beta - Beta bound
+     * @returns Entry if found and usable, null otherwise
+     */
+    probe(zobristHash: bigint, depth: number, alpha: Score, beta: Score): TTEntry | null;
+    /**
+     * Get best move from transposition table (for move ordering)
+     *
+     * @param zobristHash - Position hash
+     * @returns Best move if found, null otherwise
+     */
+    getBestMove(zobristHash: bigint): InternalMove | null;
+    /**
+     * Clear the transposition table
+     */
+    clear(): void;
+    /**
+     * Increment search age (call at start of new search)
+     */
+    newSearch(): void;
+    /**
+     * Get index for a hash value
+     *
+     * @param hash - Zobrist hash
+     * @returns Table index
+     */
+    private getIndex;
+    /**
+     * Get cache statistics
+     *
+     * @returns Statistics object
+     */
+    getStats(): {
+        hits: number;
+        misses: number;
+        hitRate: number;
+        size: number;
+    };
+}
+//# sourceMappingURL=TranspositionTable.d.ts.map

package/dist/ai/TranspositionTable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TranspositionTable.d.ts","sourceRoot":"","sources":["../../src/ai/TranspositionTable.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAE1C;;GAEG;AACH,oBAAY,WAAW;IACnB,KAAK,IAAI,CAAO,cAAc;IAC9B,WAAW,IAAI,CAAE,2BAA2B;IAC5C,WAAW,IAAI;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,KAAK,CAAC;IACb,IAAI,EAAE,WAAW,CAAC;IAClB,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;IAC9B,GAAG,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,qBAAa,kBAAkB;IAC3B,OAAO,CAAC,KAAK,CAAqB;IAClC,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,MAAM,CAAa;IAE3B;;;;OAIG;gBACS,MAAM,GAAE,MAAW;IAW/B;;;;;;;;OAQG;IACH,KAAK,CACD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,WAAW,EACjB,QAAQ,EAAE,YAAY,GAAG,IAAI,GAC9B,IAAI;IA2BP;;;;;;;;OAQG;IACH,KAAK,CACD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,KAAK,GACZ,OAAO,GAAG,IAAI;IA0CjB;;;;;OAKG;IACH,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAWrD;;OAEG;IACH,KAAK,IAAI,IAAI;IAOb;;OAEG;IACH,SAAS,IAAI,IAAI;IAIjB;;;;;OAKG;IACH,OAAO,CAAC,QAAQ;IAKhB;;;;OAIG;IACH,QAAQ,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE;CAW9E"}

package/dist/ai/TranspositionTable.js

@@ -0,0 +1,176 @@
+"use strict";
+/**
+ * Transposition Table for js-chess-engine v2
+ *
+ * Stores previously evaluated positions to avoid re-computation.
+ * Uses Zobrist hashing for position identification.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TranspositionTable = exports.TTEntryType = void 0;
+/**
+ * Types of transposition table entries
+ */
+var TTEntryType;
+(function (TTEntryType) {
+    TTEntryType[TTEntryType["EXACT"] = 0] = "EXACT";
+    TTEntryType[TTEntryType["LOWER_BOUND"] = 1] = "LOWER_BOUND";
+    TTEntryType[TTEntryType["UPPER_BOUND"] = 2] = "UPPER_BOUND";
+})(TTEntryType || (exports.TTEntryType = TTEntryType = {}));
+/**
+ * Transposition Table
+ *
+ * Implements a hash table with replacement strategy for storing
+ * previously evaluated positions.
+ */
+class TranspositionTable {
+    table;
+    size;
+    currentAge = 0;
+    hits = 0;
+    misses = 0;
+    /**
+     * Create a new transposition table
+     *
+     * @param sizeMB - Size in megabytes (default: 16MB)
+     */
+    constructor(sizeMB = 16) {
+        // Each entry is approximately 40 bytes
+        const entrySize = 40;
+        const bytesPerMB = 1024 * 1024;
+        const totalBytes = sizeMB * bytesPerMB;
+        // Use power of 2 for efficient modulo with bitwise AND
+        this.size = Math.pow(2, Math.floor(Math.log2(totalBytes / entrySize)));
+        this.table = new Array(this.size).fill(null);
+    }
+    /**
+     * Store a position in the transposition table
+     *
+     * @param zobristHash - Position hash
+     * @param depth - Search depth
+     * @param score - Position score
+     * @param type - Entry type
+     * @param bestMove - Best move found
+     */
+    store(zobristHash, depth, score, type, bestMove) {
+        const index = this.getIndex(zobristHash);
+        const existingEntry = this.table[index];
+        // Replacement strategy: always replace if:
+        // 1. Slot is empty
+        // 2. Same position (hash match)
+        // 3. New entry has greater depth
+        // 4. Entry is from previous search (old age)
+        const shouldReplace = !existingEntry ||
+            existingEntry.zobristHash === zobristHash ||
+            depth >= existingEntry.depth ||
+            existingEntry.age < this.currentAge;
+        if (shouldReplace) {
+            this.table[index] = {
+                zobristHash,
+                depth,
+                score,
+                type,
+                bestMove,
+                age: this.currentAge,
+            };
+        }
+    }
+    /**
+     * Probe the transposition table
+     *
+     * @param zobristHash - Position hash
+     * @param depth - Current search depth
+     * @param alpha - Alpha bound
+     * @param beta - Beta bound
+     * @returns Entry if found and usable, null otherwise
+     */
+    probe(zobristHash, depth, alpha, beta) {
+        const index = this.getIndex(zobristHash);
+        const entry = this.table[index];
+        // Check if entry exists and matches hash
+        if (!entry || entry.zobristHash !== zobristHash) {
+            this.misses++;
+            return null;
+        }
+        // Entry must be from sufficient depth to be usable
+        if (entry.depth < depth) {
+            this.misses++;
+            return null;
+        }
+        this.hits++;
+        // Check if we can use this score
+        switch (entry.type) {
+            case TTEntryType.EXACT:
+                return entry;
+            case TTEntryType.LOWER_BOUND:
+                // Fail-high (score >= beta)
+                if (entry.score >= beta) {
+                    return entry;
+                }
+                break;
+            case TTEntryType.UPPER_BOUND:
+                // Fail-low (score <= alpha)
+                if (entry.score <= alpha) {
+                    return entry;
+                }
+                break;
+        }
+        // Can't use score, but return entry for move ordering
+        return entry;
+    }
+    /**
+     * Get best move from transposition table (for move ordering)
+     *
+     * @param zobristHash - Position hash
+     * @returns Best move if found, null otherwise
+     */
+    getBestMove(zobristHash) {
+        const index = this.getIndex(zobristHash);
+        const entry = this.table[index];
+        if (entry && entry.zobristHash === zobristHash) {
+            return entry.bestMove;
+        }
+        return null;
+    }
+    /**
+     * Clear the transposition table
+     */
+    clear() {
+        this.table.fill(null);
+        this.currentAge = 0;
+        this.hits = 0;
+        this.misses = 0;
+    }
+    /**
+     * Increment search age (call at start of new search)
+     */
+    newSearch() {
+        this.currentAge++;
+    }
+    /**
+     * Get index for a hash value
+     *
+     * @param hash - Zobrist hash
+     * @returns Table index
+     */
+    getIndex(hash) {
+        // Use bitwise AND for fast modulo with power of 2
+        return Number(hash & BigInt(this.size - 1));
+    }
+    /**
+     * Get cache statistics
+     *
+     * @returns Statistics object
+     */
+    getStats() {
+        const total = this.hits + this.misses;
+        const hitRate = total > 0 ? this.hits / total : 0;
+        return {
+            hits: this.hits,
+            misses: this.misses,
+            hitRate,
+            size: this.size,
+        };
+    }
+}
+exports.TranspositionTable = TranspositionTable;
+//# sourceMappingURL=TranspositionTable.js.map

package/dist/ai/TranspositionTable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TranspositionTable.js","sourceRoot":"","sources":["../../src/ai/TranspositionTable.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAKH;;GAEG;AACH,IAAY,WAIX;AAJD,WAAY,WAAW;IACnB,+CAAS,CAAA;IACT,2DAAe,CAAA;IACf,2DAAe,CAAA;AACnB,CAAC,EAJW,WAAW,2BAAX,WAAW,QAItB;AAcD;;;;;GAKG;AACH,MAAa,kBAAkB;IACnB,KAAK,CAAqB;IAC1B,IAAI,CAAS;IACb,UAAU,GAAW,CAAC,CAAC;IACvB,IAAI,GAAW,CAAC,CAAC;IACjB,MAAM,GAAW,CAAC,CAAC;IAE3B;;;;OAIG;IACH,YAAY,SAAiB,EAAE;QAC3B,uCAAuC;QACvC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC;QAC/B,MAAM,UAAU,GAAG,MAAM,GAAG,UAAU,CAAC;QAEvC,uDAAuD;QACvD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CACD,WAAmB,EACnB,KAAa,EACb,KAAY,EACZ,IAAiB,EACjB,QAA6B;QAE7B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAExC,2CAA2C;QAC3C,mBAAmB;QACnB,gCAAgC;QAChC,iCAAiC;QACjC,6CAA6C;QAC7C,MAAM,aAAa,GACf,CAAC,aAAa;YACd,aAAa,CAAC,WAAW,KAAK,WAAW;YACzC,KAAK,IAAI,aAAa,CAAC,KAAK;YAC5B,aAAa,CAAC,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAExC,IAAI,aAAa,EAAE,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG;gBAChB,WAAW;gBACX,KAAK;gBACL,KAAK;gBACL,IAAI;gBACJ,QAAQ;gBACR,GAAG,EAAE,IAAI,CAAC,UAAU;aACvB,CAAC;QACN,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CACD,WAAmB,EACnB,KAAa,EACb,KAAY,EACZ,IAAW;QAEX,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEhC,yCAAyC;QACzC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,WAAW,EAAE,CAAC;YAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,mDAAmD;QACnD,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,iCAAiC;QACjC,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,WAAW,CAAC,KAAK;gBAClB,OAAO,KAAK,CAAC;YAEjB,KAAK,WAAW,CAAC,WAAW;gBACxB,4BAA4B;gBAC5B,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;oBACtB,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,MAAM;YAEV,KAAK,WAAW,CAAC,WAAW;gBACxB,4BAA4B;gBAC5B,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,CAAC;oBACvB,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,MAAM;QACd,CAAC;QAED,sDAAsD;QACtD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,WAAmB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,WAAW,EAAE,CAAC;YAC7C,OAAO,KAAK,CAAC,QAAQ,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,SAAS;QACL,IAAI,CAAC,UAAU,EAAE,CAAC;IACtB,CAAC;IAED;;;;;OAKG;IACK,QAAQ,CAAC,IAAY;QACzB,kDAAkD;QAClD,OAAO,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACJ,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAElD,OAAO;YACH,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,OAAO;YACP,IAAI,EAAE,IAAI,CAAC,IAAI;SAClB,CAAC;IACN,CAAC;CACJ;AAtLD,gDAsLC"}