@datamoc/mw_games 0.43.0 → 0.45.0

package/dist/board/Tactics.js

@@ -1,305 +0,0 @@
-import { hexDistance, hexNeighbors } from '../core/Hex.js';
-/**
- * @example
- * ```ts
- * import { startingTactics } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * console.log(state.width, state.height, state.round); // 6 6 1
- * ```
- */
-export function startingTactics(width, height, shape = 'hex') {
-    if (width < 1 || height < 1)
-        throw new Error('a tactical map needs positive dimensions');
-    return {
-        width,
-        height,
-        shape,
-        cells: Array.from({ length: width * height }, () => ({ passable: true, cover: 0 })),
-        units: [],
-        turn: '',
-        round: 1,
-    };
-}
-/** whether a unit could be placed at (x, y) right now - on the map, and not already occupied
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, canPlaceTacticalUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- *
- * console.log(canPlaceTacticalUnit(state, 1, 1)); // true
- * console.log(canPlaceTacticalUnit(state, 0, 0)); // false - ranger is already there
- * ```
- */
-export function canPlaceTacticalUnit(state, x, y) {
-    return tacticalInside(state, x, y) && !occupied(state, x, y);
-}
-/**
- * Places a unit; the first unit added decides whose turn it is.
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * console.log(state.turn); // 'blue'
- * ```
- */
-export function addTacticalUnit(state, unit) {
-    if (!canPlaceTacticalUnit(state, unit.x, unit.y))
-        throw new Error('tactical unit cannot be placed there');
-    state.units.push({ ...unit, maxActions: unit.maxActions ?? unit.actions });
-    if (!state.turn)
-        state.turn = unit.owner;
-}
-/**
- * Every cell a unit can reach with its remaining action points, respecting terrain,
- * occupancy, and enemy zones of control.
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, tacticalMoves } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * addTacticalUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, actions: 2 });
- *
- * const moves = tacticalMoves(state, 'ranger');
- * console.log(moves.length, moves[0]); // 5 { unit: 'ranger', x: 1, y: 0, cost: 1 }
- * ```
- */
-export function tacticalMoves(state, unitId) {
-    const unit = getUnit(state, unitId);
-    if (unit.owner !== state.turn || unit.actions <= 0)
-        return [];
-    //computed once per call rather than once per candidate cell - tacticalPathCost used to
-    //redo this same enemy scan and neighbour allocation for every one of the up to width*height
-    //cells below, which is pure repeated work: neither depends on the candidate destination
-    const engaged = tacticalEngaged(state, unit);
-    const zone = tacticalZone(state, unit, engaged);
-    const out = [];
-    for (let y = 0; y < state.height; y++)
-        for (let x = 0; x < state.width; x++) {
-            if ((x === unit.x && y === unit.y) || !state.cells[y * state.width + x].passable || occupied(state, x, y))
-                continue;
-            const cost = tacticalPathCost(state, unit, x, y, unit.actions, zone);
-            if (cost !== null)
-                out.push({ unit: unitId, x, y, cost });
-        }
-    return out;
-}
-/**
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, tacticalMoves, moveTacticalUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * addTacticalUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, actions: 2 });
- *
- * moveTacticalUnit(state, tacticalMoves(state, 'ranger')[0]);
- * console.log(state.units.find((unit) => unit.id === 'ranger')); // { ..., x: 1, y: 0, actions: 1 }
- * ```
- */
-export function moveTacticalUnit(state, move) {
-    const legal = tacticalMoves(state, move.unit).find((candidate) => candidate.x === move.x && candidate.y === move.y);
-    if (!legal)
-        throw new Error('illegal tactical move');
-    const unit = getUnit(state, move.unit);
-    unit.x = move.x;
-    unit.y = move.y;
-    unit.actions -= legal.cost;
-}
-/**
- * Spends the rest of a unit's turn watching, so it can react through
- * `triggerTacticalOverwatch` when an enemy moves nearby.
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, setTacticalOverwatch } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- *
- * setTacticalOverwatch(state, 'ranger');
- * console.log(state.units[0].overwatch); // true
- * ```
- */
-export function setTacticalOverwatch(state, unitId) {
-    const unit = getUnit(state, unitId);
-    if (unit.owner !== state.turn || unit.actions <= 0)
-        throw new Error('only an active unit can enter overwatch');
-    unit.actions = 0;
-    unit.overwatch = true;
-}
-/**
- * Fires every enemy overwatch reaction in range of the moving unit.
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, setTacticalOverwatch, endTacticalTurn, triggerTacticalOverwatch } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 1, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * addTacticalUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * setTacticalOverwatch(state, 'ranger');
- * endTacticalTurn(state);
- *
- * const reactions = triggerTacticalOverwatch(state, 'raider', 4); // raider steps into range
- * console.log(reactions); // [{ attacker: 'ranger', defender: 'raider', damage: 4, cover: 0, killed: false }]
- * ```
- */
-export function triggerTacticalOverwatch(state, movingUnitId, damage) {
-    const moving = getUnit(state, movingUnitId);
-    const reactions = [];
-    for (const watcher of [...state.units]) {
-        if (!watcher.overwatch || watcher.owner === moving.owner || tacticalDistance(state, watcher, moving) > 3)
-            continue;
-        const cover = state.cells[moving.y * state.width + moving.x].cover ?? 0;
-        const dealt = Math.max(0, damage - cover);
-        moving.hp = Math.max(0, moving.hp - dealt);
-        watcher.overwatch = false;
-        reactions.push({ attacker: watcher.id, defender: moving.id, damage: dealt, cover, killed: moving.hp === 0 });
-        if (moving.hp === 0) {
-            state.units = state.units.filter((unit) => unit !== moving);
-            break;
-        }
-    }
-    return reactions;
-}
-/**
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, endTacticalTurn, tacticalAttack } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * addTacticalUnit(state, { id: 'raider', owner: 'red', x: 1, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * endTacticalTurn(state); // it's blue's turn until someone ends it
- *
- * const result = tacticalAttack(state, 'raider', 'ranger', 3);
- * console.log(result); // { attacker: 'raider', defender: 'ranger', damage: 3, cover: 0, killed: false }
- * ```
- */
-export function tacticalAttack(state, attackerId, defenderId, damage) {
-    const attacker = getUnit(state, attackerId);
-    const defender = getUnit(state, defenderId);
-    if (attacker.owner !== state.turn || attacker.owner === defender.owner)
-        throw new Error('invalid tactical attack');
-    if (tacticalDistance(state, attacker, defender) > 3)
-        throw new Error('tactical target is out of range');
-    const cover = state.cells[defender.y * state.width + defender.x].cover ?? 0;
-    const dealt = Math.max(0, damage - cover);
-    defender.hp = Math.max(0, defender.hp - dealt);
-    const killed = defender.hp === 0;
-    if (killed)
-        state.units = state.units.filter((unit) => unit !== defender);
-    return { attacker: attackerId, defender: defenderId, damage: dealt, cover, killed };
-}
-/**
- * Hands the turn to the next owner with units on the board, refreshing their action points
- * and clearing overwatch.
- *
- * @example
- * ```ts
- * import { startingTactics, addTacticalUnit, endTacticalTurn } from '@datamoc/mw_games/board';
- *
- * const state = startingTactics(6, 6, 'square');
- * addTacticalUnit(state, { id: 'ranger', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, actions: 2 });
- * addTacticalUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, actions: 2 });
- *
- * endTacticalTurn(state);
- * console.log(state.turn, state.round); // 'red' 1
- * ```
- */
-export function endTacticalTurn(state) {
-    const owners = [...new Set(state.units.map((unit) => unit.owner))];
-    if (owners.length === 0)
-        return;
-    const next = owners.indexOf(state.turn) + 1;
-    if (next >= owners.length)
-        state.round++;
-    state.turn = owners[next % owners.length];
-    for (const unit of state.units)
-        if (unit.owner === state.turn) {
-            unit.actions = unit.maxActions ?? unit.actions;
-            unit.overwatch = false;
-        }
-}
-function getUnit(state, id) {
-    const unit = state.units.find((candidate) => candidate.id === id);
-    if (!unit)
-        throw new Error(`unknown tactical unit "${id}"`);
-    return unit;
-}
-function occupied(state, x, y) {
-    return state.units.some((unit) => unit.x === x && unit.y === y);
-}
-function tacticalInside(state, x, y) {
-    return x >= 0 && y >= 0 && x < state.width && y < state.height;
-}
-function tacticalNeighbours(state, x, y) {
-    return state.shape === 'hex'
-        ? hexNeighbors(x, y)
-        : [
-            { x: x - 1, y },
-            { x: x + 1, y },
-            { x, y: y - 1 },
-            { x, y: y + 1 },
-        ];
-}
-function tacticalDistance(state, a, b) {
-    return state.shape === 'hex' ? hexDistance(a, b) : Math.abs(a.x - b.x) + Math.abs(a.y - b.y);
-}
-//enemies already adjacent to the unit before it moves - engaging one already lifts its zone
-function tacticalEngaged(state, unit) {
-    return new Set(state.units
-        .filter((other) => other.owner !== unit.owner &&
-        tacticalNeighbours(state, unit.x, unit.y).some((cell) => cell.x === other.x && cell.y === other.y))
-        .map((other) => other.id));
-}
-//cells adjacent to an enemy the unit is not already engaged with - stepping into one uses up
-//the rest of a move (standard zone-of-control), though it can still be entered as a final stop
-function tacticalZone(state, unit, engaged) {
-    const zone = new Set();
-    for (const enemy of state.units) {
-        if (enemy.owner === unit.owner || engaged.has(enemy.id))
-            continue;
-        for (const cell of tacticalNeighbours(state, enemy.x, enemy.y))
-            zone.add(`${cell.x},${cell.y}`);
-    }
-    return zone;
-}
-//the real walking distance to (targetX, targetY), never exceeding `budget` steps, or null if
-//it cannot be reached within that budget - a move's true cost, not straight-line distance.
-//`zone` is precomputed once by the caller (see tacticalMoves) rather than recomputed here on
-//every call, since neither depends on the candidate target; a plain index cursor stands in
-//for `todo.shift()`, which is O(n) per pop and would make this BFS quadratic in path length
-function tacticalPathCost(state, unit, targetX, targetY, budget, zone) {
-    const todo = [{ x: unit.x, y: unit.y, distance: 0 }];
-    let head = 0;
-    const seen = new Set([`${unit.x},${unit.y}`]);
-    while (head < todo.length) {
-        const current = todo[head++];
-        if (current.x === targetX && current.y === targetY)
-            return current.distance;
-        if (current.distance >= budget || (current.distance > 0 && zone.has(`${current.x},${current.y}`)))
-            continue;
-        for (const next of tacticalNeighbours(state, current.x, current.y)) {
-            const key = `${next.x},${next.y}`;
-            if (!tacticalInside(state, next.x, next.y) ||
-                seen.has(key) ||
-                !state.cells[next.y * state.width + next.x].passable ||
-                (occupied(state, next.x, next.y) && !(next.x === targetX && next.y === targetY)))
-                continue;
-            seen.add(key);
-            todo.push({ x: next.x, y: next.y, distance: current.distance + 1 });
-        }
-    }
-    return null;
-}
-//# sourceMappingURL=Tactics.js.map

