tscommons-esm-algorithms 0.0.2

package/dist/classes/astar-maze-search.d.mts

@@ -0,0 +1,18 @@
+import { ECommonsAlgorithmMazeHeuristic } from '../enums/emaze-heuristic.mjs';
+import { TCommonsAlgorithmSearchDimensionMazeCell, TCommonsAlgorithmSearchDimensionMazeNode } from '../types/tmaze-search-node.mjs';
+import { CommonsAlgorithmAStarSearch } from './astar-search.mjs';
+export declare class CommonsAlgorithmAStarMazeSearch<DimT extends number[], CellT extends TCommonsAlgorithmSearchDimensionMazeCell<DimT>> extends CommonsAlgorithmAStarSearch<DimT, TCommonsAlgorithmSearchDimensionMazeNode<DimT>> {
+    private goal;
+    private heuristicMethod;
+    private weightedCells;
+    private weightedCellsCache;
+    private min;
+    private max;
+    constructor(cells: CellT[], allActions: DimT[], goal: DimT, heuristicMethod: ECommonsAlgorithmMazeHeuristic);
+    protected isGoal(node: TCommonsAlgorithmSearchDimensionMazeNode<DimT>): boolean;
+    private getCache;
+    protected greedyBestFirstHeuristic(node: TCommonsAlgorithmSearchDimensionMazeNode<DimT>): number;
+    protected stepCost(node: TCommonsAlgorithmSearchDimensionMazeNode<DimT>): number;
+    protected isEqual(a: TCommonsAlgorithmSearchDimensionMazeNode<DimT>, b: TCommonsAlgorithmSearchDimensionMazeNode<DimT>): boolean;
+    protected applyActionIfPossible(node: TCommonsAlgorithmSearchDimensionMazeNode<DimT>, action: DimT): (TCommonsAlgorithmSearchDimensionMazeNode<DimT>) | undefined;
+}

package/dist/classes/astar-maze-search.mjs

