@datamoc/mw_games 0.19.0 → 0.22.0

package/dist/board/tablebase.js

@@ -0,0 +1,414 @@
+const EXTRA_LETTER = { queen: 'Q', rook: 'R', bishop: 'B', knight: 'N' };
+const LETTER_EXTRA = { Q: 'queen', R: 'rook', B: 'bishop', N: 'knight' };
+const KIND_INDEX = { pawn: 0, knight: 1, bishop: 2, rook: 3, queen: 4, king: 5 };
+/**
+ * The canonical id for white extras: strongest piece first, so `['bishop',
+ * 'queen']` and `['queen', 'bishop']` name the same `KQBK` ending.
+ *
+ * @example
+ * ```ts
+ * import { tablebaseId } from '@datamoc/mw_games/board';
+ *
+ * console.log(tablebaseId(['bishop', 'queen'])); // 'KQBK'
+ * ```
+ */
+export function tablebaseId(white) {
+    const order = { queen: 0, rook: 1, bishop: 2, knight: 3 };
+    return `K${white
+        .slice()
+        .sort((a, b) => order[a] - order[b])
+        .map((kind) => EXTRA_LETTER[kind])
+        .join('')}K`;
+}
+const BASE64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+function base64Encode(raw) {
+    let out = '';
+    for (let i = 0; i < raw.length; i += 3) {
+        const a = raw[i];
+        const b = i + 1 < raw.length ? raw[i + 1] : 0;
+        const c = i + 2 < raw.length ? raw[i + 2] : 0;
+        out += BASE64[a >> 2] + BASE64[((a & 3) << 4) | (b >> 4)];
+        out += i + 1 < raw.length ? BASE64[((b & 15) << 2) | (c >> 6)] : '=';
+        out += i + 2 < raw.length ? BASE64[c & 63] : '=';
+    }
+    return out;
+}
+function base64Decode(code) {
+    if (code.length % 4 !== 0)
+        throw new Error('tablebase data is not base64: length is not a multiple of 4');
+    const values = new Array(code.length);
+    for (let i = 0; i < code.length; i++) {
+        if (code[i] === '=') {
+            values[i] = -1;
+            continue;
+        }
+        const value = BASE64.indexOf(code[i]);
+        if (value === -1)
+            throw new Error(`tablebase data is not base64: ${code[i]}`);
+        values[i] = value;
+    }
+    const out = [];
+    for (let i = 0; i < values.length; i += 4) {
+        const [a, b, c, d] = [values[i], values[i + 1], values[i + 2], values[i + 3]];
+        if (a === -1 || b === -1)
+            throw new Error('tablebase data is not base64: padding inside a quantum');
+        out.push((a << 2) | (b >> 4));
+        if (c !== -1)
+            out.push(((b & 15) << 4) | (c >> 2));
+        if (d !== -1)
+            out.push(((c & 3) << 6) | d);
+    }
+    return new Uint8Array(out);
+}
+/**
+ * Canonical Huffman plus base64, the game decodes with this same
+ * dependency-free code. Two dictionary schemes were tried first and both lost
+ * to the data: run-length encoding collapsed because a solved ending is a fine
+ * win/draw/loss mosaic rather than broad regions, and LZ77 barely beat raw
+ * size on the 4-piece mosaics while tripping over its own match flags. Huffman
+ * matches the actual skew (draws dominate, distances cluster near zero) with a
+ * decoder a reader can hold in their head.
+ *
+ * @example
+ * ```ts
+ * import { huffDecode, huffEncode } from '@datamoc/mw_games/board';
+ *
+ * console.log(huffDecode(huffEncode(new Uint8Array([2, 2, 2, 3])))); // Uint8Array([2, 2, 2, 3])
+ * ```
+ */
+export function huffEncode(raw) {
+    const counts = new Array(256).fill(0);
+    for (const byte of raw)
+        counts[byte]++;
+    const symbols = counts.map((count, symbol) => ({ count, symbol })).filter((entry) => entry.count > 0);
+    const header = [1, symbols.length];
+    if (symbols.length === 0)
+        return base64Encode(new Uint8Array([1, 0, 0, 0, 0, 0]));
+    if (symbols.length === 1) {
+        header.push(symbols[0].symbol, 0);
+        const packed = new Uint8Array(header.length + 4);
+        packed.set(header, 0);
+        packed[header.length] = raw.length & 255;
+        packed[header.length + 1] = (raw.length >> 8) & 255;
+        packed[header.length + 2] = (raw.length >> 16) & 255;
+        packed[header.length + 3] = (raw.length >> 24) & 255;
+        return base64Encode(packed);
+    }
+    const lengths = huffmanLengths(symbols.map((entry) => entry.count));
+    const ordered = symbols
+        .map((entry, i) => ({ symbol: entry.symbol, length: lengths[i] }))
+        .sort((a, b) => a.symbol - b.symbol);
+    for (const entry of ordered)
+        header.push(entry.symbol);
+    for (const entry of ordered)
+        header.push(entry.length);
+    const codes = canonicalCodes(ordered);
+    const table = new Map();
+    for (let i = 0; i < ordered.length; i++)
+        table.set(ordered[i].symbol, codes[i]);
+    let totalBits = 0;
+    for (const entry of symbols)
+        totalBits += entry.count * table.get(entry.symbol).length;
+    const bytes = new Uint8Array(header.length + 4 + Math.ceil(totalBits / 8));
+    bytes.set(header, 0);
+    bytes[header.length] = raw.length & 255;
+    bytes[header.length + 1] = (raw.length >> 8) & 255;
+    bytes[header.length + 2] = (raw.length >> 16) & 255;
+    bytes[header.length + 3] = (raw.length >> 24) & 255;
+    let bit = 0;
+    const firstDataByte = header.length + 4;
+    for (const byte of raw) {
+        const entry = table.get(byte);
+        for (let k = entry.length - 1; k >= 0; k--) {
+            if ((entry.code >> k) & 1)
+                bytes[firstDataByte + (bit >> 3)] |= 1 << (7 - (bit & 7));
+            bit++;
+        }
+    }
+    return base64Encode(bytes);
+}
+/** code lengths from symbol counts: repeatedly merge the two smallest */
+function huffmanLengths(counts) {
+    const n = counts.length;
+    if (n === 0)
+        return [];
+    const weights = counts.slice();
+    const lengths = new Array(n).fill(0);
+    const active = counts.map((_, i) => i);
+    const mergeOrder = [];
+    while (active.length > 1) {
+        active.sort((a, b) => weights[a] - weights[b]);
+        const a = active.shift();
+        const b = active.shift();
+        mergeOrder.push([a, b]);
+        weights[a] += weights[b];
+        weights[b] = -1;
+        active.push(a);
+    }
+    for (let i = mergeOrder.length - 1; i >= 0; i--) {
+        const [a, b] = mergeOrder[i];
+        lengths[b] = lengths[a] + 1;
+        lengths[a]++;
+    }
+    if (lengths.some((length) => length > 32))
+        throw new Error('tablebase Huffman code too deep');
+    return lengths;
+}
+/** canonical codes from (symbol, length) sorted by symbol: counted, not stored */
+function canonicalCodes(ordered) {
+    const byLength = ordered.slice().sort((a, b) => a.length - b.length || a.symbol - b.symbol);
+    let code = 0;
+    let lastLength = byLength[0].length;
+    const assigned = new Map();
+    for (const entry of byLength) {
+        code <<= entry.length - lastLength;
+        assigned.set(entry.symbol, { code, length: entry.length });
+        code++;
+        lastLength = entry.length;
+    }
+    return ordered.map((entry) => assigned.get(entry.symbol));
+}
+/**
+ * The inverse of `huffEncode`: throws on malformed input rather than guessing,
+ * because a corrupt table must fail the load, never misprobe. The symbol count
+ * in the header must match the decoded symbols exactly, so truncation fails
+ * here instead of probing short.
+ *
+ * @example
+ * ```ts
+ * import { huffDecode, huffEncode } from '@datamoc/mw_games/board';
+ *
+ * console.log(huffDecode(huffEncode(new Uint8Array([2, 2])))); // Uint8Array([2, 2])
+ * ```
+ */
+export function huffDecode(code) {
+    const bytes = base64Decode(code);
+    if (bytes.length < 2)
+        throw new Error('tablebase data holds no header');
+    if (bytes[0] !== 1)
+        throw new Error(`tablebase data version ${bytes[0]} is not 1`);
+    const nSymbols = bytes[1];
+    if (2 + 2 * nSymbols > bytes.length)
+        throw new Error('tablebase data ends inside its header');
+    const symbols = [];
+    const lengths = [];
+    for (let i = 0; i < nSymbols; i++)
+        symbols.push(bytes[2 + i]);
+    for (let i = 0; i < nSymbols; i++)
+        lengths.push(bytes[2 + nSymbols + i]);
+    const at = 2 + 2 * nSymbols;
+    if (nSymbols === 0) {
+        if (at + 4 !== bytes.length)
+            throw new Error('tablebase data trails its empty header');
+        return new Uint8Array(0);
+    }
+    if (nSymbols === 1) {
+        if (at + 4 !== bytes.length)
+            throw new Error('tablebase data trails its single-symbol header');
+        const total = bytes[at] | (bytes[at + 1] << 8) | (bytes[at + 2] << 16) | (bytes[at + 3] << 24);
+        return new Uint8Array(total).fill(symbols[0]);
+    }
+    if (at + 4 > bytes.length)
+        throw new Error('tablebase data ends before its count');
+    const total = bytes[at] | (bytes[at + 1] << 8) | (bytes[at + 2] << 16) | (bytes[at + 3] << 24);
+    const ordered = symbols.map((symbol, i) => ({ symbol, length: lengths[i] }));
+    const codes = canonicalCodes(ordered);
+    const root = {};
+    for (let i = 0; i < ordered.length; i++) {
+        let node = root;
+        for (let k = codes[i].length - 1; k >= 0; k--) {
+            const bit = (codes[i].code >> k) & 1;
+            if (k === 0) {
+                if (bit)
+                    node.one = { symbol: ordered[i].symbol };
+                else
+                    node.zero = { symbol: ordered[i].symbol };
+            }
+            else {
+                if (bit)
+                    node.one = node.one ?? {};
+                else
+                    node.zero = node.zero ?? {};
+                node = (bit ? node.one : node.zero);
+            }
+        }
+    }
+    const out = new Uint8Array(total);
+    let produced = 0;
+    let bit = 0;
+    const firstDataByte = at + 4;
+    const totalBits = (bytes.length - firstDataByte) * 8;
+    while (produced < total) {
+        if (bit >= totalBits)
+            throw new Error('tablebase data ends before its count');
+        let node = root;
+        for (;;) {
+            const byte = bytes[firstDataByte + (bit >> 3)];
+            const value = (byte >> (7 - (bit & 7))) & 1;
+            bit++;
+            node = (value ? node.one : node.zero);
+            if (!node)
+                throw new Error('tablebase data walks off its Huffman tree');
+            if (node.symbol !== undefined)
+                break;
+        }
+        out[produced++] = node.symbol;
+    }
+    for (; bit < totalBits; bit++) {
+        const byte = bytes[firstDataByte + (bit >> 3)];
+        if ((byte >> (7 - (bit & 7))) & 1)
+            throw new Error('tablebase data does not end in zero padding');
+    }
+    return out;
+}
+function huffDecodeU16(code) {
+    const bytes = huffDecode(code);
+    if (bytes.length % 2 !== 0)
+        throw new Error('tablebase distances are not byte pairs');
+    const out = new Uint16Array(bytes.length / 2);
+    for (let i = 0; i < out.length; i++)
+        out[i] = bytes[2 * i] | (bytes[2 * i + 1] << 8);
+    return out;
+}
+/**
+ * Loads a checked-in ending file into probeable arrays: validates the id against
+ * its extras, the position count against the piece count, and both payloads
+ * against the count, so a truncated artifact fails here with its ending named.
+ *
+ * @example
+ * ```ts
+ * import { loadTablebaseEnding } from '@datamoc/mw_games/board';
+ *
+ * const ending = loadTablebaseEnding({ version: 1, id: 'KBK', white: ['bishop'], positions: 2, wdl: 'AgEC', dtm: 'AAQAAQ' });
+ * console.log(ending.id); // 'KBK'
+ * ```
+ */
+export function loadTablebaseEnding(file) {
+    if (file.version !== 1)
+        throw new Error(`${file.id}: unknown tablebase version ${String(file.version)}`);
+    if (file.id !== tablebaseId(file.white))
+        throw new Error(`${file.id}: id does not match its extras`);
+    for (const kind of file.white) {
+        if (!LETTER_EXTRA[EXTRA_LETTER[kind]])
+            throw new Error(`${file.id}: not a tablebase piece: ${String(kind)}`);
+    }
+    const pieces = 2 + file.white.length;
+    let positions = 1;
+    for (let i = 0; i < pieces; i++)
+        positions *= 64;
+    positions *= 2;
+    if (file.positions !== positions)
+        throw new Error(`${file.id}: claims ${file.positions} positions, holds ${positions}`);
+    const wdl = huffDecode(file.wdl);
+    if (wdl.length !== positions)
+        throw new Error(`${file.id}: WDL decodes to ${wdl.length} positions, needs ${positions}`);
+    const dtm = huffDecodeU16(file.dtm);
+    if (dtm.length !== positions)
+        throw new Error(`${file.id}: distances decode to ${dtm.length} positions, need ${positions}`);
+    const strength = { queen: 0, rook: 1, bishop: 2, knight: 3 };
+    return {
+        id: file.id,
+        extras: file.white
+            .slice()
+            .sort((a, b) => strength[a] - strength[b])
+            .map((kind) => KIND_INDEX[kind]),
+        positions,
+        wdl,
+        dtm,
+    };
+}
+function placedPieces(state) {
+    if ('pieces' in state) {
+        const out = [];
+        for (let i = 0; i < 12; i++) {
+            let bb = state.pieces[i];
+            while (bb) {
+                const single = bb & -bb;
+                out.push({ kind: i % 6, side: i < 6 ? 'white' : 'black', square: Math.log2(Number(single)) });
+                bb ^= single;
+            }
+        }
+        return out;
+    }
+    const out = [];
+    state.board.forEach((piece, square) => {
+        if (piece)
+            out.push({ kind: KIND_INDEX[piece.kind], side: piece.side, square });
+    });
+    return out;
+}
+function castlingRights(state) {
+    if ('pieces' in state)
+        return state.castling !== 0;
+    const rights = state.castling;
+    return rights.whiteKingside || rights.whiteQueenside || rights.blackKingside || rights.blackQueenside;
+}
+/**
+ * Probes loaded endings for an exact position: its WDL outcome from the side to
+ * move's view with the distance, fifty-move-adjudicated against `halfmove` (a win
+ * too far to force in time comes back a draw, and likewise a distant loss).
+ * Pure and total: anything outside the shipped scope - pawns, rights, black
+ * extras, bare kings, an ending the game never loaded - is a miss (`null`).
+ *
+ * @example
+ * ```ts
+ * import { probeTablebase, startingChess } from '@datamoc/mw_games/board';
+ *
+ * console.log(probeTablebase({}, startingChess())); // null - no endings loaded, never an error
+ * ```
+ */
+export function probeTablebase(loaded, state, halfmove = 0) {
+    if (!Number.isInteger(halfmove) || halfmove < 0)
+        throw new RangeError('halfmove must be a non-negative integer');
+    const pieces = placedPieces(state);
+    const whiteKings = pieces.filter((piece) => piece.kind === 5 && piece.side === 'white');
+    const blackKings = pieces.filter((piece) => piece.kind === 5 && piece.side === 'black');
+    if (whiteKings.length !== 1 || blackKings.length !== 1)
+        return null;
+    if (pieces.some((piece) => piece.kind === 0))
+        return null;
+    if (pieces.some((piece) => piece.kind !== 5 && piece.side === 'black'))
+        return null;
+    if (castlingRights(state))
+        return null;
+    const extras = pieces
+        .filter((piece) => piece.kind !== 5)
+        .sort((a, b) => b.kind - a.kind)
+        .map((piece) => piece.kind);
+    if (!extras.length)
+        return null;
+    const order = { 4: 'Q', 3: 'R', 2: 'B', 1: 'N' };
+    const id = `K${extras.map((kind) => order[kind]).join('')}K`;
+    const ending = loaded[id];
+    if (!ending)
+        return null;
+    const whiteKing = pieces.find((piece) => piece.kind === 5 && piece.side === 'white').square;
+    const blackKing = pieces.find((piece) => piece.kind === 5 && piece.side === 'black').square;
+    const extraSquares = extras.map((kind, i) => {
+        const candidates = pieces.filter((piece) => piece.kind === kind && piece.side === 'white').map((p) => p.square);
+        return candidates.sort((a, b) => a - b)[countBefore(extras, kind, i)];
+    });
+    let index = whiteKing;
+    for (const square of extraSquares)
+        index = index * 64 + square;
+    index = index * 64 + blackKing;
+    index = index * 2 + (state.turn === 'black' ? 1 : 0);
+    const value = ending.wdl[index];
+    if (value === 0)
+        return null;
+    const dtm = ending.dtm[index];
+    let outcome = value === 3 ? 'win' : value === 1 ? 'loss' : 'draw';
+    if (outcome !== 'draw' && dtm > 100 - halfmove)
+        outcome = 'draw';
+    return { outcome, dtm };
+}
+/** which same-kind extra this is: the nth occurrence takes the nth square */
+function countBefore(extras, kind, upto) {
+    let seen = 0;
+    for (let i = 0; i < upto; i++) {
+        if (extras[i] === kind)
+            seen++;
+    }
+    return seen;
+}
+//# sourceMappingURL=tablebase.js.map

