js-chess-engine 1.0.2 → 2.0.1-rc.0

package/dist/utils/conversion.d.ts

@@ -0,0 +1,152 @@
+/**
+ * Conversion utilities between square notation and internal indices
+ */
+import { Square, SquareIndex, FileIndex, RankIndex } from '../types';
+/**
+ * Convert square notation (e.g., "A1", "E4") to square index (0-63)
+ *
+ * Board layout:
+ * 56 57 58 59 60 61 62 63  (Rank 8) - A8 to H8
+ * 48 49 50 51 52 53 54 55  (Rank 7)
+ * ...
+ *  8  9 10 11 12 13 14 15  (Rank 2)
+ *  0  1  2  3  4  5  6  7  (Rank 1) - A1 to H1
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns Square index (0-63)
+ * @throws Error if square notation is invalid
+ */
+export declare function squareToIndex(square: Square): SquareIndex;
+/**
+ * Convert square index (0-63) to square notation (e.g., "A1", "E4")
+ *
+ * @param index - Square index (0-63)
+ * @returns Square notation in uppercase
+ * @throws Error if index is out of range
+ */
+export declare function indexToSquare(index: SquareIndex): Square;
+/**
+ * Get file index (0-7) from square index
+ *
+ * @param index - Square index (0-63)
+ * @returns File index (0=A, 1=B, ..., 7=H)
+ */
+export declare function getFileIndex(index: SquareIndex): FileIndex;
+/**
+ * Get rank index (0-7) from square index
+ *
+ * @param index - Square index (0-63)
+ * @returns Rank index (0=1, 1=2, ..., 7=8)
+ */
+export declare function getRankIndex(index: SquareIndex): RankIndex;
+/**
+ * Get file from square notation
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns File index (0-7)
+ */
+export declare function getFile(square: Square): FileIndex;
+/**
+ * Get rank from square notation
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns Rank index (0-7)
+ */
+export declare function getRank(square: Square): RankIndex;
+/**
+ * Create square index from file and rank indices
+ *
+ * @param file - File index (0-7)
+ * @param rank - Rank index (0-7)
+ * @returns Square index (0-63)
+ */
+export declare function fileRankToIndex(file: FileIndex, rank: RankIndex): SquareIndex;
+/**
+ * Check if square notation is valid
+ *
+ * @param square - Square notation
+ * @returns true if valid
+ */
+export declare function isValidSquare(square: string): boolean;
+/**
+ * Check if square index is valid
+ *
+ * @param index - Square index
+ * @returns true if valid (0-63)
+ */
+export declare function isValidIndex(index: number): boolean;
+/**
+ * Convert square index to bitboard (single bit set)
+ *
+ * @param index - Square index (0-63)
+ * @returns Bitboard with single bit set
+ */
+export declare function indexToBitboard(index: SquareIndex): bigint;
+/**
+ * Convert square notation to bitboard
+ *
+ * @param square - Square notation
+ * @returns Bitboard with single bit set
+ */
+export declare function squareToBitboard(square: Square): bigint;
+/**
+ * Get all set bits (square indices) from a bitboard
+ *
+ * @param bitboard - Bitboard to extract indices from
+ * @returns Array of square indices where bits are set
+ */
+export declare function bitboardToIndices(bitboard: bigint): SquareIndex[];
+/**
+ * Get the index of the lowest set bit in a bitboard
+ *
+ * @param bitboard - Bitboard
+ * @returns Index of lowest set bit, or -1 if no bits set
+ */
+export declare function getLowestSetBit(bitboard: bigint): SquareIndex;
+/**
+ * Count the number of set bits in a bitboard (population count)
+ *
+ * @param bitboard - Bitboard
+ * @returns Number of set bits
+ */
+export declare function popCount(bitboard: bigint): number;
+/**
+ * Calculate Manhattan distance between two squares
+ *
+ * @param from - Source square index
+ * @param to - Target square index
+ * @returns Manhattan distance
+ */
+export declare function manhattanDistance(from: SquareIndex, to: SquareIndex): number;
+/**
+ * Calculate Chebyshev distance between two squares (king moves)
+ *
+ * @param from - Source square index
+ * @param to - Target square index
+ * @returns Chebyshev distance
+ */
+export declare function chebyshevDistance(from: SquareIndex, to: SquareIndex): number;
+/**
+ * Check if a square is on the edge of the board
+ *
+ * @param index - Square index
+ * @returns true if on edge
+ */
+export declare function isOnEdge(index: SquareIndex): boolean;
+/**
+ * Check if square is on A-file
+ */
+export declare function isAFile(index: SquareIndex): boolean;
+/**
+ * Check if square is on H-file
+ */
+export declare function isHFile(index: SquareIndex): boolean;
+/**
+ * Check if square is on rank 1
+ */
+export declare function isRank1(index: SquareIndex): boolean;
+/**
+ * Check if square is on rank 8
+ */
+export declare function isRank8(index: SquareIndex): boolean;
+//# sourceMappingURL=conversion.d.ts.map