@@ -0,0 +1,134 @@
+import { ECommonsAlgorithmMazeHeuristic } from '../enums/emaze-heuristic.mjs';
+import { CommonsAlgorithmAStarSearch } from './astar-search.mjs';
+function dimensionCacheIndex(coord) {
+    let index = '';
+    for (const n of coord)
+        index += n.toString() + ':';
+    return index;
+}
+function isDimensionValueEqual(a, b) {
+    for (let i = a.length; i-- > 0;) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+export class CommonsAlgorithmAStarMazeSearch extends CommonsAlgorithmAStarSearch {
+    goal;
+    heuristicMethod;
+    weightedCells = [];
+    weightedCellsCache = new Map();
+    min;
+    max;
+    constructor(cells, allActions, goal, heuristicMethod) {
+        super(allActions, true);
+        this.goal = goal;
+        this.heuristicMethod = heuristicMethod;
+        let min;
+        let max;
+        for (const cell of cells) {
+            if (!min) {
+                min = [...cell.coord];
+            }
+            else {
+                for (let i = cell.coord.length; i-- > 0;)
+                    min[i] = Math.min(min[i], cell.coord[i]);
+            }
+            if (!max) {
+                max = [...cell.coord];
+            }
+            else {
+                for (let i = cell.coord.length; i-- > 0;)
+                    max[i] = Math.max(max[i], cell.coord[i]);
+            }
+        }
+        if (!min || !max)
+            throw new Error('No min/max determinable');
+        this.min = min;
+        this.max = max;
+        for (const cell of cells) {
+            const ds = cell.coord
+                .map((t, i) => t - goal[i]);
+            let weight;
+            switch (this.heuristicMethod) {
+                case ECommonsAlgorithmMazeHeuristic.MANHATTEN:
+                    weight = 0;
+                    for (let i = ds.length; i-- > 0;)
+                        weight += Math.abs(ds[i]);
+                    break;
+                case ECommonsAlgorithmMazeHeuristic.PYTHAGORAS:
+                    weight = 0;
+                    for (let i = ds.length; i-- > 0;)
+                        weight += Math.pow(ds[i], 2);
+                    weight = Math.sqrt(weight);
+                    break;
+            }
+            this.weightedCells.push({
+                ...cell,
+                coord: [...cell.coord],
+                visitable: cell.visitable,
+                costToVisit: cell.costToVisit,
+                permittedActions: cell.permittedActions,
+                weight: weight
+            });
+        }
+        for (const cell of this.weightedCells) {
+            this.weightedCellsCache.set(dimensionCacheIndex(cell.coord), cell);
+        }
+    }
+    isGoal(node) {
+        return isDimensionValueEqual(node.coord, this.goal);
+    }
+    getCache(coord) {
+        const index = dimensionCacheIndex(coord);
+        return this.weightedCellsCache.get(index);
+    }
+    greedyBestFirstHeuristic(node) {
+        const cell = this.getCache(node.coord);
+        if (!cell)
+            throw new Error('No such cell exists');
+        return cell.weight;
+    }
+    stepCost(node) {
+        const cell = this.getCache(node.coord);
+        if (!cell)
+            throw new Error('No such cell exists');
+        return cell.costToVisit === undefined ? 1 : cell.costToVisit;
+    }
+    isEqual(a, b) {
+        return isDimensionValueEqual(a.coord, b.coord);
+    }
+    applyActionIfPossible(node, action) {
+        const coord = [...node.coord];
+        const current = this.getCache(coord);
+        if (!current)
+            return undefined;
+        const available = (current.permittedActions || [])
+            .find((permitted) => {
+            for (let i = permitted.length; i-- > 0;) {
+                if (permitted[i] !== action[i])
+                    return false;
+            }
+            return true;
+        });
+        if (!available)
+            return undefined;
+        for (let i = coord.length; i-- > 0;) {
+            coord[i] += available[i];
+            if (coord[i] <= this.min[i])
+                return undefined;
+            if (coord[i] >= this.max[i])
+                return undefined;
+        }
+        const cell = this.getCache(coord);
+        if (!cell)
+            return undefined;
+        if (!cell.visitable)
+            return undefined;
+        return {
+            action: available,
+            coord: cell.coord
+        };
+    }
+}
+//# sourceMappingURL=astar-maze-search.mjs.map

package/dist/classes/astar-maze-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"astar-maze-search.mjs","sourceRoot":"","sources":["../../src/classes/astar-maze-search.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,8BAA8B,EAAE,MAAM,8BAA8B,CAAC;AAI9E,OAAO,EAAE,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AAMjE,SAAS,mBAAmB,CAAwB,KAAW;IAC9D,IAAI,KAAK,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC;IAEnD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,qBAAqB,CAAwB,CAAO,EAAE,CAAO;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;QACjC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACjC,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED,MAAM,OAAO,+BAGX,SAAQ,2BAAiF;IAUhF;IACA;IAVF,aAAa,GAAiD,EAAE,CAAC;IACjE,kBAAkB,GAA4D,IAAI,GAAG,EAAsD,CAAC;IAE5I,GAAG,CAAO;IACV,GAAG,CAAO;IAElB,YACE,KAAc,EACd,UAAkB,EACV,IAAU,EACV,eAA+C;QAExD,KAAK,CACH,UAAU,EACV,IAAI,CACL,CAAC;QANO,SAAI,GAAJ,IAAI,CAAM;QACV,oBAAe,GAAf,eAAe,CAAgC;QAOxD,IAAI,GAAmB,CAAC;QACxB,IAAI,GAAmB,CAAC;QAExB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACV,GAAG,GAAG,CAAE,GAAG,IAAI,CAAC,KAAK,CAAU,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACP,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC;oBAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;gBACV,GAAG,GAAG,CAAE,GAAG,IAAI,CAAC,KAAK,CAAU,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACP,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC;oBAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAE7D,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAa,IAAI,CAAC,KAAK;iBAC5B,GAAG,CAAC,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtD,IAAI,MAAwB,CAAC;YAC7B,QAAQ,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC9B,KAAK,8BAA8B,CAAC,SAAS;oBAC5C,MAAM,GAAG,CAAC,CAAC;oBACX,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC;wBAAG,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5D,MAAM;gBACP,KAAK,8BAA8B,CAAC,UAAU;oBAC7C,MAAM,GAAG,CAAC,CAAC;oBACX,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC;wBAAG,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/D,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC3B,MAAM;YACR,CAAC;YAED,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;gBACtB,GAAG,IAAI;gBACP,KAAK,EAAE,CAAE,GAAG,IAAI,CAAC,KAAK,CAAU;gBAChC,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;gBACvC,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QACpE,CAAC;IACF,CAAC;IAEkB,MAAM,CAAC,IAAoD;QAC7E,OAAO,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;IAEO,QAAQ,CAAC,KAAW;QAC3B,MAAM,KAAK,GAAW,mBAAmB,CAAO,KAAK,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAEkB,wBAAwB,CAAC,IAAoD;QAC/F,MAAM,IAAI,GAA+C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnF,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAElD,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAEkB,QAAQ,CAAC,IAAoD;QAC/E,MAAM,IAAI,GAA+C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnF,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAElD,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;IAC9D,CAAC;IAEkB,OAAO,CAAC,CAAiD,EAAE,CAAiD;QAC9H,OAAO,qBAAqB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAEkB,qBAAqB,CAAC,IAAoD,EAAG,MAAY;QAC3G,MAAM,KAAK,GAAS,CAAE,GAAG,IAAI,CAAC,KAAK,CAAU,CAAC;QAE9C,MAAM,OAAO,GAA6D,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC/F,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAE/B,MAAM,SAAS,GAAmB,CAAC,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;aAC/D,IAAI,CAAC,CAAC,SAAe,EAAW,EAAE;YAClC,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;gBACzC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC9C,CAAC;YACD,OAAO,IAAI,CAAC;QACb,CAAC,CAAC,CAAC;QACL,IAAI,CAAC,SAAS;YAAE,OAAO,SAAS,CAAC;QAEjC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;YACrC,KAAK,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;YAEzB,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC9C,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,SAAS,CAAC;QAC/C,CAAC;QAED,MAAM,IAAI,GAA6D,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5F,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO,SAAS,CAAC;QAEtC,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;IACH,CAAC;CACD"}

package/dist/classes/astar-search.d.mts

@@ -0,0 +1,17 @@
+import { TCommonsAlgorithmSearchNode } from '../types/tsearch-node.mjs';
+import { CommonsAlgorithmGreedyBestFirstSearch as CommonsAlgorithmGreedyBestFirstSearch } from './greedy-best-first-search.mjs';
+import { TCommonsAlgorithmInternalNode } from './search.mjs';
+export type TCommonsAlgorithmInternalStepCostNode<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> = TCommonsAlgorithmInternalNode<ActionT, NodeT> & {
+    stepCost: number;
+};
+type TStepCostInternalNode<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> = TCommonsAlgorithmInternalNode<ActionT, NodeT> & {
+    stepCost: number;
+};
+export declare abstract class CommonsAlgorithmAStarSearch<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> extends CommonsAlgorithmGreedyBestFirstSearch<ActionT, NodeT> {
+    protected abstract greedyBestFirstHeuristic(node: NodeT): number;
+    protected heuristic(node: NodeT): number;
+    protected stepCost(_node: NodeT): number;
+    protected transition(node: TStepCostInternalNode<ActionT, NodeT>, action: ActionT): TStepCostInternalNode<ActionT, NodeT> | undefined;
+    computeRoute(start: Omit<NodeT, 'action'>, progressCallback?: (frontierLength: number, exploredLength: number) => void, progressBlockSize?: number): NodeT[] | undefined;
+}
+export {};

package/dist/classes/astar-search.mjs

@@ -0,0 +1,32 @@
+import { CommonsAlgorithmGreedyBestFirstSearch as CommonsAlgorithmGreedyBestFirstSearch } from './greedy-best-first-search.mjs';
+import { commonsAlgorithmDeInternalise } from './search.mjs';
+function commonsAlgorithmDeInternaliseStepCost(node) {
+    const clone = commonsAlgorithmDeInternalise(node);
+    delete clone['stepCost'];
+    return clone;
+}
+export class CommonsAlgorithmAStarSearch extends CommonsAlgorithmGreedyBestFirstSearch {
+    heuristic(node) {
+        return node.stepCost + this.greedyBestFirstHeuristic(node);
+    }
+    stepCost(_node) {
+        return 1;
+    }
+    transition(node, action) {
+        const applied = super.transition(node, action);
+        if (!applied)
+            return undefined;
+        const stepCost = this.stepCost(commonsAlgorithmDeInternaliseStepCost(applied));
+        return {
+            ...applied,
+            stepCost: node.stepCost + stepCost
+        };
+    }
+    computeRoute(start, progressCallback, progressBlockSize = 10) {
+        return super.computeRoute({
+            ...start,
+            stepCost: 0
+        }, progressCallback, progressBlockSize);
+    }
+}
+//# sourceMappingURL=astar-search.mjs.map

package/dist/classes/astar-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"astar-search.mjs","sourceRoot":"","sources":["../../src/classes/astar-search.mts"],"names":[],"mappings":"AAIA,OAAO,EAAE,qCAAqC,IAAI,qCAAqC,EAAE,MAAM,gCAAgC,CAAC;AAChI,OAAO,EAAiC,6BAA6B,EAAE,MAAM,cAAc,CAAC;AAgB5F,SAAS,qCAAqC,CAI5C,IAAmB;IACpB,MAAM,KAAK,GAAU,6BAA6B,CAAC,IAAI,CAAC,CAAC;IACzD,OAAQ,KAAyB,CAAC,UAAU,CAAC,CAAC;IAE9C,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,OAAgB,2BAGpB,SAAQ,qCAAqD;IAGpD,SAAS,CAAC,IAAW;QAC9B,OAAQ,IAAgE,CAAC,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;IACzH,CAAC;IAES,QAAQ,CAAC,KAAY;QAC9B,OAAO,CAAC,CAAC;IACV,CAAC;IAEkB,UAAU,CAC3B,IAA2C,EAC3C,MAAe;QAEhB,MAAM,OAAO,GAAoD,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAoD,CAAC;QACnJ,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAE/B,MAAM,QAAQ,GAAW,IAAI,CAAC,QAAQ,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC,CAAC;QAEvF,OAAO;YACL,GAAG,OAAO;YACV,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ;SACnC,CAAC;IACH,CAAC;IAEe,YAAY,CAC1B,KAA4B,EAC5B,gBAA2E,EAC3E,oBAA4B,EAAE;QAE/B,OAAO,KAAK,CAAC,YAAY,CACvB;YACE,GAAG,KAAK;YACR,QAAQ,EAAE,CAAC;SACuF,EACpG,gBAAgB,EAChB,iBAAiB,CAClB,CAAC;IACH,CAAC;CACD"}

