tscommons-esm-algorithms 0.0.2

package/dist/classes/constraint-satisfaction.mjs

@@ -0,0 +1,314 @@
+import { commonsArrayRemove, commonsArrayRemoveAll, commonsArrayShuffle, commonsBase62GenerateRandomId } from 'tscommons-esm-core';
+export class CommonsAlgorithmConstraintSatisfactionNode {
+    internalDomain;
+    isDomainValueEqual;
+    internalUid;
+    saved;
+    constructor(internalDomain, isDomainValueEqual) {
+        this.internalDomain = internalDomain;
+        this.isDomainValueEqual = isDomainValueEqual;
+        this.internalUid = commonsBase62GenerateRandomId();
+    }
+    saveDomains() {
+        if (this.saved)
+            throw new Error('Save collision');
+        this.saved = [...this.internalDomain];
+    }
+    revertDomains() {
+        if (!this.saved)
+            throw new Error('No save to revert to');
+        this.internalDomain = this.saved; // not clone
+        this.saved = undefined;
+    }
+    get domain() {
+        return [...this.internalDomain];
+    }
+    set domain(values) {
+        this.internalDomain = [...values];
+    }
+    removeFromDomain(value) {
+        commonsArrayRemove(this.internalDomain, value, this.isDomainValueEqual);
+    }
+    get uid() {
+        return this.internalUid;
+    }
+    isEqual(b) {
+        return this.internalUid === b.internalUid;
+    }
+}
+export class CommonsAlgorithmConstraintSatisfactionEdge {
+    xNode;
+    yNode;
+    edgeData;
+    constructor(xNode, yNode, edgeData) {
+        this.xNode = xNode;
+        this.yNode = yNode;
+        this.edgeData = edgeData;
+    }
+    get x() {
+        return this.xNode;
+    }
+    get y() {
+        return this.yNode;
+    }
+    get data() {
+        return this.edgeData;
+    }
+    isEqual(edge) {
+        return edge.xNode.isEqual(this.xNode) && edge.yNode.isEqual(this.yNode);
+    }
+}
+export class CommonsAlgorithmConstraintSatisfactionGraph {
+    internalNodes = [];
+    internalEdges = [];
+    get nodes() {
+        return [...this.internalNodes];
+    }
+    get edges() {
+        return [...this.internalEdges];
+    }
+    addNode(node) {
+        const existing = this.internalNodes
+            .find((n) => n.isEqual(node));
+        if (existing)
+            return existing;
+        this.internalNodes.push(node);
+        return node;
+    }
+    removeNode(node) {
+        const existing = this.internalNodes
+            .find((n) => n.isEqual(node));
+        if (!existing)
+            return false;
+        commonsArrayRemove(this.internalNodes, existing);
+        const edgeMatches = this.internalEdges
+            .filter((edge) => edge.x.uid === existing.uid || edge.y.uid === existing.uid);
+        commonsArrayRemoveAll(this.internalEdges, edgeMatches);
+        return true;
+    }
+    join(a, b, data) {
+        const existingA = this.internalNodes
+            .find((n) => n.isEqual(a));
+        if (!existingA)
+            throw new Error('Node A has not been added yet');
+        const existingB = this.internalNodes
+            .find((n) => n.isEqual(b));
+        if (!existingB)
+            throw new Error('Node B has not been added yet');
+        if (existingA.uid === existingB.uid)
+            throw new Error('Nodes cannot be equal');
+        const edge = new CommonsAlgorithmConstraintSatisfactionEdge(existingA, existingB, data);
+        const existing = this.internalEdges
+            .find((e) => e.isEqual(edge));
+        if (existing)
+            return existing;
+        this.internalEdges.push(edge);
+        return edge;
+    }
+    unjoin(a, b) {
+        const existingA = this.internalNodes
+            .find((n) => n.isEqual(a));
+        if (!existingA)
+            throw new Error('Node A has not been added yet');
+        const existingB = this.internalNodes
+            .find((n) => n.isEqual(b));
+        if (!existingB)
+            throw new Error('Node B has not been added yet');
+        if (existingA.uid === existingB.uid)
+            throw new Error('Nodes cannot be equal');
+        const edge = this.internalEdges
+            .find((e) => e.x.uid === a.uid && e.y.uid === b.uid);
+        if (edge)
+            commonsArrayRemove(this.internalEdges, edge);
+        this.unjoin(b, a);
+    }
+    listEdges(x) {
+        return this.internalEdges
+            .filter((e) => e.x.isEqual(x));
+    }
+    listRemoteNodes(x) {
+        return this.listEdges(x)
+            .map((e) => e.y);
+    }
+    revise(x, y) {
+        let isRevised = false;
+        const edge = this.internalEdges
+            .find((e) => e.x.isEqual(x) && e.y.isEqual(y));
+        for (const xValue of x.domain) {
+            let satisfied = false;
+            for (const yValue of y.domain) {
+                if (this.satisfies(xValue, yValue, edge)) {
+                    satisfied = true;
+                    break;
+                }
+            }
+            if (!satisfied) {
+                x.removeFromDomain(xValue);
+                isRevised = true;
+            }
+        }
+        return isRevised;
+    }
+    applyUnaryConsistency() {
+        for (const node of this.internalNodes) {
+            node.applyUnaryConsistency();
+        }
+    }
+    applyAc3() {
+        const edges = [...this.internalEdges];
+        while (edges.length > 0) {
+            const edge = edges.shift();
+            if (!edge)
+                throw new Error('Empty edges array. Should not be possible');
+            if (this.revise(edge.x, edge.y)) {
+                if (edge.x.domain.length === 0)
+                    return false;
+                const zs = this.listRemoteNodes(edge.x);
+                commonsArrayRemove(zs, edge.y);
+                for (const z of zs) {
+                    const zEdge = new CommonsAlgorithmConstraintSatisfactionEdge(z, edge.x);
+                    edges.push(zEdge);
+                }
+            }
+        }
+        return true;
+    }
+    saveSnapshot() {
+        for (const node of this.nodes)
+            node.saveDomains();
+    }
+    revertSnapshot() {
+        for (const node of this.nodes)
+            node.revertDomains();
+    }
+    snapshotForInference() {
+        const map = new Map();
+        for (const node of this.nodes) {
+            map.set(node.uid, [...node.domain]);
+        }
+        return map;
+    }
+    isUnsolvable() {
+        for (const node of this.nodes) {
+            if (node.domain.length === 0)
+                return true;
+        }
+        return false;
+    }
+    isComplete() {
+        if (!this.isConsistent())
+            return false;
+        for (const node of this.nodes) {
+            if (node.domain.length > 1)
+                return false;
+        }
+        return true;
+    }
+    isConsistent() {
+        return true;
+    }
+    get mostConnecteds() {
+        const clone = this.nodes
+            .map((node) => ({
+            node: node,
+            edgeCount: this.listEdges(node).length
+        }));
+        if (clone.length === 0)
+            return [];
+        clone
+            .sort((a, b) => {
+            if (a.edgeCount < b.edgeCount)
+                return -1;
+            if (a.edgeCount > b.edgeCount)
+                return 1;
+            return 0;
+        })
+            .reverse();
+        const best = clone[0];
+        const bests = clone
+            .filter((c) => c.edgeCount === best.edgeCount);
+        return bests
+            .map((c) => c.node);
+    }
+    get mostConnected() {
+        const choices = this.mostConnecteds;
+        if (choices.length === 0)
+            return undefined;
+        return choices[Math.floor(Math.random() * choices.length)];
+    }
+    get smallestNonSingularDomains() {
+        const clone = this.nodes
+            .map((node) => ({
+            node: node,
+            domainCount: node.domain.length
+        }))
+            .filter((node) => node.domainCount > 1);
+        if (clone.length === 0)
+            return [];
+        clone
+            .sort((a, b) => {
+            if (a.domainCount < b.domainCount)
+                return -1;
+            if (a.domainCount > b.domainCount)
+                return 1;
+            return 0;
+        });
+        const best = clone[0];
+        const bests = clone
+            .filter((c) => c.domainCount === best.domainCount);
+        return bests
+            .map((c) => c.node);
+    }
+    get smallestNonSingularDomain() {
+        const choices = this.smallestNonSingularDomains;
+        if (choices.length === 0)
+            return undefined;
+        return choices[Math.floor(Math.random() * choices.length)];
+    }
+    applyBacktrack(chooseNextNode = () => this.smallestNonSingularDomain) {
+        if (this.isComplete())
+            return true;
+        if (this.isUnsolvable())
+            return false;
+        const choice = chooseNextNode();
+        if (!choice)
+            return false;
+        const available = [...choice.domain];
+        commonsArrayShuffle(available);
+        for (const value of available) {
+            this.saveSnapshot();
+            choice.domain = [value];
+            if (this.isConsistent()) {
+                const valid = this.applyAc3();
+                const map = this.snapshotForInference();
+                this.revertSnapshot();
+                const preInference = this.snapshotForInference();
+                if (valid) {
+                    // inference
+                    for (const node of this.nodes) {
+                        const match = map.get(node.uid);
+                        if (match)
+                            node.domain = [...match];
+                    }
+                    choice.domain = [value];
+                    const recurse = this.applyBacktrack();
+                    if (recurse)
+                        return true;
+                }
+                choice.removeFromDomain(value);
+                for (const node of this.nodes) {
+                    const match = preInference.get(node.uid);
+                    if (!match)
+                        throw new Error('No preInference to revert to');
+                    node.domain = match;
+                }
+            }
+            else {
+                this.revertSnapshot();
+                choice.removeFromDomain(value);
+            }
+        }
+        return false;
+    }
+}
+//# sourceMappingURL=constraint-satisfaction.mjs.map