package/dist/utils/conversion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conversion.d.ts","sourceRoot":"","sources":["../../src/utils/conversion.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAe,MAAM,UAAU,CAAC;AAKlF;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAkBzD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CASxD;AAID;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,SAAS,CAE1D;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,SAAS,CAE1D;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAOjD;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAOjD;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,GAAG,WAAW,CAE7E;AAID;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAUrD;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEnD;AAID;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAE1D;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,EAAE,CAWjE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,CAe7D;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAUjD;AAID;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,GAAG,MAAM,CAO5E;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,GAAG,MAAM,CAO5E;AAID;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAIpD;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAEnD;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAEnD;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAEnD;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAEnD"}

package/dist/utils/conversion.js

@@ -0,0 +1,288 @@
+"use strict";
+/**
+ * Conversion utilities between square notation and internal indices
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.squareToIndex = squareToIndex;
+exports.indexToSquare = indexToSquare;
+exports.getFileIndex = getFileIndex;
+exports.getRankIndex = getRankIndex;
+exports.getFile = getFile;
+exports.getRank = getRank;
+exports.fileRankToIndex = fileRankToIndex;
+exports.isValidSquare = isValidSquare;
+exports.isValidIndex = isValidIndex;
+exports.indexToBitboard = indexToBitboard;
+exports.squareToBitboard = squareToBitboard;
+exports.bitboardToIndices = bitboardToIndices;
+exports.getLowestSetBit = getLowestSetBit;
+exports.popCount = popCount;
+exports.manhattanDistance = manhattanDistance;
+exports.chebyshevDistance = chebyshevDistance;
+exports.isOnEdge = isOnEdge;
+exports.isAFile = isAFile;
+exports.isHFile = isHFile;
+exports.isRank1 = isRank1;
+exports.isRank8 = isRank8;
+const constants_1 = require("./constants");
+// ==================== Square ↔ Index Conversion ====================
+/**
+ * Convert square notation (e.g., "A1", "E4") to square index (0-63)
+ *
+ * Board layout:
+ * 56 57 58 59 60 61 62 63  (Rank 8) - A8 to H8
+ * 48 49 50 51 52 53 54 55  (Rank 7)
+ * ...
+ *  8  9 10 11 12 13 14 15  (Rank 2)
+ *  0  1  2  3  4  5  6  7  (Rank 1) - A1 to H1
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns Square index (0-63)
+ * @throws Error if square notation is invalid
+ */
+function squareToIndex(square) {
+    const normalized = square.toUpperCase();
+    if (normalized.length !== 2) {
+        throw new Error(`Invalid square notation: ${square}`);
+    }
+    const file = normalized[0];
+    const rank = normalized[1];
+    const fileIndex = constants_1.COLUMNS.indexOf(file);
+    const rankIndex = constants_1.ROWS.indexOf(rank);
+    if (fileIndex === -1 || rankIndex === -1) {
+        throw new Error(`Invalid square notation: ${square}`);
+    }
+    return (rankIndex * 8 + fileIndex);
+}
+/**
+ * Convert square index (0-63) to square notation (e.g., "A1", "E4")
+ *
+ * @param index - Square index (0-63)
+ * @returns Square notation in uppercase
+ * @throws Error if index is out of range
+ */
+function indexToSquare(index) {
+    if (index < 0 || index > 63) {
+        throw new Error(`Invalid square index: ${index}`);
+    }
+    const fileIndex = index % 8;
+    const rankIndex = Math.floor(index / 8);
+    return `${constants_1.COLUMNS[fileIndex]}${constants_1.ROWS[rankIndex]}`;
+}
+// ==================== File/Rank Conversion ====================
+/**
+ * Get file index (0-7) from square index
+ *
+ * @param index - Square index (0-63)
+ * @returns File index (0=A, 1=B, ..., 7=H)
+ */
+function getFileIndex(index) {
+    return (index % 8);
+}
+/**
+ * Get rank index (0-7) from square index
+ *
+ * @param index - Square index (0-63)
+ * @returns Rank index (0=1, 1=2, ..., 7=8)
+ */
+function getRankIndex(index) {
+    return Math.floor(index / 8);
+}
+/**
+ * Get file from square notation
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns File index (0-7)
+ */
+function getFile(square) {
+    const normalized = square.toUpperCase();
+    const fileIndex = constants_1.COLUMNS.indexOf(normalized[0]);
+    if (fileIndex === -1) {
+        throw new Error(`Invalid square notation: ${square}`);
+    }
+    return fileIndex;
+}
+/**
+ * Get rank from square notation
+ *
+ * @param square - Square notation (case-insensitive)
+ * @returns Rank index (0-7)
+ */
+function getRank(square) {
+    const normalized = square.toUpperCase();
+    const rankIndex = constants_1.ROWS.indexOf(normalized[1]);
+    if (rankIndex === -1) {
+        throw new Error(`Invalid square notation: ${square}`);
+    }
+    return rankIndex;
+}
+/**
+ * Create square index from file and rank indices
+ *
+ * @param file - File index (0-7)
+ * @param rank - Rank index (0-7)
+ * @returns Square index (0-63)
+ */
+function fileRankToIndex(file, rank) {
+    return (rank * 8 + file);
+}
+// ==================== Validation ====================
+/**
+ * Check if square notation is valid
+ *
+ * @param square - Square notation
+ * @returns true if valid
+ */
+function isValidSquare(square) {
+    if (typeof square !== 'string' || square.length !== 2) {
+        return false;
+    }
+    const normalized = square.toUpperCase();
+    const file = normalized[0];
+    const rank = normalized[1];
+    return constants_1.COLUMNS.includes(file) && constants_1.ROWS.includes(rank);
+}
+/**
+ * Check if square index is valid
+ *
+ * @param index - Square index
+ * @returns true if valid (0-63)
+ */
+function isValidIndex(index) {
+    return Number.isInteger(index) && index >= 0 && index <= 63;
+}
+// ==================== Bitboard Helpers ====================
+/**
+ * Convert square index to bitboard (single bit set)
+ *
+ * @param index - Square index (0-63)
+ * @returns Bitboard with single bit set
+ */
+function indexToBitboard(index) {
+    return 1n << BigInt(index);
+}
+/**
+ * Convert square notation to bitboard
+ *
+ * @param square - Square notation
+ * @returns Bitboard with single bit set
+ */
+function squareToBitboard(square) {
+    return indexToBitboard(squareToIndex(square));
+}
+/**
+ * Get all set bits (square indices) from a bitboard
+ *
+ * @param bitboard - Bitboard to extract indices from
+ * @returns Array of square indices where bits are set
+ */
+function bitboardToIndices(bitboard) {
+    const indices = [];
+    let bb = bitboard;
+    while (bb !== 0n) {
+        const index = getLowestSetBit(bb);
+        indices.push(index);
+        bb &= bb - 1n; // Clear lowest set bit
+    }
+    return indices;
+}
+/**
+ * Get the index of the lowest set bit in a bitboard
+ *
+ * @param bitboard - Bitboard
+ * @returns Index of lowest set bit, or -1 if no bits set
+ */
+function getLowestSetBit(bitboard) {
+    if (bitboard === 0n) {
+        return -1;
+    }
+    // Count trailing zeros
+    let index = 0;
+    let bb = bitboard;
+    while ((bb & 1n) === 0n) {
+        bb >>= 1n;
+        index++;
+    }
+    return index;
+}
+/**
+ * Count the number of set bits in a bitboard (population count)
+ *
+ * @param bitboard - Bitboard
+ * @returns Number of set bits
+ */
+function popCount(bitboard) {
+    let count = 0;
+    let bb = bitboard;
+    while (bb !== 0n) {
+        bb &= bb - 1n; // Clear lowest set bit
+        count++;
+    }
+    return count;
+}
+// ==================== Distance Calculations ====================
+/**
+ * Calculate Manhattan distance between two squares
+ *
+ * @param from - Source square index
+ * @param to - Target square index
+ * @returns Manhattan distance
+ */
+function manhattanDistance(from, to) {
+    const fromFile = getFileIndex(from);
+    const fromRank = getRankIndex(from);
+    const toFile = getFileIndex(to);
+    const toRank = getRankIndex(to);
+    return Math.abs(fromFile - toFile) + Math.abs(fromRank - toRank);
+}
+/**
+ * Calculate Chebyshev distance between two squares (king moves)
+ *
+ * @param from - Source square index
+ * @param to - Target square index
+ * @returns Chebyshev distance
+ */
+function chebyshevDistance(from, to) {
+    const fromFile = getFileIndex(from);
+    const fromRank = getRankIndex(from);
+    const toFile = getFileIndex(to);
+    const toRank = getRankIndex(to);
+    return Math.max(Math.abs(fromFile - toFile), Math.abs(fromRank - toRank));
+}
+// ==================== Board Boundaries ====================
+/**
+ * Check if a square is on the edge of the board
+ *
+ * @param index - Square index
+ * @returns true if on edge
+ */
+function isOnEdge(index) {
+    const file = getFileIndex(index);
+    const rank = getRankIndex(index);
+    return file === 0 || file === 7 || rank === 0 || rank === 7;
+}
+/**
+ * Check if square is on A-file
+ */
+function isAFile(index) {
+    return getFileIndex(index) === 0;
+}
+/**
+ * Check if square is on H-file
+ */
+function isHFile(index) {
+    return getFileIndex(index) === 7;
+}
+/**
+ * Check if square is on rank 1
+ */
+function isRank1(index) {
+    return getRankIndex(index) === 0;
+}
+/**
+ * Check if square is on rank 8
+ */
+function isRank8(index) {
+    return getRankIndex(index) === 7;
+}
+//# sourceMappingURL=conversion.js.map