package/dist/board/Tactics.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Tactics.js","sourceRoot":"","sources":["../../src/board/Tactics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAkF3D;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,MAAc,EAAE,KAAK,GAAkB,KAAK;IAC1F,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IACzF,OAAO;QACN,KAAK;QACL,MAAM;QACN,KAAK;QACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACnF,KAAK,EAAE,EAAE;QACT,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,CAAC;KACR,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC9E,OAAO,cAAc,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,KAAoB,EAAE,IAAkB;IACvE,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1G,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3E,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,aAAa,CAAC,KAAoB,EAAE,MAAc;IACjE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9D,uFAAuF;IACvF,4FAA4F;IAC5F,wFAAwF;IACxF,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAChD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxG,SAAS;YACV,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACrE,IAAI,IAAI,KAAK,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3D,CAAC;IACF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAoB,EAAE,IAAkB;IACxE,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IACpH,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAoB,EAAE,MAAc;IACxE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC/G,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACjB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAoB,EAAE,YAAoB,EAAE,MAAc;IAClG,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAqB,EAAE,CAAC;IACvC,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC;YACvG,SAAS;QACV,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC;QAC1B,SAAS,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC7G,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACrB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;YAC5D,MAAM;QACP,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAC7B,KAAoB,EACpB,UAAkB,EAClB,UAAkB,EAClB,MAAc;IAEd,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,QAAQ,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnH,IAAI,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACxG,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;IAC1C,QAAQ,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,IAAI,MAAM;QAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IAC1E,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACrF,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,eAAe,CAAC,KAAoB;IACnD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,IAAI,IAAI,MAAM,CAAC,MAAM;QAAE,KAAK,CAAC,KAAK,EAAE,CAAC;IACzC,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;QAC7B,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC;YAC/C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACxB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB,EAAE,EAAU;IAChD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAClE,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,EAAE,GAAG,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC;AACb,CAAC;AACD,SAAS,QAAQ,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC3D,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACjE,CAAC;AACD,SAAS,cAAc,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IACjE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;AAChE,CAAC;AACD,SAAS,kBAAkB,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IACrE,OAAO,KAAK,CAAC,KAAK,KAAK,KAAK;QAC3B,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC,CAAC;YACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACf,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACf,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YACf,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;SACf,CAAC;AACL,CAAC;AACD,SAAS,gBAAgB,CAAC,KAAoB,EAAE,CAA2B,EAAE,CAA2B;IACvG,OAAO,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9F,CAAC;AACD,4FAA4F;AAC5F,SAAS,eAAe,CAAC,KAAoB,EAAE,IAAkB;IAChE,OAAO,IAAI,GAAG,CACb,KAAK,CAAC,KAAK;SACT,MAAM,CACN,CAAC,KAAK,EAAE,EAAE,CACT,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK;QAC1B,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CACnG;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAC1B,CAAC;AACH,CAAC;AACD,6FAA6F;AAC7F,+FAA+F;AAC/F,SAAS,YAAY,CAAC,KAAoB,EAAE,IAAkB,EAAE,OAAoB;IACnF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,SAAS;QAClE,KAAK,MAAM,IAAI,IAAI,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AACD,6FAA6F;AAC7F,2FAA2F;AAC3F,6FAA6F;AAC7F,2FAA2F;AAC3F,4FAA4F;AAC5F,SAAS,gBAAgB,CACxB,KAAoB,EACpB,IAAkB,EAClB,OAAe,EACf,OAAe,EACf,MAAc,EACd,IAAiB;IAEjB,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;IACrD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7B,IAAI,OAAO,CAAC,CAAC,KAAK,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC,QAAQ,CAAC;QAC5E,IAAI,OAAO,CAAC,QAAQ,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,SAAS;QAC5G,KAAK,MAAM,IAAI,IAAI,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YAClC,IACC,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBACb,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ;gBACpD,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,OAAO,IAAI,IAAI,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC;gBAEhF,SAAS;YACV,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;IACF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/board/bitboard.d.ts