package/dist/classes/constraint-satisfaction.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-satisfaction.mjs","sourceRoot":"","sources":["../../src/classes/constraint-satisfaction.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,6BAA6B,EAAE,MAAM,oBAAoB,CAAC;AAEnI,MAAM,OAAgB,0CAA0C;IAMrD;IACA;IANF,WAAW,CAAS;IAEpB,KAAK,CAAsB;IAEnC,YACU,cAAyB,EACzB,kBAAwD;QADxD,mBAAc,GAAd,cAAc,CAAW;QACzB,uBAAkB,GAAlB,kBAAkB,CAAsC;QAEjE,IAAI,CAAC,WAAW,GAAG,6BAA6B,EAAE,CAAC;IACpD,CAAC;IAEM,WAAW;QACjB,IAAI,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,GAAG,CAAE,GAAG,IAAI,CAAC,cAAc,CAAE,CAAC;IACzC,CAAC;IAEM,aAAa;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,YAAY;QAC9C,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;IACxB,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,CAAE,GAAG,IAAI,CAAC,cAAc,CAAE,CAAC;IACnC,CAAC;IACD,IAAW,MAAM,CAAC,MAAiB;QAClC,IAAI,CAAC,cAAc,GAAG,CAAE,GAAG,MAAM,CAAE,CAAC;IACrC,CAAC;IAEM,gBAAgB,CAAC,KAAc;QACrC,kBAAkB,CAChB,IAAI,CAAC,cAAc,EACnB,KAAK,EACL,IAAI,CAAC,kBAAkB,CACxB,CAAC;IACH,CAAC;IAED,IAAW,GAAG;QACb,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAEM,OAAO,CAAC,CAAsD;QACpE,OAAO,IAAI,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,CAAC;IAC3C,CAAC;CAGD;AAED,MAAM,OAAO,0CAA0C;IAM5C;IACA;IACA;IAHV,YACU,KAAY,EACZ,KAAY,EACZ,QAAoB;QAFpB,UAAK,GAAL,KAAK,CAAO;QACZ,UAAK,GAAL,KAAK,CAAO;QACZ,aAAQ,GAAR,QAAQ,CAAY;IAC3B,CAAC;IAEJ,IAAW,CAAC;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,IAAW,CAAC;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAEM,OAAO,CAAC,IAA2E;QACzF,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzE,CAAC;CACD;AAED,MAAM,OAAgB,2CAA2C;IAKxD,aAAa,GAAY,EAAE,CAAC;IAC5B,aAAa,GAIf,EAAE,CAAC;IAET,IAAW,KAAK;QACf,OAAO,CAAE,GAAG,IAAI,CAAC,aAAa,CAAE,CAAC;IAClC,CAAC;IAED,IAAW,KAAK;QAKf,OAAO,CAAE,GAAG,IAAI,CAAC,aAAa,CAAE,CAAC;IAClC,CAAC;IAEM,OAAO,CAAC,IAAW;QACzB,MAAM,QAAQ,GAAoB,IAAI,CAAC,aAAa;aACjD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,UAAU,CAAC,IAAW;QAC5B,MAAM,QAAQ,GAAoB,IAAI,CAAC,aAAa;aACjD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAE5B,kBAAkB,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QAEjD,MAAM,WAAW,GAIX,IAAI,CAAC,aAAa;aACrB,MAAM,CAAC,CAAC,IAIR,EAAW,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE7E,qBAAqB,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,IAAI,CACT,CAAQ,EACR,CAAQ,EACR,IAAgB;QAEjB,MAAM,SAAS,GAAoB,IAAI,CAAC,aAAa;aAClD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAEjE,MAAM,SAAS,GAAoB,IAAI,CAAC,aAAa;aAClD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAEjE,IAAI,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAE9E,MAAM,IAAI,GAIN,IAAI,0CAA0C,CAIhD,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAE9B,MAAM,QAAQ,GAIA,IAAI,CAAC,aAAa;aAC7B,IAAI,CAAC,CAAC,CAIN,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9B,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,MAAM,CAAC,CAAQ,EAAE,CAAQ;QAC/B,MAAM,SAAS,GAAoB,IAAI,CAAC,aAAa;aAClD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAEjE,MAAM,SAAS,GAAoB,IAAI,CAAC,aAAa;aAClD,IAAI,CAAC,CAAC,CAAQ,EAAW,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAEjE,IAAI,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAE9E,MAAM,IAAI,GAII,IAAI,CAAC,aAAa;aAC7B,IAAI,CAAC,CAAC,CAIN,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QACzD,IAAI,IAAI;YAAE,kBAAkB,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAEvD,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,CAAQ;QAKzB,OAAO,IAAI,CAAC,aAAa;aACtB,MAAM,CAAC,CAAC,CAIR,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAEM,eAAe,CAAC,CAAQ;QAC9B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;aACrB,GAAG,CAAC,CAAC,CAIL,EAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAYO,MAAM,CAAC,CAAQ,EAAE,CAAQ;QAChC,IAAI,SAAS,GAAY,KAAK,CAAC;QAE/B,MAAM,IAAI,GAII,IAAI,CAAC,aAAa;aAC7B,IAAI,CAAC,CAAC,CAIN,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,SAAS,GAAY,KAAK,CAAC;YAC/B,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;gBAE/B,IAAI,IAAI,CAAC,SAAS,CAChB,MAAM,EACN,MAAM,EACN,IAAI,CACL,EAAE,CAAC;oBACH,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACP,CAAC;YACF,CAAC;YAED,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChB,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;gBAC3B,SAAS,GAAG,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAEM,qBAAqB;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC9B,CAAC;IACF,CAAC;IAEM,QAAQ;QACd,MAAM,KAAK,GAIL,CAAE,GAAG,IAAI,CAAC,aAAa,CAAE,CAAC;QAEhC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,GAII,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YAExE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAE7C,MAAM,EAAE,GAAY,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjD,kBAAkB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAE/B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACpB,MAAM,KAAK,GAIP,IAAI,0CAA0C,CAIhD,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,YAAY;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,WAAW,EAAE,CAAC;IACnD,CAAC;IAEM,cAAc;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,aAAa,EAAE,CAAC;IACrD,CAAC;IAEM,oBAAoB;QAC1B,MAAM,GAAG,GAA2B,IAAI,GAAG,EAAqB,CAAC;QACjE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAE,GAAG,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,GAAG,CAAC;IACZ,CAAC;IAEM,YAAY;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC3C,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,UAAU;QAChB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YAAE,OAAO,KAAK,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC1C,CAAC;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,YAAY;QAClB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAW,cAAc;QAMxB,MAAM,KAAK,GAAyB,IAAI,CAAC,KAAK;aAC3C,GAAG,CAAC,CAAC,IAAW,EAAsB,EAAE,CAAC,CAAC;YACzC,IAAI,EAAE,IAAI;YACV,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM;SACvC,CAAC,CAAC,CAAC;QACN,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,KAAK;aACF,IAAI,CAAC,CAAC,CAAqB,EAAE,CAAqB,EAAU,EAAE;YAC9D,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;gBAAE,OAAO,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;gBAAE,OAAO,CAAC,CAAC;YACxC,OAAO,CAAC,CAAC;QACV,CAAC,CAAC;aACD,OAAO,EAAE,CAAC;QAEb,MAAM,IAAI,GAAuB,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1C,MAAM,KAAK,GAAyB,KAAK;aACtC,MAAM,CAAC,CAAC,CAAqB,EAAW,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC;QAE9E,OAAO,KAAK;aACT,GAAG,CAAC,CAAC,CAAqB,EAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IAED,IAAW,aAAa;QACvB,MAAM,OAAO,GAAY,IAAI,CAAC,cAAc,CAAC;QAC7C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE3C,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,IAAW,0BAA0B;QAMpC,MAAM,KAAK,GAA2B,IAAI,CAAC,KAAK;aAC7C,GAAG,CAAC,CAAC,IAAW,EAAwB,EAAE,CAAC,CAAC;YAC3C,IAAI,EAAE,IAAI;YACV,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;SAChC,CAAC,CAAC;aACF,MAAM,CAAC,CAAC,IAA0B,EAAW,EAAE,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QACzE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,KAAK;aACF,IAAI,CAAC,CAAC,CAAuB,EAAE,CAAuB,EAAU,EAAE;YAClE,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW;gBAAE,OAAO,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW;gBAAE,OAAO,CAAC,CAAC;YAC5C,OAAO,CAAC,CAAC;QACV,CAAC,CAAC,CAAC;QAEL,MAAM,IAAI,GAAyB,KAAK,CAAC,CAAC,CAAC,CAAC;QAE5C,MAAM,KAAK,GAA2B,KAAK;aACxC,MAAM,CAAC,CAAC,CAAuB,EAAW,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC;QAEpF,OAAO,KAAK;aACT,GAAG,CAAC,CAAC,CAAuB,EAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;IAED,IAAW,yBAAyB;QACnC,MAAM,OAAO,GAAY,IAAI,CAAC,0BAA0B,CAAC;QACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE3C,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IAEM,cAAc,CACnB,iBAAwC,GAAoB,EAAE,CAAC,IAAI,CAAC,yBAAyB;QAE9F,IAAI,IAAI,CAAC,UAAU,EAAE;YAAE,OAAO,IAAI,CAAC;QACnC,IAAI,IAAI,CAAC,YAAY,EAAE;YAAE,OAAO,KAAK,CAAC;QAEtC,MAAM,MAAM,GAAoB,cAAc,EAAE,CAAC;QACjD,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAE1B,MAAM,SAAS,GAAc,CAAE,GAAG,MAAM,CAAC,MAAM,CAAE,CAAC;QAClD,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,YAAY,EAAE,CAAC;YAEpB,MAAM,CAAC,MAAM,GAAG,CAAE,KAAK,CAAE,CAAC;YAE1B,IAAI,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAY,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACvC,MAAM,GAAG,GAA2B,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAEhE,IAAI,CAAC,cAAc,EAAE,CAAC;gBAEtB,MAAM,YAAY,GAA2B,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAEzE,IAAI,KAAK,EAAE,CAAC;oBACX,YAAY;oBACZ,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;wBAC/B,MAAM,KAAK,GAAwB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACrD,IAAI,KAAK;4BAAE,IAAI,CAAC,MAAM,GAAG,CAAE,GAAG,KAAK,CAAE,CAAC;oBACvC,CAAC;oBAED,MAAM,CAAC,MAAM,GAAG,CAAE,KAAK,CAAE,CAAC;oBAE1B,MAAM,OAAO,GAAY,IAAI,CAAC,cAAc,EAAE,CAAC;oBAC/C,IAAI,OAAO;wBAAE,OAAO,IAAI,CAAC;gBAC1B,CAAC;gBAED,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAwB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC9D,IAAI,CAAC,KAAK;wBAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;oBAC5D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;gBACrB,CAAC;YACF,CAAC;iBAAM,CAAC;gBACP,IAAI,CAAC,cAAc,EAAE,CAAC;gBACtB,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;CACD"}