package/dist/board/tablebase.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tablebase.js","sourceRoot":"","sources":["../../src/board/tablebase.ts"],"names":[],"mappings":"AAmDA,MAAM,YAAY,GAAmC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AACzG,MAAM,YAAY,GAAmC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;AACzG,MAAM,UAAU,GAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AAEzG;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,KAAuB;IAClD,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC1D,OAAO,IAAI,KAAK;SACd,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SACnC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;SACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;AACf,CAAC;AAED,MAAM,MAAM,GAAG,kEAAkE,CAAC;AAElF,SAAS,YAAY,CAAC,GAAe;IACpC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,GAAG,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1D,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACrE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAClD,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IACjC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACf,SAAS;QACV,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QACpG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,UAAU,CAAC,GAAe;IACzC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,GAAG;QAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACtG,MAAM,MAAM,GAAa,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;QACrD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;QACrD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IACD,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,OAAO;SACrB,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA4C,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,SAAS,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAE,CAAC,MAAM,CAAC;IACxF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC;IACxC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACnD,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;IACpD,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;IACpD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC;gBAAE,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACrF,GAAG,EAAE,CAAC;QACP,CAAC;IACF,CAAC;IACD,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,yEAAyE;AACzE,SAAS,cAAc,CAAC,MAAgB;IACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QAC1B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACd,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IAC9F,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,kFAAkF;AAClF,SAAS,cAAc,CAAC,OAAkD;IACzE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5F,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4C,CAAC;IACrE,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC;QACnC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3D,IAAI,EAAE,CAAC;QACP,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAE,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY;IACtC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACnF,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,KAAK,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC9F,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;IAC5B,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACpB,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QACvF,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACpB,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC/F,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/F,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IACnF,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/F,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IAMtC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACb,IAAI,GAAG;oBAAE,IAAI,CAAC,GAAG,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;;oBAC7C,IAAI,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACP,IAAI,GAAG;oBAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;;oBAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBACjC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAa,CAAC;YACjD,CAAC;QACF,CAAC;IACF,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,aAAa,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7B,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACrD,OAAO,QAAQ,GAAG,KAAK,EAAE,CAAC;QACzB,IAAI,GAAG,IAAI,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC9E,IAAI,IAAI,GAAa,IAAI,CAAC;QAC1B,SAAS,CAAC;YACT,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,GAAG,EAAE,CAAC;YACN,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAgB,CAAC;YACrD,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YACxE,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,MAAM;QACtC,CAAC;QACD,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,GAAG,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACnG,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,aAAa,CAAC,IAAY;IAClC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IACtF,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACrF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAqB;IACxD,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,+BAA+B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzG,IAAI,IAAI,CAAC,EAAE,KAAK,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,gCAAgC,CAAC,CAAC;IACrG,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,4BAA4B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACrC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAAE,SAAS,IAAI,EAAE,CAAC;IACjD,SAAS,IAAI,CAAC,CAAC;IACf,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;QAC/B,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,YAAY,IAAI,CAAC,SAAS,qBAAqB,SAAS,EAAE,CAAC,CAAC;IACvF,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;QAC3B,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,oBAAoB,GAAG,CAAC,MAAM,qBAAqB,SAAS,EAAE,CAAC,CAAC;IAC3F,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;QAC3B,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,yBAAyB,GAAG,CAAC,MAAM,oBAAoB,SAAS,EAAE,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC7D,OAAO;QACN,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,MAAM,EAAE,IAAI,CAAC,KAAK;aAChB,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;aACzC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACjC,SAAS;QACT,GAAG;QACH,GAAG;KACH,CAAC;AACH,CAAC;AAQD,SAAS,YAAY,CAAC,KAAiC;IACtD,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,GAAG,GAAkB,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,EAAE,EAAE,CAAC;gBACX,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACxB,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9F,EAAE,IAAI,MAAM,CAAC;YACd,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;QACrC,IAAI,KAAK;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,cAAc,CAAC,KAAiC;IACxD,IAAI,QAAQ,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC9B,OAAO,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,cAAc,CAAC;AACvG,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAC7B,MAAoC,EACpC,KAAiC,EACjC,QAAQ,GAAG,CAAC;IAEZ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAC;IACjH,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IACxF,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IACxF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IACpF,IAAI,cAAc,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM;SACnB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;SACnC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;SAC/B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAA4B,CAAC;IAC3E,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;IAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAE,CAAC,MAAM,CAAC;IAC7F,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAE,CAAC,MAAM,CAAC;IAC7F,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAChH,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,GAAG,SAAS,CAAC;IACtB,KAAK,MAAM,MAAM,IAAI,YAAY;QAAE,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG,MAAM,CAAC;IAC/D,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG,SAAS,CAAC;IAC/B,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,OAAO,GAA8B,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7F,IAAI,OAAO,KAAK,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,QAAQ;QAAE,OAAO,GAAG,MAAM,CAAC;IACjE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AACzB,CAAC;AAED,6EAA6E;AAE7E,SAAS,WAAW,CAAC,MAAgB,EAAE,IAAY,EAAE,IAAY;IAChE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,IAAI,EAAE,CAAC;IAChC,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/board/tourney.d.ts