package/dist/utils/conversion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conversion.js","sourceRoot":"","sources":["../../src/utils/conversion.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAqBH,sCAkBC;AASD,sCASC;AAUD,oCAEC;AAQD,oCAEC;AAQD,0BAOC;AAQD,0BAOC;AASD,0CAEC;AAUD,sCAUC;AAQD,oCAEC;AAUD,0CAEC;AAQD,4CAEC;AAQD,8CAWC;AAQD,0CAeC;AAQD,4BAUC;AAWD,8CAOC;AASD,8CAOC;AAUD,4BAIC;AAKD,0BAEC;AAKD,0BAEC;AAKD,0BAEC;AAKD,0BAEC;AAjTD,2CAA4C;AAE5C,sEAAsE;AAEtE;;;;;;;;;;;;;GAaG;AACH,SAAgB,aAAa,CAAC,MAAc;IACxC,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IAExC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAW,CAAC;IACrC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAQ,CAAC;IAElC,MAAM,SAAS,GAAG,mBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,gBAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAErC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,CAAC,SAAS,GAAG,CAAC,GAAG,SAAS,CAAgB,CAAC;AACtD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,aAAa,CAAC,KAAkB;IAC5C,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,yBAAyB,KAAK,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAExC,OAAO,GAAG,mBAAO,CAAC,SAAS,CAAC,GAAG,gBAAI,CAAC,SAAS,CAAC,EAAE,CAAC;AACrD,CAAC;AAED,iEAAiE;AAEjE;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,KAAkB;IAC3C,OAAO,CAAC,KAAK,GAAG,CAAC,CAAc,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,KAAkB;IAC3C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAc,CAAC;AAC9C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,MAAc;IAClC,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACxC,MAAM,SAAS,GAAG,mBAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAW,CAAC,CAAC;IAC3D,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,SAAsB,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,MAAc;IAClC,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACxC,MAAM,SAAS,GAAG,gBAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAQ,CAAC,CAAC;IACrD,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,4BAA4B,MAAM,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,SAAsB,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,IAAe,EAAE,IAAe;IAC5D,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAgB,CAAC;AAC5C,CAAC;AAED,uDAAuD;AAEvD;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,MAAc;IACxC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACxC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAE3B,OAAO,mBAAO,CAAC,QAAQ,CAAC,IAAc,CAAC,IAAI,gBAAI,CAAC,QAAQ,CAAC,IAAW,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,KAAa;IACtC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;AAChE,CAAC;AAED,6DAA6D;AAE7D;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,KAAkB;IAC9C,OAAO,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,MAAc;IAC3C,OAAO,eAAe,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,QAAgB;IAC9C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,EAAE,GAAG,QAAQ,CAAC;IAElB,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,uBAAuB;IAC1C,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,QAAgB;IAC5C,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;QAClB,OAAO,CAAC,CAAgB,CAAC;IAC7B,CAAC;IAED,uBAAuB;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,EAAE,GAAG,QAAQ,CAAC;IAElB,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QACtB,EAAE,KAAK,EAAE,CAAC;QACV,KAAK,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,KAAoB,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,QAAgB;IACrC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,EAAE,GAAG,QAAQ,CAAC;IAElB,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,uBAAuB;QACtC,KAAK,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,kEAAkE;AAElE;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,IAAiB,EAAE,EAAe;IAChE,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,IAAiB,EAAE,EAAe;IAChE,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,6DAA6D;AAE7D;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,KAAkB;IACvC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACjC,OAAO,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAC,KAAkB;IACtC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAC,KAAkB;IACtC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAC,KAAkB;IACtC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAC,KAAkB;IACtC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC"}