package/dist/classes/binary-winner-mini-max.d.mts

@@ -0,0 +1,25 @@
+import { ECommonsAlgorithmBinaryPlayer } from '../enums/ebinary-player.mjs';
+export type TCommonsAlgorithmBinaryWinnerMiniMaxPlayer = ECommonsAlgorithmBinaryPlayer;
+export type TCommonsAlgorithmBinaryPlay<ActionT> = {
+    player: TCommonsAlgorithmBinaryWinnerMiniMaxPlayer;
+    action: ActionT;
+};
+export declare abstract class CommonsAlgorithmBinaryWinnerMiniMax<ActionT, StateT> {
+    private state;
+    constructor(state: StateT);
+    protected abstract player(state: StateT): TCommonsAlgorithmBinaryWinnerMiniMaxPlayer;
+    protected abstract actions(state: StateT, player: TCommonsAlgorithmBinaryWinnerMiniMaxPlayer): ActionT[];
+    protected abstract clone(state: StateT): StateT;
+    protected abstract applyAction(state: StateT, player: TCommonsAlgorithmBinaryWinnerMiniMaxPlayer, action: ActionT): StateT;
+    private result;
+    protected abstract isWon(state: StateT, player: TCommonsAlgorithmBinaryWinnerMiniMaxPlayer): boolean;
+    protected abstract isDraw(state: StateT): boolean;
+    private winner;
+    private isTerminal;
+    private utility;
+    private minimaxMax;
+    private minimaxMin;
+    private minimax;
+    get currentState(): StateT;
+    next(): TCommonsAlgorithmBinaryPlay<ActionT> | undefined;
+}

