@stevenvo780/st-lang 4.2.0 → 4.4.0

package/dist/runtime/csp/ac3.js

@@ -0,0 +1,165 @@
+"use strict";
+// ============================================================
+// AC-3 — Arc Consistency #3 (Mackworth, 1977).
+// ============================================================
+// Mantiene la consistencia de arco binaria: para cada arco (Xi, Xj)
+// y para cada valor v ∈ D(Xi), debe existir al menos un valor
+// w ∈ D(Xj) tal que la restricción binaria entre Xi y Xj acepte
+// la tupla (v, w). Si no existe, v se elimina de D(Xi).
+//
+// Complejidad: O(e · d³) donde e = # de restricciones binarias y
+// d = tamaño máximo de dominio. Suficientemente rápido para CSPs
+// de tamaño moderado (sudoku, n-queens, coloreo de grafos).
+//
+// Las restricciones n-arias (n > 2) NO participan en AC-3: sólo
+// se contraen las binarias. Las n-arias se chequean en backtracking.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ac3 = ac3;
+exports.ac3InPlace = ac3InPlace;
+/**
+ * Devuelve `true` si el predicado de la restricción binaria acepta la
+ * tupla (a, b) según el orden de `c.vars`. Si los var indices están
+ * cruzados, alinea automáticamente.
+ */
+function binaryAccepts(c, xi, xj, a, b) {
+    if (c.vars.length !== 2) {
+        throw new Error('binaryAccepts: la restricción no es binaria');
+    }
+    const [v0, v1] = c.vars;
+    if (v0 === xi && v1 === xj)
+        return c.predicate([a, b]);
+    if (v0 === xj && v1 === xi)
+        return c.predicate([b, a]);
+    throw new Error('binaryAccepts: la restricción no involucra (xi, xj)');
+}
+/**
+ * Construye el índice "vecinos binarios" del CSP.
+ * vecinos[xi] = lista de pares { xj, constraint } tales que existe una
+ * restricción binaria entre xi y xj.
+ */
+function buildBinaryNeighbors(csp) {
+    const neighbors = new Map();
+    for (const v of csp.variables)
+        neighbors.set(v, []);
+    for (const c of csp.constraints) {
+        if (c.vars.length !== 2)
+            continue;
+        const [a, b] = c.vars;
+        if (a === undefined || b === undefined)
+            continue;
+        neighbors.get(a)?.push({ other: b, constraint: c });
+        neighbors.get(b)?.push({ other: a, constraint: c });
+    }
+    return neighbors;
+}
+/**
+ * Revisa el arco (xi → xj): elimina de D(xi) todo valor sin soporte
+ * en D(xj). Retorna `true` si el dominio cambió.
+ */
+function revise(domains, xi, xj, constraint) {
+    const dxi = domains.get(xi);
+    const dxj = domains.get(xj);
+    if (!dxi || !dxj)
+        return false;
+    let revised = false;
+    const keep = [];
+    for (const a of dxi) {
+        let hasSupport = false;
+        for (const b of dxj) {
+            if (binaryAccepts(constraint, xi, xj, a, b)) {
+                hasSupport = true;
+                break;
+            }
+        }
+        if (hasSupport)
+            keep.push(a);
+        else
+            revised = true;
+    }
+    if (revised)
+        domains.set(xi, keep);
+    return revised;
+}
+/**
+ * Aplica AC-3 sobre una copia de los dominios del CSP.
+ * Devuelve { consistent, reducedDomains }: si `consistent` es false,
+ * el CSP es UNSAT por consistencia de arco (algún dominio quedó vacío).
+ *
+ * La firma deja los dominios originales intactos: el caller decide si
+ * adoptar `reducedDomains` o conservar los originales.
+ */
+function ac3(csp) {
+    // Copia profunda de dominios para no mutar el input.
+    const reduced = new Map();
+    for (const [k, vals] of csp.domains)
+        reduced.set(k, [...vals]);
+    const neighbors = buildBinaryNeighbors(csp);
+    const queue = [];
+    for (const c of csp.constraints) {
+        if (c.vars.length !== 2)
+            continue;
+        const [a, b] = c.vars;
+        if (a === undefined || b === undefined)
+            continue;
+        queue.push({ xi: a, xj: b, constraint: c });
+        queue.push({ xi: b, xj: a, constraint: c });
+    }
+    while (queue.length > 0) {
+        const arc = queue.shift();
+        if (!arc)
+            continue;
+        const { xi, xj, constraint } = arc;
+        if (revise(reduced, xi, xj, constraint)) {
+            const di = reduced.get(xi);
+            if (!di || di.length === 0) {
+                return { consistent: false, reducedDomains: reduced };
+            }
+            // Re-encolar (xk, xi) para cada vecino xk ≠ xj.
+            const nbrs = neighbors.get(xi) ?? [];
+            for (const { other: xk, constraint: ck } of nbrs) {
+                if (xk === xj)
+                    continue;
+                queue.push({ xi: xk, xj: xi, constraint: ck });
+            }
+        }
+    }
+    return { consistent: true, reducedDomains: reduced };
+}
+/**
+ * Helper público para uso en backtracking incremental: aplica AC-3
+ * sobre un set de dominios ya provisto (mutación in-place permitida)
+ * y devuelve `true` si los dominios siguen consistentes.
+ */
+function ac3InPlace(csp, domains) {
+    const neighbors = buildBinaryNeighbors(csp);
+    const queue = [];
+    for (const c of csp.constraints) {
+        if (c.vars.length !== 2)
+            continue;
+        const [a, b] = c.vars;
+        if (a === undefined || b === undefined)
+            continue;
+        queue.push({ xi: a, xj: b, constraint: c });
+        queue.push({ xi: b, xj: a, constraint: c });
+    }
+    while (queue.length > 0) {
+        const arc = queue.shift();
+        if (!arc)
+            continue;
+        const { xi, xj, constraint } = arc;
+        if (revise(domains, xi, xj, constraint)) {
+            const di = domains.get(xi);
+            if (!di || di.length === 0)
+                return false;
+            const nbrs = neighbors.get(xi) ?? [];
+            for (const { other: xk, constraint: ck } of nbrs) {
+                if (xk === xj)
+                    continue;
+                queue.push({ xi: xk, xj: xi, constraint: ck });
+            }
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=ac3.js.map

package/dist/runtime/csp/ac3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ac3.js","sourceRoot":"","sources":["../../../src/runtime/csp/ac3.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,oEAAoE;AACpE,8DAA8D;AAC9D,gEAAgE;AAChE,wDAAwD;AACxD,EAAE;AACF,iEAAiE;AACjE,iEAAiE;AACjE,4DAA4D;AAC5D,EAAE;AACF,gEAAgE;AAChE,qEAAqE;AACrE,+DAA+D;;AAwE/D,kBA0CC;AAOD,gCA2BC;AAhJD;;;;GAIG;AACH,SAAS,aAAa,CAAO,CAAmB,EAAE,EAAK,EAAE,EAAK,EAAE,CAAI,EAAE,CAAI;IACxE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;IACxB,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;AACzE,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,GAAc;IAEd,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwD,CAAC;IAClF,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QACjD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QACpD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CAAO,OAAoB,EAAE,EAAK,EAAE,EAAK,EAAE,UAA4B;IACpF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,aAAa,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC5C,UAAU,GAAG,IAAI,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,UAAU;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACxB,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IACD,IAAI,OAAO;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,GAAG,CACjB,GAAc;IAKd,qDAAqD;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAE/D,MAAM,SAAS,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;IAI5C,MAAM,KAAK,GAAU,EAAE,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QACjD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,GAAG,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC3B,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;YACxD,CAAC;YACD,gDAAgD;YAChD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC;gBACjD,IAAI,EAAE,KAAK,EAAE;oBAAE,SAAS;gBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;AACvD,CAAC;AAED;;;;GAIG;AACH,SAAgB,UAAU,CAAO,GAAc,EAAE,OAAoB;IACnE,MAAM,SAAS,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;IAE5C,MAAM,KAAK,GAAU,EAAE,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QACjD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,GAAG,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC;gBACjD,IAAI,EAAE,KAAK,EAAE;oBAAE,SAAS;gBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/runtime/csp/backtrack.d.ts

@@ -0,0 +1,15 @@
+import type { CSP, CSPResult, BacktrackOptions } from './types';
+/**
+ * Backtracking search. Si `useAC3` está activo, también aplica AC-3
+ * tras cada asignación (Maintaining Arc Consistency, MAC).
+ *
+ * Devuelve la primera solución encontrada o `null` si UNSAT. Para
+ * enumerar todas las soluciones, ver `allSolutions`.
+ */
+export declare function backtrack<V, D>(csp: CSP<V, D>, opts?: BacktrackOptions): CSPResult<V, D>;
+/**
+ * Enumera hasta `maxSolutions` soluciones del CSP. Útil para contar
+ * soluciones simétricas (e.g. n-queens completo, sudoku no-único).
+ */
+export declare function allSolutions<V, D>(csp: CSP<V, D>, maxSolutions?: number, opts?: BacktrackOptions): Array<Map<V, D>>;
+//# sourceMappingURL=backtrack.d.ts.map

package/dist/runtime/csp/backtrack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backtrack.d.ts","sourceRoot":"","sources":["../../../src/runtime/csp/backtrack.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,GAAG,EAAE,SAAS,EAAc,gBAAgB,EAAE,MAAM,SAAS,CAAC;AA8F5E;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,GAAE,gBAAqB,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CA4D5F;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAC/B,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,YAAY,SAAM,EAClB,IAAI,GAAE,gBAAqB,GAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CA4ClB"}

package/dist/runtime/csp/backtrack.js

@@ -0,0 +1,233 @@
+"use strict";
+// ============================================================
+// Backtracking search con heurísticas MRV + LCV + AC-3.
+// ============================================================
+// Algoritmo clásico: asigna variables una a una, propaga restricciones
+// y retrocede en cuanto detecta inconsistencia.
+//
+// Heurísticas:
+//   - MRV  (Minimum Remaining Values): elige la variable cuyo dominio
+//     reducido sea menor. Tie-break: orden canónico.
+//   - LCV  (Least Constraining Value): ordena los valores candidatos
+//     priorizando el que MENOS reduzca los dominios de los vecinos.
+//   - AC-3 inicial: contrae dominios antes de empezar y, si está activo,
+//     re-aplica AC-3 tras cada asignación (maintaining arc consistency).
+//
+// La búsqueda usa un único árbol con copias incrementales de dominios.
+// Para problemas pequeños/medianos (sudoku, n-queens hasta ~20) es
+// suficiente; para escalar, sustituir copias por trailing.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.backtrack = backtrack;
+exports.allSolutions = allSolutions;
+const ac3_1 = require("./ac3");
+/**
+ * Comprueba si una asignación parcial respeta todas las restricciones
+ * cuyas variables ya están todas asignadas. Las restricciones con
+ * variables aún sin asignar se posponen.
+ */
+function consistent(csp, assignment) {
+    for (const c of csp.constraints) {
+        let allAssigned = true;
+        const vals = [];
+        for (const v of c.vars) {
+            const a = assignment.get(v);
+            if (a === undefined) {
+                allAssigned = false;
+                break;
+            }
+            vals.push(a);
+        }
+        if (!allAssigned)
+            continue;
+        if (!c.predicate(vals))
+            return false;
+    }
+    return true;
+}
+/**
+ * Selecciona la próxima variable a asignar.
+ * Con MRV: la de dominio reducido más pequeño (rompiendo empates por
+ * orden canónico de `csp.variables`). Sin MRV: la primera no asignada
+ * en orden canónico.
+ */
+function selectUnassigned(csp, domains, assignment, mrv) {
+    if (!mrv) {
+        for (const v of csp.variables) {
+            if (!assignment.has(v))
+                return v;
+        }
+        return null;
+    }
+    let best = null;
+    let bestSize = Infinity;
+    for (const v of csp.variables) {
+        if (assignment.has(v))
+            continue;
+        const d = domains.get(v);
+        const size = d ? d.length : Infinity;
+        if (size < bestSize) {
+            bestSize = size;
+            best = v;
+        }
+    }
+    return best;
+}
+/**
+ * Ordena los valores del dominio actual de `variable` según LCV:
+ * el valor que "menos restringe" a los vecinos va primero. La
+ * métrica usada es la suma de # de eliminaciones que provocaría
+ * en los dominios de los vecinos binarios.
+ */
+function orderValues(csp, domains, variable, lcv) {
+    const dom = domains.get(variable) ?? [];
+    if (!lcv)
+        return [...dom];
+    // Para cada valor, calcular cuánto restringiría a los vecinos
+    // binarios. Menos restricción → menor "cost".
+    const binNeighbors = [];
+    for (const c of csp.constraints) {
+        if (c.vars.length !== 2)
+            continue;
+        const [a, b] = c.vars;
+        if (a === variable && b !== undefined)
+            binNeighbors.push({ other: b, constraint: c });
+        else if (b === variable && a !== undefined)
+            binNeighbors.push({ other: a, constraint: c });
+    }
+    const scored = dom.map((val) => {
+        let cost = 0;
+        for (const { other, constraint } of binNeighbors) {
+            const otherDom = domains.get(other) ?? [];
+            for (const w of otherDom) {
+                // Alineación: el predicado espera tupla en orden de constraint.vars.
+                const [v0] = constraint.vars;
+                const tuple = v0 === variable ? [val, w] : [w, val];
+                if (!constraint.predicate(tuple))
+                    cost++;
+            }
+        }
+        return { val, cost };
+    });
+    scored.sort((a, b) => a.cost - b.cost);
+    return scored.map((e) => e.val);
+}
+/**
+ * Backtracking search. Si `useAC3` está activo, también aplica AC-3
+ * tras cada asignación (Maintaining Arc Consistency, MAC).
+ *
+ * Devuelve la primera solución encontrada o `null` si UNSAT. Para
+ * enumerar todas las soluciones, ver `allSolutions`.
+ */
+function backtrack(csp, opts = {}) {
+    const useAC3 = opts.useAC3 ?? true;
+    const mrv = opts.mrv ?? true;
+    const lcv = opts.lcv ?? true;
+    const maxIter = opts.maxIterations ?? 1_000_000;
+    // Copia inicial de dominios.
+    const initialDomains = new Map();
+    for (const [k, v] of csp.domains)
+        initialDomains.set(k, [...v]);
+    // AC-3 inicial.
+    if (useAC3) {
+        if (!(0, ac3_1.ac3InPlace)(csp, initialDomains)) {
+            return { solution: null, iterations: 0, failures: 0 };
+        }
+    }
+    const stats = { iterations: 0, failures: 0 };
+    function recurse(assignment, domains) {
+        if (stats.iterations >= maxIter)
+            return null;
+        stats.iterations++;
+        if (assignment.size === csp.variables.length) {
+            // Todas asignadas, verificación final por seguridad.
+            if (consistent(csp, assignment))
+                return new Map(assignment);
+            return null;
+        }
+        const variable = selectUnassigned(csp, domains, assignment, mrv);
+        if (variable === null)
+            return null;
+        const orderedValues = orderValues(csp, domains, variable, lcv);
+        for (const value of orderedValues) {
+            assignment.set(variable, value);
+            if (consistent(csp, assignment)) {
+                // Domain snapshot para propagación.
+                const snapshot = new Map();
+                for (const [k, v] of domains)
+                    snapshot.set(k, [...v]);
+                snapshot.set(variable, [value]);
+                let ok = true;
+                if (useAC3) {
+                    ok = (0, ac3_1.ac3InPlace)(csp, snapshot);
+                }
+                if (ok) {
+                    const result = recurse(assignment, snapshot);
+                    if (result)
+                        return result;
+                }
+            }
+            else {
+                stats.failures++;
+            }
+            assignment.delete(variable);
+        }
+        stats.failures++;
+        return null;
+    }
+    const solution = recurse(new Map(), initialDomains);
+    return { solution, iterations: stats.iterations, failures: stats.failures };
+}
+/**
+ * Enumera hasta `maxSolutions` soluciones del CSP. Útil para contar
+ * soluciones simétricas (e.g. n-queens completo, sudoku no-único).
+ */
+function allSolutions(csp, maxSolutions = 100, opts = {}) {
+    const useAC3 = opts.useAC3 ?? true;
+    const mrv = opts.mrv ?? true;
+    const lcv = opts.lcv ?? true;
+    const maxIter = opts.maxIterations ?? 5_000_000;
+    const solutions = [];
+    const initialDomains = new Map();
+    for (const [k, v] of csp.domains)
+        initialDomains.set(k, [...v]);
+    if (useAC3 && !(0, ac3_1.ac3InPlace)(csp, initialDomains))
+        return solutions;
+    let iterations = 0;
+    function recurse(assignment, domains) {
+        if (solutions.length >= maxSolutions)
+            return;
+        if (iterations >= maxIter)
+            return;
+        iterations++;
+        if (assignment.size === csp.variables.length) {
+            if (consistent(csp, assignment))
+                solutions.push(new Map(assignment));
+            return;
+        }
+        const variable = selectUnassigned(csp, domains, assignment, mrv);
+        if (variable === null)
+            return;
+        const orderedValues = orderValues(csp, domains, variable, lcv);
+        for (const value of orderedValues) {
+            if (solutions.length >= maxSolutions)
+                return;
+            assignment.set(variable, value);
+            if (consistent(csp, assignment)) {
+                const snapshot = new Map();
+                for (const [k, v] of domains)
+                    snapshot.set(k, [...v]);
+                snapshot.set(variable, [value]);
+                let ok = true;
+                if (useAC3)
+                    ok = (0, ac3_1.ac3InPlace)(csp, snapshot);
+                if (ok)
+                    recurse(assignment, snapshot);
+            }
+            assignment.delete(variable);
+        }
+    }
+    recurse(new Map(), initialDomains);
+    return solutions;
+}
+//# sourceMappingURL=backtrack.js.map

package/dist/runtime/csp/backtrack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backtrack.js","sourceRoot":"","sources":["../../../src/runtime/csp/backtrack.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,uEAAuE;AACvE,gDAAgD;AAChD,EAAE;AACF,eAAe;AACf,sEAAsE;AACtE,qDAAqD;AACrD,qEAAqE;AACrE,oEAAoE;AACpE,yEAAyE;AACzE,yEAAyE;AACzE,EAAE;AACF,uEAAuE;AACvE,mEAAmE;AACnE,2DAA2D;AAC3D,+DAA+D;;AAwG/D,8BA4DC;AAMD,oCAgDC;AAxND,+BAAmC;AAGnC;;;;GAIG;AACH,SAAS,UAAU,CAAO,GAAc,EAAE,UAAqB;IAC7D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,WAAW,GAAG,IAAI,CAAC;QACvB,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpB,WAAW,GAAG,KAAK,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,WAAW;YAAE,SAAS;QAC3B,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;IACvC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,GAAc,EACd,OAAoB,EACpB,UAAqB,EACrB,GAAY;IAEZ,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,GAAa,IAAI,CAAC;IAC1B,IAAI,QAAQ,GAAG,QAAQ,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC9B,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAChC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YACpB,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAO,GAAc,EAAE,OAAoB,EAAE,QAAW,EAAE,GAAY;IACxF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACxC,IAAI,CAAC,GAAG;QAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IAE1B,8DAA8D;IAC9D,8CAA8C;IAC9C,MAAM,YAAY,GAAsD,EAAE,CAAC;IAC3E,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,SAAS;YAAE,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;aACjF,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,SAAS;YAAE,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,MAAM,MAAM,GAAoC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC9D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,YAAY,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,qEAAqE;gBACrE,MAAM,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC;gBAC7B,MAAM,KAAK,GAAQ,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBACzD,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC;oBAAE,IAAI,EAAE,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAO,GAAc,EAAE,OAAyB,EAAE;IACzE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,IAAI,SAAS,CAAC;IAEhD,6BAA6B;IAC7B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO;QAAE,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhE,gBAAgB;IAChB,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC;YACrC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QACxD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAE7C,SAAS,OAAO,CAAC,UAAqB,EAAE,OAAoB;QAC1D,IAAI,KAAK,CAAC,UAAU,IAAI,OAAO;YAAE,OAAO,IAAI,CAAC;QAC7C,KAAK,CAAC,UAAU,EAAE,CAAC;QAEnB,IAAI,UAAU,CAAC,IAAI,KAAK,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YAC7C,qDAAqD;YACrD,IAAI,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC;gBAAE,OAAO,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;YAC5D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAEnC,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAChC,IAAI,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC;gBAChC,oCAAoC;gBACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;gBACnC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;gBAEhC,IAAI,EAAE,GAAG,IAAI,CAAC;gBACd,IAAI,MAAM,EAAE,CAAC;oBACX,EAAE,GAAG,IAAA,gBAAU,EAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBACjC,CAAC;gBACD,IAAI,EAAE,EAAE,CAAC;oBACP,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;oBAC7C,IAAI,MAAM;wBAAE,OAAO,MAAM,CAAC;gBAC5B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnB,CAAC;YACD,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,CAAC,QAAQ,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,GAAG,EAAQ,EAAE,cAAc,CAAC,CAAC;IAC1D,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;AAC9E,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAC1B,GAAc,EACd,YAAY,GAAG,GAAG,EAClB,OAAyB,EAAE;IAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,IAAI,SAAS,CAAC;IAEhD,MAAM,SAAS,GAAqB,EAAE,CAAC;IACvC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO;QAAE,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,MAAM,IAAI,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,cAAc,CAAC;QAAE,OAAO,SAAS,CAAC;IAEjE,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,SAAS,OAAO,CAAC,UAAqB,EAAE,OAAoB;QAC1D,IAAI,SAAS,CAAC,MAAM,IAAI,YAAY;YAAE,OAAO;QAC7C,IAAI,UAAU,IAAI,OAAO;YAAE,OAAO;QAClC,UAAU,EAAE,CAAC;QAEb,IAAI,UAAU,CAAC,IAAI,KAAK,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YAC7C,IAAI,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC;gBAAE,SAAS,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;YACrE,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO;QAE9B,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,IAAI,SAAS,CAAC,MAAM,IAAI,YAAY;gBAAE,OAAO;YAC7C,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAChC,IAAI,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;gBACnC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChC,IAAI,EAAE,GAAG,IAAI,CAAC;gBACd,IAAI,MAAM;oBAAE,EAAE,GAAG,IAAA,gBAAU,EAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC3C,IAAI,EAAE;oBAAE,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YACxC,CAAC;YACD,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,GAAG,EAAQ,EAAE,cAAc,CAAC,CAAC;IACzC,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/runtime/csp/builtins.d.ts

@@ -0,0 +1,27 @@
+/**
+ * k-coloreo de un grafo no dirigido.
+ *
+ * Variables: nodos del grafo.
+ * Dominios:  {0, 1, ..., numColors-1}.
+ * Restricción binaria por arista (u, v): color(u) ≠ color(v).
+ *
+ * Devuelve un mapeo nodo → color o `null` si el grafo no es
+ * k-coloreable.
+ */
+export declare function graphColoring(graph: {
+    nodes: string[];
+    edges: Array<[string, string]>;
+}, numColors: number): Map<string, number> | null;
+/**
+ * N-queens. Modelo CSP estándar:
+ *   Variables: row 0..n-1 (una reina por fila).
+ *   Dominio: columna ∈ {0, ..., n-1}.
+ *   Restricción binaria entre filas (i, j):
+ *     col(i) ≠ col(j)            (no misma columna)
+ *     |col(i) - col(j)| ≠ |i-j|  (no misma diagonal)
+ *
+ * Devuelve un array `cols` donde `cols[r]` es la columna de la
+ * reina en la fila r, o `null` si no hay solución (n=2, n=3).
+ */
+export declare function nQueens(n: number): number[] | null;
+//# sourceMappingURL=builtins.d.ts.map

package/dist/runtime/csp/builtins.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"builtins.d.ts","sourceRoot":"","sources":["../../../src/runtime/csp/builtins.ts"],"names":[],"mappings":"AAUA;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,EAC1D,SAAS,EAAE,MAAM,GAChB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAgC5B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAmClD"}

package/dist/runtime/csp/builtins.js

@@ -0,0 +1,109 @@
+"use strict";
+// ============================================================
+// CSPs predefinidos: graph coloring y N-queens.
+// ============================================================
+// Ambos se modelan como CSPs binarios estándar para que AC-3 sea
+// directamente aplicable.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphColoring = graphColoring;
+exports.nQueens = nQueens;
+const backtrack_1 = require("./backtrack");
+/**
+ * k-coloreo de un grafo no dirigido.
+ *
+ * Variables: nodos del grafo.
+ * Dominios:  {0, 1, ..., numColors-1}.
+ * Restricción binaria por arista (u, v): color(u) ≠ color(v).
+ *
+ * Devuelve un mapeo nodo → color o `null` si el grafo no es
+ * k-coloreable.
+ */
+function graphColoring(graph, numColors) {
+    if (numColors <= 0)
+        return null;
+    const colors = [];
+    for (let i = 0; i < numColors; i++)
+        colors.push(i);
+    const domains = new Map();
+    for (const n of graph.nodes)
+        domains.set(n, [...colors]);
+    const constraints = [];
+    // Deduplicar aristas (u,v) y (v,u).
+    const seen = new Set();
+    for (const [u, v] of graph.edges) {
+        if (u === v) {
+            // Self-loop ⇒ trivialmente UNSAT.
+            return null;
+        }
+        const key = u < v ? `${u}|${v}` : `${v}|${u}`;
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        constraints.push({
+            vars: [u, v],
+            predicate: ([a, b]) => a !== b,
+        });
+    }
+    const csp = {
+        variables: [...graph.nodes],
+        domains,
+        constraints,
+    };
+    const result = (0, backtrack_1.backtrack)(csp);
+    return result.solution;
+}
+/**
+ * N-queens. Modelo CSP estándar:
+ *   Variables: row 0..n-1 (una reina por fila).
+ *   Dominio: columna ∈ {0, ..., n-1}.
+ *   Restricción binaria entre filas (i, j):
+ *     col(i) ≠ col(j)            (no misma columna)
+ *     |col(i) - col(j)| ≠ |i-j|  (no misma diagonal)
+ *
+ * Devuelve un array `cols` donde `cols[r]` es la columna de la
+ * reina en la fila r, o `null` si no hay solución (n=2, n=3).
+ */
+function nQueens(n) {
+    if (n <= 0)
+        return null;
+    if (n === 1)
+        return [0];
+    const variables = [];
+    for (let i = 0; i < n; i++)
+        variables.push(i);
+    const domains = new Map();
+    for (let i = 0; i < n; i++) {
+        const d = [];
+        for (let j = 0; j < n; j++)
+            d.push(j);
+        domains.set(i, d);
+    }
+    const constraints = [];
+    for (let i = 0; i < n; i++) {
+        for (let j = i + 1; j < n; j++) {
+            const rowDiff = j - i;
+            constraints.push({
+                vars: [i, j],
+                predicate: ([ci, cj]) => {
+                    if (ci === undefined || cj === undefined)
+                        return false;
+                    if (ci === cj)
+                        return false;
+                    if (Math.abs(ci - cj) === rowDiff)
+                        return false;
+                    return true;
+                },
+            });
+        }
+    }
+    const csp = { variables, domains, constraints };
+    const result = (0, backtrack_1.backtrack)(csp);
+    if (!result.solution)
+        return null;
+    const out = new Array(n).fill(-1);
+    for (const [row, col] of result.solution)
+        out[row] = col;
+    return out;
+}
+//# sourceMappingURL=builtins.js.map

package/dist/runtime/csp/builtins.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builtins.js","sourceRoot":"","sources":["../../../src/runtime/csp/builtins.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,iEAAiE;AACjE,0BAA0B;AAC1B,+DAA+D;;AAe/D,sCAmCC;AAaD,0BAmCC;AAhGD,2CAAwC;AAGxC;;;;;;;;;GASG;AACH,SAAgB,aAAa,CAC3B,KAA0D,EAC1D,SAAiB;IAEjB,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAEzD,MAAM,WAAW,GAAiC,EAAE,CAAC;IACrD,oCAAoC;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,kCAAkC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACZ,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;IAED,MAAM,GAAG,GAAwB;QAC/B,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAC3B,OAAO;QACP,WAAW;KACZ,CAAC;IACF,MAAM,MAAM,GAAG,IAAA,qBAAS,EAAC,GAAG,CAAC,CAAC;IAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC;AACzB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAExB,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAa,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,WAAW,GAAiC,EAAE,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;YACtB,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACZ,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE;oBACtB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;wBAAE,OAAO,KAAK,CAAC;oBACvD,IAAI,EAAE,KAAK,EAAE;wBAAE,OAAO,KAAK,CAAC;oBAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO;wBAAE,OAAO,KAAK,CAAC;oBAChD,OAAO,IAAI,CAAC;gBACd,CAAC;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAwB,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IACrE,MAAM,MAAM,GAAG,IAAA,qBAAS,EAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,GAAG,GAAa,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/runtime/csp/index.d.ts

@@ -0,0 +1,5 @@
+export type { CSP, CSPResult, Constraint, BacktrackOptions } from './types';
+export { ac3, ac3InPlace } from './ac3';
+export { backtrack, allSolutions } from './backtrack';
+export { graphColoring, nQueens } from './builtins';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/csp/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/csp/index.ts"],"names":[],"mappings":"AAWA,YAAY,EAAE,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC5E,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,OAAO,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC"}

package/dist/runtime/csp/index.js

@@ -0,0 +1,23 @@
+"use strict";
+// ============================================================
+// ST CSP — barrel público.
+// ============================================================
+// API:
+//   ac3(csp)                      → { consistent, reducedDomains }
+//   backtrack(csp, opts?)         → CSPResult  (primera solución)
+//   allSolutions(csp, max?, opts?) → Map[]     (enumeración)
+//   graphColoring(graph, k)       → Map<nodo, color> | null
+//   nQueens(n)                    → number[] | null
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nQueens = exports.graphColoring = exports.allSolutions = exports.backtrack = exports.ac3InPlace = exports.ac3 = void 0;
+var ac3_1 = require("./ac3");
+Object.defineProperty(exports, "ac3", { enumerable: true, get: function () { return ac3_1.ac3; } });
+Object.defineProperty(exports, "ac3InPlace", { enumerable: true, get: function () { return ac3_1.ac3InPlace; } });
+var backtrack_1 = require("./backtrack");
+Object.defineProperty(exports, "backtrack", { enumerable: true, get: function () { return backtrack_1.backtrack; } });
+Object.defineProperty(exports, "allSolutions", { enumerable: true, get: function () { return backtrack_1.allSolutions; } });
+var builtins_1 = require("./builtins");
+Object.defineProperty(exports, "graphColoring", { enumerable: true, get: function () { return builtins_1.graphColoring; } });
+Object.defineProperty(exports, "nQueens", { enumerable: true, get: function () { return builtins_1.nQueens; } });
+//# sourceMappingURL=index.js.map

package/dist/runtime/csp/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/csp/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;AAC/D,OAAO;AACP,mEAAmE;AACnE,kEAAkE;AAClE,6DAA6D;AAC7D,4DAA4D;AAC5D,oDAAoD;AACpD,+DAA+D;;;AAG/D,6BAAwC;AAA/B,0FAAA,GAAG,OAAA;AAAE,iGAAA,UAAU,OAAA;AACxB,yCAAsD;AAA7C,sGAAA,SAAS,OAAA;AAAE,yGAAA,YAAY,OAAA;AAChC,uCAAoD;AAA3C,yGAAA,aAAa,OAAA;AAAE,mGAAA,OAAO,OAAA"}