package/dist/utils/environment.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Environment detection utilities
+ * Helps optimize memory usage based on runtime environment
+ */
+/**
+ * Detect if code is running in Node.js environment
+ *
+ * @returns true if running in Node.js, false if in browser
+ */
+export declare function isNodeEnvironment(): boolean;
+/**
+ * Detect if code is running in browser environment
+ *
+ * @returns true if running in browser, false if in Node.js
+ */
+export declare function isBrowserEnvironment(): boolean;
+/**
+ * Get default transposition table size based on environment
+ *
+ * Node.js: 16 MB (ample memory available)
+ * Browser: 1 MB (more conservative for web/mobile)
+ *
+ * @returns Recommended TT size in MB
+ */
+export declare function getDefaultTTSize(): number;
+/**
+ * Get recommended TT size for a given AI level and environment
+ *
+ * @param level - AI difficulty level (1-5)
+ * @returns Recommended TT size in MB
+ */
+export declare function getRecommendedTTSize(level: number): number;
+//# sourceMappingURL=environment.d.ts.map

package/dist/utils/environment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"environment.d.ts","sourceRoot":"","sources":["../../src/utils/environment.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;GAIG;AACH,wBAAgB,iBAAiB,IAAI,OAAO,CAO3C;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,IAAI,OAAO,CAE9C;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,IAAI,MAAM,CAEzC;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAsB1D"}