package/dist/classes/binary-winner-mini-max.mjs

@@ -0,0 +1,100 @@
+import { ECommonsAlgorithmBinaryPlayer } from '../enums/ebinary-player.mjs';
+export class CommonsAlgorithmBinaryWinnerMiniMax {
+    state;
+    constructor(state) {
+        this.state = state;
+    }
+    result(state, player, action) {
+        const clone = this.clone(state);
+        this.applyAction(clone, player, action);
+        return clone;
+    }
+    winner(state) {
+        for (const player of [ECommonsAlgorithmBinaryPlayer.A, ECommonsAlgorithmBinaryPlayer.B]) {
+            if (this.isWon(state, player))
+                return player;
+        }
+        return undefined;
+    }
+    isTerminal(state) {
+        if (this.isDraw(state))
+            return true;
+        if (this.winner(state) !== undefined)
+            return true;
+        return false;
+    }
+    utility(state) {
+        const won = this.winner(state);
+        if (won === ECommonsAlgorithmBinaryPlayer.A)
+            return -1;
+        if (won === ECommonsAlgorithmBinaryPlayer.B)
+            return 1;
+        return 0;
+    }
+    minimaxMax(state) {
+        if (this.isTerminal(state))
+            return this.utility(state);
+        const currentPlayer = this.player(state);
+        let v;
+        for (const action of this.actions(state, currentPlayer)) {
+            const applied = this.result(state, currentPlayer, action);
+            const score = this.minimaxMin(applied);
+            v = v === undefined ? score : Math.max(v, score);
+        }
+        return v || 0;
+    }
+    minimaxMin(state) {
+        if (this.isTerminal(state))
+            return this.utility(state);
+        const currentPlayer = this.player(state);
+        let v;
+        for (const action of this.actions(state, currentPlayer)) {
+            const applied = this.result(state, currentPlayer, action);
+            const score = this.minimaxMax(applied);
+            v = v === undefined ? score : Math.min(v, score);
+        }
+        return v || 0;
+    }
+    minimax(state) {
+        if (this.isTerminal(state))
+            return undefined;
+        const currentPlayer = this.player(state);
+        const possibilities = [];
+        let best;
+        for (const action of this.actions(state, currentPlayer)) {
+            const test = this.result(state, currentPlayer, action);
+            if (currentPlayer === ECommonsAlgorithmBinaryPlayer.B) {
+                const v = this.minimaxMin(test);
+                possibilities.push([action, v]);
+                best = best === undefined ? v : Math.max(best, v);
+            }
+            else if (currentPlayer === ECommonsAlgorithmBinaryPlayer.A) {
+                const v = this.minimaxMax(test);
+                possibilities.push([action, v]);
+                best = best === undefined ? v : Math.min(best, v);
+            }
+            else {
+                throw new Error('Invalid player');
+            }
+        }
+        if (possibilities.length === 0)
+            return undefined;
+        const bestPossibility = possibilities
+            .find((p) => p[1] === best);
+        return {
+            player: currentPlayer,
+            action: bestPossibility[0]
+        };
+    }
+    get currentState() {
+        return this.clone(this.state);
+    }
+    next() {
+        const play = this.minimax(this.state);
+        if (play === undefined)
+            return undefined;
+        this.state = this.result(this.state, play.player, play.action);
+        return play;
+    }
+}
+//# sourceMappingURL=binary-winner-mini-max.mjs.map