@@ -0,0 +1,90 @@
+import type { BitboardMove, BitboardState } from './bitboard.ts';
+import type { ChessState } from './chess.ts';
+export interface TourneyOptions {
+    /** plies to search; the iterative deepener completes 1..depth while the budget lasts */
+    depth?: number;
+    /** hard cap on visited positions; the best completed iteration is returned past it */
+    maxNodes?: number;
+    /** soft wall-clock budget in milliseconds; checked every few thousand nodes */
+    timeMs?: number;
+    /** aborting stops the search at the next check and keeps the best completed iteration */
+    signal?: AbortSignal;
+}
+export interface TourneyAsyncOptions extends TourneyOptions {
+    /** root moves searched at once (default: hardware threads capped at 8, else 4) */
+    jobs?: number;
+}
+export interface TourneyResult {
+    /** the move to play, null only with no legal moves */
+    move: BitboardMove | null;
+    /** centipawns from the side to move's view; mate scores near 100000, adjusted by distance */
+    score: number;
+    /** positions visited, quiescence included */
+    nodes: number;
+    /** the deepest fully completed iteration */
+    depth: number;
+}
+/**
+ * The tournament engine's serializable task: a full iterative-deepening search over a
+ * bitboard position, with nothing outside its own body.
+ *
+ * `threads.spawn` rehydrates this function in a worker with `new Function`, so it may
+ * not reference imports, module scope, or any outer binding: every rule it touches is
+ * nested inside it. The main-thread wrappers call this same function directly, so the
+ * two sides cannot diverge the way a copied worker body could.
+ *
+ * What it does, per Roadmap item 390 phase 1: negamax alpha-beta with principal
+ * variation search, null-move pruning, late-move reductions, iterative deepening with
+ * aspiration windows, a bounded transposition table over Zobrist keys, quiescence over
+ * captures and promotions, ordering by hash move then MVV-LVA captures then killers
+ * then history, and a classical material plus in-house piece-square evaluation.
+ * Positions are plain bitboard data, so they structured-clone into a worker untouched.
+ *
+ * Draws: stalemate, fifty moves, KvK/KBvK/KNvK dead material, and repetition along the
+ * search path all score 0. Repetition only sees the path from the searched position,
+ * not the game before it; mate scores prefer the faster mate.
+ */
+export declare function tourneyThink(position: BitboardState, options?: {
+    depth?: number;
+    maxNodes?: number;
+    timeMs?: number;
+    signal?: AbortSignal;
+}): TourneyResult;
+/**
+ * Chooses a move with the tournament search: the same `tourneyThink` task the
+ * workers run, called directly, so one implementation serves both sides.
+ *
+ * This is the stronger engine beside `board/Engine`'s small deterministic one: the
+ * minigame path keeps the small search and never pays for this module. Scores are
+ * centipawns from the side to move's view; mate scores sit near 100000, adjusted so
+ * the faster mate scores higher.
+ *
+ * @example
+ * ```ts
+ * import { searchTourney, startingBitboard, tourneyThink } from '@datamoc/mw_games/board';
+ *
+ * const direct = tourneyThink(startingBitboard(), { depth: 1 });
+ * const result = searchTourney(startingBitboard(), { depth: 2 });
+ * console.log(direct.move !== null && result.move !== null); // true - the opening position always has legal moves
+ * ```
+ */
+export declare function searchTourney(state: ChessState | BitboardState, options?: TourneyOptions): TourneyResult;
+/**
+ * Chooses a move the way `searchTourney` does, but thinks on worker threads through
+ * `threads.spawn`, so a deep search does not drop the caller's frames. Each root move
+ * is a self-contained `tourneyThink` task over a structured-cloned bitboard, scored
+ * concurrently down a capped lane queue; the best child score from the opponent's
+ * view is the worst for us, so the root plays the move whose child scored lowest,
+ * with ties going to the earlier root move. An aborting signal rejects through
+ * `threads.spawn` and terminates the workers.
+ *
+ * @example
+ * ```ts
+ * import { searchTourneyAsync, startingBitboard } from '@datamoc/mw_games/board';
+ *
+ * const result = await searchTourneyAsync(startingBitboard(), { depth: 2 });
+ * console.log(result.move !== null); // true - the opening position always has legal moves
+ * ```
+ */
+export declare function searchTourneyAsync(state: ChessState | BitboardState, options?: TourneyAsyncOptions): Promise<TourneyResult>;
+//# sourceMappingURL=tourney.d.ts.map

package/dist/board/tourney.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tourney.d.ts","sourceRoot":"","sources":["../../src/board/tourney.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAG7C,MAAM,WAAW,cAAc;IAC9B,wFAAwF;IACxF,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+EAA+E;IAC/E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,yFAAyF;IACzF,MAAM,CAAC,EAAE,WAAW,CAAC;CACrB;AAED,MAAM,WAAW,mBAAoB,SAAQ,cAAc;IAC1D,kFAAkF;IAClF,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,aAAa;IAC7B,sDAAsD;IACtD,IAAI,EAAE,YAAY,GAAG,IAAI,CAAC;IAC1B,6FAA6F;IAC7F,KAAK,EAAE,MAAM,CAAC;IACd,6CAA6C;IAC7C,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,YAAY,CAC3B,QAAQ,EAAE,aAAa,EACvB,OAAO,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,WAAW,CAAA;CAAO,GACxF,aAAa,CAo0Bf;AAcD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,aAAa,CAO5G;AAuBD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,kBAAkB,CACvC,KAAK,EAAE,UAAU,GAAG,aAAa,EACjC,OAAO,GAAE,mBAAwB,GAC/B,OAAO,CAAC,aAAa,CAAC,CA+CxB"}