package/dist/utils/environment.js

@@ -0,0 +1,71 @@
+"use strict";
+/**
+ * Environment detection utilities
+ * Helps optimize memory usage based on runtime environment
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isNodeEnvironment = isNodeEnvironment;
+exports.isBrowserEnvironment = isBrowserEnvironment;
+exports.getDefaultTTSize = getDefaultTTSize;
+exports.getRecommendedTTSize = getRecommendedTTSize;
+/**
+ * Detect if code is running in Node.js environment
+ *
+ * @returns true if running in Node.js, false if in browser
+ */
+function isNodeEnvironment() {
+    // Check for Node.js-specific globals
+    return (typeof process !== 'undefined' &&
+        process.versions != null &&
+        process.versions.node != null);
+}
+/**
+ * Detect if code is running in browser environment
+ *
+ * @returns true if running in browser, false if in Node.js
+ */
+function isBrowserEnvironment() {
+    return !isNodeEnvironment();
+}
+/**
+ * Get default transposition table size based on environment
+ *
+ * Node.js: 16 MB (ample memory available)
+ * Browser: 1 MB (more conservative for web/mobile)
+ *
+ * @returns Recommended TT size in MB
+ */
+function getDefaultTTSize() {
+    return isNodeEnvironment() ? 16 : 1;
+}
+/**
+ * Get recommended TT size for a given AI level and environment
+ *
+ * @param level - AI difficulty level (1-5)
+ * @returns Recommended TT size in MB
+ */
+function getRecommendedTTSize(level) {
+    if (isNodeEnvironment()) {
+        // Node.js - more generous memory allocation
+        const nodeSizes = {
+            1: 2, // Level 1: 2 MB
+            2: 4, // Level 2: 4 MB
+            3: 16, // Level 3: 16 MB (default)
+            4: 32, // Level 4: 32 MB
+            5: 64, // Level 5: 64 MB
+        };
+        return nodeSizes[level] ?? 16;
+    }
+    else {
+        // Browser - modern-device-friendly allocation (reasonable for 2024+ devices)
+        const browserSizes = {
+            1: 1, // Level 1: 1 MB (lightweight, older devices)
+            2: 2, // Level 2: 2 MB (mobile-friendly)
+            3: 8, // Level 3: 8 MB (balanced default - appropriate for modern browsers)
+            4: 16, // Level 4: 16 MB (strong performance)
+            5: 32, // Level 5: 32 MB (maximum strength)
+        };
+        return browserSizes[level] ?? 8;
+    }
+}
+//# sourceMappingURL=environment.js.map