package/dist/classes/binary-winner-mini-max.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary-winner-mini-max.mjs","sourceRoot":"","sources":["../../src/classes/binary-winner-mini-max.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,6BAA6B,EAAE,MAAM,6BAA6B,CAAC;AAW5E,MAAM,OAAgB,mCAAmC;IAK9C;IADV,YACU,KAAa;QAAb,UAAK,GAAL,KAAK,CAAQ;IACpB,CAAC;IAUI,MAAM,CAAC,KAAa,EAAE,MAAkD,EAAE,MAAe;QAChG,MAAM,KAAK,GAAW,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAExC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAExC,OAAO,KAAK,CAAC;IACd,CAAC;IAKO,MAAM,CAAC,KAAa;QAC3B,KAAK,MAAM,MAAM,IAAI,CAAE,6BAA6B,CAAC,CAAC,EAAE,6BAA6B,CAAC,CAAC,CAAE,EAAE,CAAC;YAC3F,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;QAC9C,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,UAAU,CAAC,KAAa;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAElD,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,OAAO,CAAC,KAAa;QAC5B,MAAM,GAAG,GAAyD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAErF,IAAI,GAAG,KAAK,6BAA6B,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QACvD,IAAI,GAAG,KAAK,6BAA6B,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,CAAC;IACV,CAAC;IAEO,UAAU,CAAC,KAAa;QAC/B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEvD,MAAM,aAAa,GAA+C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAErF,IAAI,CAAqB,CAAC;QAE1B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;YACzD,MAAM,OAAO,GAAW,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAClE,MAAM,KAAK,GAAa,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAEjD,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAc,CAAC;QAChE,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAEO,UAAU,CAAC,KAAa;QAC/B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEvD,MAAM,aAAa,GAA+C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAErF,IAAI,CAAqB,CAAC;QAE1B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;YACzD,MAAM,OAAO,GAAW,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAClE,MAAM,KAAK,GAAa,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAEjD,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAc,CAAC;QAChE,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAEO,OAAO,CAAC,KAAa;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,MAAM,aAAa,GAA+C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAErF,MAAM,aAAa,GAA4B,EAAE,CAAC;QAElD,IAAI,IAAwB,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,GAAW,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAE/D,IAAI,aAAa,KAAK,6BAA6B,CAAC,CAAC,EAAE,CAAC;gBACvD,MAAM,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC1C,aAAa,CAAC,IAAI,CAAC,CAAE,MAAM,EAAE,CAAC,CAAE,CAAC,CAAC;gBAElC,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAc,CAAC;YACjE,CAAC;iBAAM,IAAI,aAAa,KAAK,6BAA6B,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC1C,aAAa,CAAC,IAAI,CAAC,CAAE,MAAM,EAAE,CAAC,CAAE,CAAC,CAAC;gBAElC,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAc,CAAC;YACjE,CAAC;iBAAM,CAAC;gBACP,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACnC,CAAC;QACF,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEjD,MAAM,eAAe,GAA0B,aAAa;aACzD,IAAI,CAAC,CAAC,CAAwB,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAE,CAAC;QAE/D,OAAO;YACL,MAAM,EAAE,aAAa;YACrB,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC;SAC3B,CAAC;IACH,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEM,IAAI;QACV,MAAM,IAAI,GAAmD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtF,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAEzC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAE/D,OAAO,IAAI,CAAC;IACb,CAAC;CACD"}