package/dist/classes/depth-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 CommonsAlgorithmDepthFirstSearch<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> extends CommonsAlgorithmSearch<ActionT, NodeT> {
+    protected get next(): TCommonsAlgorithmInternalNode<ActionT, NodeT> | undefined;
+}

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

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

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

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

package/dist/classes/greedy-best-first-search.d.mts

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

package/dist/classes/greedy-best-first-search.mjs

@@ -0,0 +1,20 @@
+import { CommonsAlgorithmSearch, commonsAlgorithmDeInternalise } from './search.mjs';
+export class CommonsAlgorithmGreedyBestFirstSearch extends CommonsAlgorithmSearch {
+    get next() {
+        if (this.frontier.length === 0)
+            return undefined;
+        let bestScore;
+        let bestIndex;
+        for (let i = 0; i < this.frontier.length; i++) {
+            const score = this.heuristic(commonsAlgorithmDeInternalise(this.frontier[i]));
+            if (bestScore === undefined || score < bestScore) {
+                bestScore = score;
+                bestIndex = i;
+            }
+        }
+        if (bestIndex === undefined)
+            return undefined;
+        return this.frontier.splice(bestIndex, 1)[0];
+    }
+}
+//# sourceMappingURL=greedy-best-first-search.mjs.map

package/dist/classes/greedy-best-first-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-best-first-search.mjs","sourceRoot":"","sources":["../../src/classes/greedy-best-first-search.mts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAiC,6BAA6B,EAAE,MAAM,cAAc,CAAC;AAEpH,MAAM,OAAgB,qCAGpB,SAAQ,sBAAsC;IAG/C,IAAc,IAAI;QACjB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEjD,IAAI,SAA2B,CAAC;QAChC,IAAI,SAA2B,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAW,IAAI,CAAC,SAAS,CAAC,6BAA6B,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtF,IAAI,SAAS,KAAK,SAAS,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBAClD,SAAS,GAAG,KAAK,CAAC;gBAClB,SAAS,GAAG,CAAC,CAAC;YACf,CAAC;QACF,CAAC;QAED,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAE9C,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;CACD"}