package/dist/utils/environment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"environment.js","sourceRoot":"","sources":["../../src/utils/environment.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAOH,8CAOC;AAOD,oDAEC;AAUD,4CAEC;AAQD,oDAsBC;AA/DD;;;;GAIG;AACH,SAAgB,iBAAiB;IAC7B,qCAAqC;IACrC,OAAO,CACH,OAAO,OAAO,KAAK,WAAW;QAC9B,OAAO,CAAC,QAAQ,IAAI,IAAI;QACxB,OAAO,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAChC,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,SAAgB,oBAAoB;IAChC,OAAO,CAAC,iBAAiB,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,gBAAgB;IAC5B,OAAO,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,oBAAoB,CAAC,KAAa;IAC9C,IAAI,iBAAiB,EAAE,EAAE,CAAC;QACtB,4CAA4C;QAC5C,MAAM,SAAS,GAA2B;YACtC,CAAC,EAAE,CAAC,EAAI,gBAAgB;YACxB,CAAC,EAAE,CAAC,EAAI,gBAAgB;YACxB,CAAC,EAAE,EAAE,EAAG,2BAA2B;YACnC,CAAC,EAAE,EAAE,EAAG,iBAAiB;YACzB,CAAC,EAAE,EAAE,EAAG,iBAAiB;SAC5B,CAAC;QACF,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC;SAAM,CAAC;QACJ,6EAA6E;QAC7E,MAAM,YAAY,GAA2B;YACzC,CAAC,EAAE,CAAC,EAAK,6CAA6C;YACtD,CAAC,EAAE,CAAC,EAAK,kCAAkC;YAC3C,CAAC,EAAE,CAAC,EAAK,qEAAqE;YAC9E,CAAC,EAAE,EAAE,EAAI,sCAAsC;YAC/C,CAAC,EAAE,EAAE,EAAI,oCAAoC;SAChD,CAAC;QACF,OAAO,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;AACL,CAAC"}

package/dist/utils/fen.d.ts

@@ -0,0 +1,28 @@
+/**
+ * FEN (Forsyth-Edwards Notation) parser and formatter
+ *
+ * FEN format: pieces turn castling enPassant halfMove fullMove
+ * Example: rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1
+ */
+import { InternalBoard } from '../types';
+/**
+ * Parse a FEN string into an internal board
+ *
+ * @param fen - FEN string
+ * @returns Internal board representation
+ */
+export declare function parseFEN(fen: string): InternalBoard;
+/**
+ * Convert an internal board to a FEN string
+ *
+ * @param board - Internal board
+ * @returns FEN string
+ */
+export declare function toFEN(board: InternalBoard): string;
+/**
+ * Get FEN for starting position
+ *
+ * @returns FEN string for standard chess starting position
+ */
+export declare function getStartingFEN(): string;
+//# sourceMappingURL=fen.d.ts.map

package/dist/utils/fen.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fen.d.ts","sourceRoot":"","sources":["../../src/utils/fen.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,aAAa,EAAqC,MAAM,UAAU,CAAC;AAI5E;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,CA+EnD;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,CAyDlD;AAkDD;;;;GAIG;AACH,wBAAgB,cAAc,IAAI,MAAM,CAEvC"}