@@ -1,132 +0,0 @@
-import { type ChessSide, type ChessState, type PromotionKind } from './chess.ts';
-/**
- * Chess on bitboards: the first slice of the tournament engine (item 390).
- *
- * Twelve 64-bit boards (`pieces[color * 6 + kind]`, white 0-5, black 6-11, square 0 is
- * a1 exactly like `chess.ts`), side to move, castling rights, en passant square, the
- * halfmove clock and both king squares. Everything in it is plain data (`bigint`
- * included), so a position structured-clones into a worker untouched.
- *
- * Two implementations of the rules now exist on purpose: `chess.ts` is the readable
- * reference a minigame runs directly, this one is the fast mutable board a search
- * makes and unmakes millions of times. `tests/board-bitboard.test.ts` keeps them
- * honest two ways: every legal move of one is a legal move of the other on a suite of
- * positions, and perft counts match the published node counts.
- */
-export interface BitboardState {
-    /** twelve bitboards: white pawn..king, then black pawn..king */
-    pieces: bigint[];
-    turn: ChessSide;
-    /** castling rights as a mask: 1 white kingside, 2 white queenside, 4 black kingside, 8 black queenside */
-    castling: number;
-    /** a square a pawn could capture onto, left behind by a double push */
-    enPassant: number | null;
-    halfmove: number;
-    /** king squares, white then black: maintained on every move, so checks never scan */
-    kings: [number, number];
-}
-export interface BitboardMove {
-    from: number;
-    to: number;
-    promotion?: PromotionKind;
-}
-/** everything `makeMove` changes besides the moved piece, handed back to `unmakeMove` */
-export interface BitboardUndo {
-    captured: {
-        color: 0 | 1;
-        kind: number;
-    } | null;
-    castling: number;
-    enPassant: number | null;
-    halfmove: number;
-    kingSquare: number;
-}
-/**
- * Reads a `chess.ts` position onto bitboards: the bridge the differential tests cross
- * in both directions, and the way a FEN reaches the fast board.
- *
- * @example
- * ```ts
- * import { bitboardFromChess, bitboardMoves, startingChess } from '@datamoc/mw_games/board';
- *
- * const moves = bitboardMoves(bitboardFromChess(startingChess()));
- * console.log(moves.length); // 20 - the opening position's own count
- * ```
- */
-export declare function bitboardFromChess(state: ChessState): BitboardState;
-/**
- * The standard opening array on bitboards, white to move with every right intact.
- *
- * @example
- * ```ts
- * import { bitboardMoves, startingBitboard } from '@datamoc/mw_games/board';
- *
- * console.log(bitboardMoves(startingBitboard()).length); // 20 - 16 pawn moves, 4 knight moves
- * ```
- */
-export declare function startingBitboard(): BitboardState;
-/**
- * Every legal move for the side to play, in stable square order: pseudo-moves that leave
- * their own king safe, each tried with `makeMove` and taken back with `unmakeMove`.
- * Castling needs its rights, an empty passage and no check on the way over; en passant
- * pins fall out of the make-and-test filter rather than special-casing.
- *
- * @example
- * ```ts
- * import { bitboardMoves, startingBitboard } from '@datamoc/mw_games/board';
- *
- * const moves = bitboardMoves(startingBitboard());
- * console.log(moves.every((move) => move.from >= 0 && move.to < 64)); // true
- * ```
- */
-export declare function bitboardMoves(board: BitboardState): BitboardMove[];
-/**
- * Plays a move, mutating the position, and returns what `unmakeMove` needs to take it
- * back. Special moves are read off the position rather than flagged on the move: a pawn
- * onto the en passant square captures the pawn behind it, a king stepping two squares
- * swings its rook, a pawn stride of sixteen leaves a square behind it.
- *
- * @example
- * ```ts
- * import { bitboardMoves, makeMove, startingBitboard, unmakeMove } from '@datamoc/mw_games/board';
- *
- * const board = startingBitboard();
- * const move = bitboardMoves(board)[0];
- * const undo = makeMove(board, move);
- * console.log(board.turn); // 'black' - the move is played
- * unmakeMove(board, move, undo);
- * ```
- */
-export declare function makeMove(board: BitboardState, move: BitboardMove): BitboardUndo;
-/**
- * Takes back exactly what `makeMove` played: the mover returns, the taken piece (or the
- * en passant pawn behind the landing square) is restored, and rights, en passant
- * square, halfmove clock and king square come back from the undo.
- *
- * @example
- * ```ts
- * import { bitboardMoves, makeMove, startingBitboard, unmakeMove } from '@datamoc/mw_games/board';
- *
- * const board = startingBitboard();
- * const move = bitboardMoves(board)[0];
- * const undo = makeMove(board, move);
- * unmakeMove(board, move, undo);
- * console.log(board.turn, bitboardMoves(board).length); // 'white' 20 - taken back whole
- * ```
- */
-export declare function unmakeMove(board: BitboardState, move: BitboardMove, undo: BitboardUndo): void;
-/**
- * Move-generation node count: 1 at depth 0, else the sum over every legal move. The
- * position is played and taken back as it goes, so it reads identical afterwards.
- * Counts match the published perft numbers, which is the whole point: a wrong move
- * generator cannot hide from them.
- *
- * @example
- * ```ts
- * import { perft, startingBitboard } from '@datamoc/mw_games/board';
- *
- * console.log(perft(startingBitboard(), 2)); // 400 - the opening's two-ply count
- * ```
- */
-export declare function perft(board: BitboardState, depth: number): number;
-//# sourceMappingURL=bitboard.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bitboard.d.ts","sourceRoot":"","sources":["../../src/board/bitboard.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiC,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhH;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,aAAa;IAC7B,gEAAgE;IAChE,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,IAAI,EAAE,SAAS,CAAC;IAChB,0GAA0G;IAC1G,QAAQ,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,qFAAqF;IACrF,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxB;AAED,MAAM,WAAW,YAAY;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,CAAC,EAAE,aAAa,CAAC;CAC1B;AAED,yFAAyF;AACzF,MAAM,WAAW,YAAY;IAC5B,QAAQ,EAAE;QAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAChD,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACnB;AA6HD;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,UAAU,GAAG,aAAa,CAsBlE;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,IAAI,aAAa,CAEhD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,YAAY,EAAE,CA0BlE;AAyHD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,YAAY,CAyD/E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAiC7F;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUjE"}