package/dist/classes/hill-climb-local-search.d.mts

@@ -0,0 +1,18 @@
+import { TCommonsAlgorithmStateWithScore } from '../types/tstart-with-score.mjs';
+import { ECommonsAlgorithmOrientation } from '../enums/elocal-search-orientation.mjs';
+import { CommonsAlgorithmLocalSearch } from './local-search.mjs';
+export declare abstract class CommonsAlgorithmHillClimbLocalSearch<StateT> extends CommonsAlgorithmLocalSearch<StateT> {
+    protected orientation: ECommonsAlgorithmOrientation;
+    constructor(orientation: ECommonsAlgorithmOrientation);
+    protected abstract chooseFromValids(valids: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+    protected choose(state: TCommonsAlgorithmStateWithScore<StateT>, potentials: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+}
+export declare abstract class CommonsAlgorithmSteepestHillClimbLocalSearch<StateT> extends CommonsAlgorithmHillClimbLocalSearch<StateT> {
+    protected chooseFromValids(valids: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+}
+export declare abstract class CommonsAlgorithmStochasticHillClimbLocalSearch<StateT> extends CommonsAlgorithmHillClimbLocalSearch<StateT> {
+    protected chooseFromValids(valids: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+}
+export declare abstract class CommonsAlgorithmFirstChoiceHillClimbLocalSearch<StateT> extends CommonsAlgorithmHillClimbLocalSearch<StateT> {
+    protected chooseFromValids(valids: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+}

package/dist/classes/hill-climb-local-search.mjs

@@ -0,0 +1,60 @@
+import { ECommonsAlgorithmOrientation } from '../enums/elocal-search-orientation.mjs';
+import { CommonsAlgorithmLocalSearch } from './local-search.mjs';
+export class CommonsAlgorithmHillClimbLocalSearch extends CommonsAlgorithmLocalSearch {
+    orientation;
+    constructor(orientation) {
+        super();
+        this.orientation = orientation;
+    }
+    choose(state, potentials) {
+        const orientationClosure = this.orientation;
+        const valids = potentials
+            .filter((potential) => {
+            switch (orientationClosure) {
+                case ECommonsAlgorithmOrientation.MAXIMUM:
+                    return potential.score > state.score;
+                case ECommonsAlgorithmOrientation.MINIMUM:
+                    return potential.score < state.score;
+            }
+        });
+        const choice = this.chooseFromValids(valids);
+        if (!choice)
+            return undefined;
+        return choice;
+    }
+}
+export class CommonsAlgorithmSteepestHillClimbLocalSearch extends CommonsAlgorithmHillClimbLocalSearch {
+    chooseFromValids(valids) {
+        if (valids.length === 0)
+            return undefined;
+        valids
+            .sort((a, b) => {
+            if (a.score < b.score)
+                return -1;
+            if (a.score > b.score)
+                return 1;
+            return 0;
+        });
+        switch (this.orientation) {
+            case ECommonsAlgorithmOrientation.MAXIMUM:
+                return valids[valids.length - 1];
+            case ECommonsAlgorithmOrientation.MINIMUM:
+                return valids[0];
+        }
+    }
+}
+export class CommonsAlgorithmStochasticHillClimbLocalSearch extends CommonsAlgorithmHillClimbLocalSearch {
+    chooseFromValids(valids) {
+        if (valids.length === 0)
+            return undefined;
+        return valids[Math.floor(Math.random() * valids.length)];
+    }
+}
+export class CommonsAlgorithmFirstChoiceHillClimbLocalSearch extends CommonsAlgorithmHillClimbLocalSearch {
+    chooseFromValids(valids) {
+        if (valids.length === 0)
+            return undefined;
+        return valids[0];
+    }
+}
+//# sourceMappingURL=hill-climb-local-search.mjs.map

package/dist/classes/hill-climb-local-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"hill-climb-local-search.mjs","sourceRoot":"","sources":["../../src/classes/hill-climb-local-search.mts"],"names":[],"mappings":"AAEA,OAAO,EAAE,4BAA4B,EAAE,MAAM,wCAAwC,CAAC;AAEtF,OAAO,EAAE,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AAEjE,MAAM,OAAgB,oCAA6C,SAAQ,2BAAmC;IAEjG;IADZ,YACY,WAAyC;QAEpD,KAAK,EAAE,CAAC;QAFG,gBAAW,GAAX,WAAW,CAA8B;IAGrD,CAAC;IAIkB,MAAM,CAAC,KAA8C,EAAE,UAAqD;QAC9H,MAAM,kBAAkB,GAAiC,IAAI,CAAC,WAAW,CAAC;QAE1E,MAAM,MAAM,GAA8C,UAAU;aACjE,MAAM,CAAC,CAAC,SAAkD,EAAW,EAAE;YACvE,QAAQ,kBAAkB,EAAE,CAAC;gBAC5B,KAAK,4BAA4B,CAAC,OAAO;oBACxC,OAAO,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;gBACtC,KAAK,4BAA4B,CAAC,OAAO;oBACxC,OAAO,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACvC,CAAC;QACF,CAAC,CAAC,CAAC;QAEL,MAAM,MAAM,GAAsD,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAChG,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QAE9B,OAAO,MAAM,CAAC;IACf,CAAC;CACD;AAED,MAAM,OAAgB,4CAAqD,SAAQ,oCAA4C;IACpH,gBAAgB,CAAC,MAAiD;QAC3E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE1C,MAAM;aACH,IAAI,CAAC,CAAC,CAA0C,EAAE,CAA0C,EAAU,EAAE;YACxG,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YAChC,OAAO,CAAC,CAAC;QACV,CAAC,CAAC,CAAC;QAEL,QAAQ,IAAI,CAAC,WAAW,EAAE,CAAC;YAC1B,KAAK,4BAA4B,CAAC,OAAO;gBACxC,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,KAAK,4BAA4B,CAAC,OAAO;gBACxC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;IACF,CAAC;CACD;AAED,MAAM,OAAgB,8CAAuD,SAAQ,oCAA4C;IACtH,gBAAgB,CAAC,MAAiD;QAC3E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE1C,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,CAAC;CACD;AAED,MAAM,OAAgB,+CAAwD,SAAQ,oCAA4C;IACvH,gBAAgB,CAAC,MAAiD;QAC3E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE1C,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;CACD"}

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

@@ -0,0 +1,8 @@
+import { TCommonsAlgorithmStateWithScore } from '../types/tstart-with-score.mjs';
+export declare abstract class CommonsAlgorithmLocalSearch<StateT> {
+    protected abstract score(state: StateT): number;
+    protected abstract neighbours(state: StateT): StateT[];
+    protected abstract choose(state: TCommonsAlgorithmStateWithScore<StateT>, potentials: TCommonsAlgorithmStateWithScore<StateT>[]): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+    computeNext(current: TCommonsAlgorithmStateWithScore<StateT>): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+    computeOptimial(initial: StateT): TCommonsAlgorithmStateWithScore<StateT>;
+}

package/dist/classes/local-search.mjs

@@ -0,0 +1,29 @@
+export class CommonsAlgorithmLocalSearch {
+    computeNext(current) {
+        const neighbours = this.neighbours(current.state);
+        const potentials = neighbours
+            .map((s) => ({
+            state: s,
+            score: this.score(s)
+        }));
+        if (potentials.length === 0)
+            return undefined;
+        const choice = this.choose(current, potentials);
+        if (!choice)
+            return undefined;
+        return choice;
+    }
+    computeOptimial(initial) {
+        let current = {
+            state: initial,
+            score: this.score(initial)
+        };
+        while (true) {
+            const next = this.computeNext(current);
+            if (!next)
+                return current;
+            current = next;
+        }
+    }
+}
+//# sourceMappingURL=local-search.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"local-search.mjs","sourceRoot":"","sources":["../../src/classes/local-search.mts"],"names":[],"mappings":"AAEA,MAAM,OAAgB,2BAA2B;IAOzC,WAAW,CAAC,OAAgD;QAClE,MAAM,UAAU,GAAa,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE5D,MAAM,UAAU,GAA8C,UAAU;aACrE,GAAG,CAAC,CAAC,CAAS,EAA2C,EAAE,CAAC,CAAC;YAC5D,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;SACrB,CAAC,CAAC,CAAC;QACN,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE9C,MAAM,MAAM,GAAsD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnG,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QAE9B,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,eAAe,CAAC,OAAe;QACrC,IAAI,OAAO,GAA4C;YACrD,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;SAC3B,CAAC;QAEF,OAAO,IAAI,EAAE,CAAC;YACb,MAAM,IAAI,GAAsD,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC1F,IAAI,CAAC,IAAI;gBAAE,OAAO,OAAO,CAAC;YAE1B,OAAO,GAAG,IAAI,CAAC;QAChB,CAAC;IACF,CAAC;CACD"}

package/dist/classes/random-restart.d.mts

@@ -0,0 +1,11 @@
+import { TCommonsAlgorithmStateWithScore } from '../types/tstart-with-score.mjs';
+import { ECommonsAlgorithmOrientation } from '../enums/elocal-search-orientation.mjs';
+import { CommonsAlgorithmLocalSearch } from './local-search.mjs';
+export declare abstract class CommonsAlgorithmRandomRestartSearch<StateT, SearchT extends CommonsAlgorithmLocalSearch<StateT>> {
+    private orientation;
+    constructor(orientation: ECommonsAlgorithmOrientation);
+    protected abstract constructLocalSearch(orientation: ECommonsAlgorithmOrientation): SearchT;
+    protected abstract generateInitial(): StateT;
+    protected abstract choose(potentials: TCommonsAlgorithmStateWithScore<StateT>[], orientation: ECommonsAlgorithmOrientation): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+    computeOptimial(max: number): TCommonsAlgorithmStateWithScore<StateT> | undefined;
+}

package/dist/classes/random-restart.mjs

@@ -0,0 +1,17 @@
+export class CommonsAlgorithmRandomRestartSearch {
+    orientation;
+    constructor(orientation) {
+        this.orientation = orientation;
+    }
+    computeOptimial(max) {
+        const optimals = [];
+        for (let i = max; i-- > 0;) {
+            const search = this.constructLocalSearch(this.orientation);
+            const initial = this.generateInitial();
+            const optimal = search.computeOptimial(initial);
+            optimals.push(optimal);
+        }
+        return this.choose(optimals, this.orientation);
+    }
+}
+//# sourceMappingURL=random-restart.mjs.map

package/dist/classes/random-restart.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-restart.mjs","sourceRoot":"","sources":["../../src/classes/random-restart.mts"],"names":[],"mappings":"AAMA,MAAM,OAAgB,mCAAmC;IAK9C;IADV,YACU,WAAyC;QAAzC,gBAAW,GAAX,WAAW,CAA8B;IAChD,CAAC;IAQG,eAAe,CAAC,GAAW;QACjC,MAAM,QAAQ,GAA8C,EAAE,CAAC;QAE/D,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;YAC5B,MAAM,MAAM,GAAY,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACpE,MAAM,OAAO,GAAW,IAAI,CAAC,eAAe,EAAE,CAAC;YAE/C,MAAM,OAAO,GAA4C,MAAM,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;YACzF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;CACD"}

package/dist/classes/search.d.mts

@@ -0,0 +1,23 @@
+import { TCommonsAlgorithmSearchNode } from '../types/tsearch-node.mjs';
+export type TCommonsAlgorithmInternalNode<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> = NodeT & {
+    parent: TCommonsAlgorithmInternalNode<ActionT, NodeT> | undefined;
+};
+export declare function commonsAlgorithmDeInternalise<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>, InternalNodeT extends TCommonsAlgorithmInternalNode<ActionT, NodeT>>(node: InternalNodeT): NodeT;
+export declare abstract class CommonsAlgorithmSearch<ActionT, NodeT extends TCommonsAlgorithmSearchNode<ActionT>> {
+    private actions;
+    private shuffle;
+    protected frontier: TCommonsAlgorithmInternalNode<ActionT, NodeT>[];
+    private explored;
+    constructor(actions: ActionT[], shuffle?: boolean);
+    protected abstract get next(): TCommonsAlgorithmInternalNode<ActionT, NodeT> | undefined;
+    protected abstract isEqual(a: Omit<NodeT, 'action'>, b: Omit<NodeT, 'action'>): boolean;
+    protected abstract isGoal(node: NodeT): boolean;
+    protected abstract applyActionIfPossible(node: NodeT, action: ActionT): NodeT | undefined;
+    private inArray;
+    private inFrontier;
+    private inExplored;
+    protected transition(node: TCommonsAlgorithmInternalNode<ActionT, NodeT>, action: ActionT): TCommonsAlgorithmInternalNode<ActionT, NodeT> | undefined;
+    protected transitions(node: TCommonsAlgorithmInternalNode<ActionT, NodeT>): TCommonsAlgorithmInternalNode<ActionT, NodeT>[];
+    computeRoute(start: Omit<NodeT, 'action'>, progressCallback?: (frontierLength: number, exploredLength: number) => void, progressBlockSize?: number): NodeT[] | undefined;
+    listExplored(): NodeT[];
+}