package/dist/classes/bredth-first-search.d.mts

@@ -0,0 +1,5 @@
+import { TCommonsAlgorithmSearchNode } from '../types/tsearch-node.mjs';
+import { CommonsAlgorithmSearch, TCommonsAlgorithmInternalNode } from './search.mjs';
+export declare abstract class CommonsAlgorithmBredthFirstSearch<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> extends CommonsAlgorithmSearch<ActionT, NodeT> {
+    protected get next(): TCommonsAlgorithmInternalNode<ActionT, NodeT> | undefined;
+}

package/dist/classes/bredth-first-search.mjs

@@ -0,0 +1,7 @@
+import { CommonsAlgorithmSearch } from './search.mjs';
+export class CommonsAlgorithmBredthFirstSearch extends CommonsAlgorithmSearch {
+    get next() {
+        return this.frontier.shift();
+    }
+}
+//# sourceMappingURL=bredth-first-search.mjs.map

package/dist/classes/bredth-first-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"bredth-first-search.mjs","sourceRoot":"","sources":["../../src/classes/bredth-first-search.mts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAiC,MAAM,cAAc,CAAC;AAErF,MAAM,OAAgB,iCAGpB,SAAQ,sBAAsC;IAC/C,IAAc,IAAI;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;CACD"}

package/dist/classes/constraint-satisfaction.d.mts

@@ -0,0 +1,52 @@
+export declare abstract class CommonsAlgorithmConstraintSatisfactionNode<DomainT> {
+    private internalDomain;
+    private isDomainValueEqual?;
+    private internalUid;
+    private saved;
+    constructor(internalDomain: DomainT[], isDomainValueEqual?: ((a: DomainT, b: DomainT) => boolean) | undefined);
+    saveDomains(): void;
+    revertDomains(): void;
+    get domain(): DomainT[];
+    set domain(values: DomainT[]);
+    removeFromDomain(value: DomainT): void;
+    get uid(): string;
+    isEqual(b: CommonsAlgorithmConstraintSatisfactionNode<DomainT>): boolean;
+    abstract applyUnaryConsistency(): void;
+}
+export declare class CommonsAlgorithmConstraintSatisfactionEdge<DomainT, NodeT extends CommonsAlgorithmConstraintSatisfactionNode<DomainT>, EdgeDataT> {
+    private xNode;
+    private yNode;
+    private edgeData?;
+    constructor(xNode: NodeT, yNode: NodeT, edgeData?: EdgeDataT | undefined);
+    get x(): NodeT;
+    get y(): NodeT;
+    get data(): EdgeDataT | undefined;
+    isEqual(edge: CommonsAlgorithmConstraintSatisfactionEdge<DomainT, NodeT, EdgeDataT>): boolean;
+}
+export declare abstract class CommonsAlgorithmConstraintSatisfactionGraph<DomainT, NodeT extends CommonsAlgorithmConstraintSatisfactionNode<DomainT>, EdgeDataT = void> {
+    private internalNodes;
+    private internalEdges;
+    get nodes(): NodeT[];
+    get edges(): CommonsAlgorithmConstraintSatisfactionEdge<DomainT, NodeT, EdgeDataT>[];
+    addNode(node: NodeT): NodeT;
+    removeNode(node: NodeT): boolean;
+    join(a: NodeT, b: NodeT, data?: EdgeDataT): CommonsAlgorithmConstraintSatisfactionEdge<DomainT, NodeT, EdgeDataT>;
+    unjoin(a: NodeT, b: NodeT): void;
+    private listEdges;
+    listRemoteNodes(x: NodeT): NodeT[];
+    protected abstract satisfies(xValue: DomainT, yValue: DomainT, edge: CommonsAlgorithmConstraintSatisfactionEdge<DomainT, NodeT, EdgeDataT> | undefined): boolean;
+    private revise;
+    applyUnaryConsistency(): void;
+    applyAc3(): boolean;
+    saveSnapshot(): void;
+    revertSnapshot(): void;
+    snapshotForInference(): Map<string, DomainT[]>;
+    isUnsolvable(): boolean;
+    isComplete(): boolean;
+    isConsistent(): boolean;
+    get mostConnecteds(): NodeT[];
+    get mostConnected(): NodeT | undefined;
+    get smallestNonSingularDomains(): NodeT[];
+    get smallestNonSingularDomain(): NodeT | undefined;
+    applyBacktrack(chooseNextNode?: () => NodeT | undefined): boolean;
+}