@stevenvo780/st-lang 4.7.0 → 4.8.0

package/dist/namespaces/reasoning.d.ts

@@ -16,11 +16,12 @@ import * as beliefRevision from '../reasoning/belief-revision';
 import * as abduction from '../reasoning/abduction';
 import * as markovLogic from '../reasoning/markov-logic';
 import * as bayesian from '../reasoning/bayesian';
+import * as probabilistic from '../reasoning/probabilistic';
 import * as citationReasoning from '../reasoning/citation-reasoning';
 import * as hyperreal from '../reasoning/hyperreal';
 import * as antiUnification from '../runtime/anti-unification';
 import * as termRewriting from '../runtime/term-rewriting';
-export { argumentation, beliefRevision, abduction, markovLogic, bayesian, citationReasoning, hyperreal, antiUnification, termRewriting, };
+export { argumentation, beliefRevision, abduction, markovLogic, bayesian, probabilistic, citationReasoning, hyperreal, antiUnification, termRewriting, };
 export { TheoremCache, tryReuseProof } from '../runtime/theorem-cache';
 export type { CachedTheorem, CacheOptions as TheoremCacheOptions, CacheStats as TheoremCacheStats, ReuseResult as TheoremReuseResult, } from '../runtime/theorem-cache';
 //# sourceMappingURL=reasoning.d.ts.map

package/dist/namespaces/reasoning.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/namespaces/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,aAAa,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,cAAc,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,WAAW,MAAM,2BAA2B,CAAC;AACzD,OAAO,KAAK,QAAQ,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,iBAAiB,MAAM,iCAAiC,CAAC;AACrE,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,eAAe,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EACL,aAAa,EACb,cAAc,EACd,SAAS,EACT,WAAW,EACX,QAAQ,EACR,iBAAiB,EACjB,SAAS,EACT,eAAe,EACf,aAAa,GACd,CAAC;AAGF,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,YAAY,EACV,aAAa,EACb,YAAY,IAAI,mBAAmB,EACnC,UAAU,IAAI,iBAAiB,EAC/B,WAAW,IAAI,kBAAkB,GAClC,MAAM,0BAA0B,CAAC"}
+{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/namespaces/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,aAAa,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,cAAc,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,WAAW,MAAM,2BAA2B,CAAC;AACzD,OAAO,KAAK,QAAQ,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,aAAa,MAAM,4BAA4B,CAAC;AAC5D,OAAO,KAAK,iBAAiB,MAAM,iCAAiC,CAAC;AACrE,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,eAAe,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EACL,aAAa,EACb,cAAc,EACd,SAAS,EACT,WAAW,EACX,QAAQ,EACR,aAAa,EACb,iBAAiB,EACjB,SAAS,EACT,eAAe,EACf,aAAa,GACd,CAAC;AAGF,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,YAAY,EACV,aAAa,EACb,YAAY,IAAI,mBAAmB,EACnC,UAAU,IAAI,iBAAiB,EAC/B,WAAW,IAAI,kBAAkB,GAClC,MAAM,0BAA0B,CAAC"}

package/dist/namespaces/reasoning.js

@@ -46,7 +46,7 @@ var __importStar = (this && this.__importStar) || (function () {
     };
 })();
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.tryReuseProof = exports.TheoremCache = exports.termRewriting = exports.antiUnification = exports.hyperreal = exports.citationReasoning = exports.bayesian = exports.markovLogic = exports.abduction = exports.beliefRevision = exports.argumentation = void 0;
+exports.tryReuseProof = exports.TheoremCache = exports.termRewriting = exports.antiUnification = exports.hyperreal = exports.citationReasoning = exports.probabilistic = exports.bayesian = exports.markovLogic = exports.abduction = exports.beliefRevision = exports.argumentation = void 0;
 const argumentation = __importStar(require("../reasoning/argumentation"));
 exports.argumentation = argumentation;
 const beliefRevision = __importStar(require("../reasoning/belief-revision"));
@@ -57,6 +57,8 @@ const markovLogic = __importStar(require("../reasoning/markov-logic"));
 exports.markovLogic = markovLogic;
 const bayesian = __importStar(require("../reasoning/bayesian"));
 exports.bayesian = bayesian;
+const probabilistic = __importStar(require("../reasoning/probabilistic"));
+exports.probabilistic = probabilistic;
 const citationReasoning = __importStar(require("../reasoning/citation-reasoning"));
 exports.citationReasoning = citationReasoning;
 const hyperreal = __importStar(require("../reasoning/hyperreal"));

package/dist/namespaces/reasoning.js.map

@@ -1 +1 @@
-{"version":3,"file":"reasoning.js","sourceRoot":"","sources":["../../src/namespaces/reasoning.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,0EAA4D;AAW1D,sCAAa;AAVf,6EAA+D;AAW7D,wCAAc;AAVhB,kEAAoD;AAWlD,8BAAS;AAVX,uEAAyD;AAWvD,kCAAW;AAVb,gEAAkD;AAWhD,4BAAQ;AAVV,mFAAqE;AAWnE,8CAAiB;AAVnB,kEAAoD;AAWlD,8BAAS;AAVX,6EAA+D;AAW7D,0CAAe;AAVjB,yEAA2D;AAWzD,sCAAa;AAGf,+EAA+E;AAC/E,0DAAuE;AAA9D,6GAAA,YAAY,OAAA;AAAE,8GAAA,aAAa,OAAA"}
+{"version":3,"file":"reasoning.js","sourceRoot":"","sources":["../../src/namespaces/reasoning.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,0EAA4D;AAY1D,sCAAa;AAXf,6EAA+D;AAY7D,wCAAc;AAXhB,kEAAoD;AAYlD,8BAAS;AAXX,uEAAyD;AAYvD,kCAAW;AAXb,gEAAkD;AAYhD,4BAAQ;AAXV,0EAA4D;AAY1D,sCAAa;AAXf,mFAAqE;AAYnE,8CAAiB;AAXnB,kEAAoD;AAYlD,8BAAS;AAXX,6EAA+D;AAY7D,0CAAe;AAXjB,yEAA2D;AAYzD,sCAAa;AAGf,+EAA+E;AAC/E,0DAAuE;AAA9D,6GAAA,YAAY,OAAA;AAAE,8GAAA,aAAa,OAAA"}

package/dist/reasoning/combinatorial-games/index.d.ts

@@ -0,0 +1,105 @@
+export interface ImpartialGame<S> {
+    readonly initial: S;
+    readonly moves: (state: S) => S[];
+    readonly isTerminal: (state: S) => boolean;
+    readonly key?: (state: S) => string;
+}
+/**
+ * Minimum Excludant: menor entero ≥ 0 que no está en el conjunto.
+ * mex(∅) = 0, mex({0,1,3}) = 2, mex({1,2}) = 0.
+ */
+export declare function mex(set: Set<number>): number;
+/**
+ * Valor de Grundy del estado dado bajo el juego imparcial.
+ * Define: G(terminal) = 0; G(s) = mex { G(s') : s' ∈ moves(s) }.
+ * Usa caché (compartido entre llamadas) keyed por la clave canónica del estado.
+ */
+export declare function grundyValue<S>(game: ImpartialGame<S>, state: S, cache?: Map<string, number>): number;
+/**
+ * El jugador a mover gana sii grundy ≠ 0 (juego imparcial con convención
+ * normal: el que no puede mover, pierde).
+ */
+export declare function isWinning<S>(game: ImpartialGame<S>, state: S): boolean;
+/**
+ * Nim-sum: XOR bit a bit de los valores. Identidad del monoide de Grundy
+ * bajo suma disjunta de juegos imparciales.
+ */
+export declare function nimSum(values: number[]): number;
+/**
+ * Grundy de la suma disjunta de juegos imparciales independientes:
+ *   G(G1 + G2 + ... + Gn)(s1,...,sn) = G1(s1) ⊕ G2(s2) ⊕ ... ⊕ Gn(sn).
+ * Requiere games.length === states.length.
+ */
+export declare function multiGameGrundy<S>(games: Array<ImpartialGame<S>>, states: S[]): number;
+/**
+ * Nim clásico: varios montones de piedras, un movimiento = sacar ≥1
+ * piedras de un único montón. Pierde quien no puede mover (todos los
+ * montones a 0). Estado: vector de tamaños (normalizado, sin ceros y
+ * ordenado descendente para que el caché sea efectivo entre simetrías).
+ */
+export declare function nim(piles: number[]): ImpartialGame<number[]>;
+/**
+ * Nim 1D: una sola pila de `stones` piedras; sacar 1..stones. Equivale
+ * a `nim([stones])` pero con estado más compacto (un número).
+ */
+export declare function nim1d(stones: number): ImpartialGame<number>;
+/**
+ * Chomp: tablero rows×cols de "chocolate". Cada movida elige una casilla
+ * viva (true) y "muerde" todo el rectángulo abajo-derecha desde ella. La
+ * casilla (0,0) es veneno: quien la come pierde (convención misère
+ * implementada como: estado terminal cuando solo queda (0,0)).
+ *
+ * Estado: matriz booleana rows×cols con true = casilla viva.
+ *
+ * Nota: Chomp tiene posición ganadora conocida para el primer jugador
+ * en todo tablero ≥ 2×2 (argumento de robo de estrategia), pero la
+ * estrategia explícita es desconocida en general. Para 1×1 (sólo el
+ * veneno) el jugador a mover pierde, así que grundy = 0.
+ */
+export declare function chompGame(rows: number, cols: number): ImpartialGame<boolean[][]>;
+export interface SurrealNumber {
+    readonly left: SurrealNumber[];
+    readonly right: SurrealNumber[];
+}
+/** 0 = { | } — sin opciones para ninguno; "second player wins". */
+export declare const ZERO: SurrealNumber;
+/** 1 = { 0 | }. */
+export declare const ONE: SurrealNumber;
+/** -1 = { | 0 }. */
+export declare const MINUS_ONE: SurrealNumber;
+/** * (star) = { 0 | 0 } — primer jugador gana, no comparable a 0 (fuzzy). */
+export declare const STAR: SurrealNumber;
+/**
+ * Construye el surreal correspondiente al entero `n`.
+ *   0 = { | }
+ *   n = { n-1 | }            (n > 0)
+ *  -n = {     | -(n-1) }     (n < 0)
+ */
+export declare function fromInt(n: number): SurrealNumber;
+/**
+ * Negación: -G = { -GR | -GL }.
+ */
+export declare function negate(s: SurrealNumber): SurrealNumber;
+/**
+ * Suma de juegos: G + H = { GL+H, G+HL  |  GR+H, G+HR }.
+ */
+export declare function add(a: SurrealNumber, b: SurrealNumber): SurrealNumber;
+export declare function compare(a: SurrealNumber, b: SurrealNumber): -1 | 0 | 1;
+/**
+ * G es fuzzy con 0 sii no satisface G ≤ 0 ni 0 ≤ G — es decir, el
+ * primer jugador gana. * es el ejemplo canónico.
+ */
+export declare function isFuzzy(s: SurrealNumber): boolean;
+/**
+ * Simplificación parcial: elimina opciones dominadas en cada lado.
+ *
+ *   En la lista Left, una opción L1 domina a L2 si L1 ≥ L2 (entonces
+ *   L2 puede borrarse: el jugador Left preferirá L1).
+ *   En la lista Right, una opción R1 domina a R2 si R1 ≤ R2.
+ *
+ * No hace eliminación reversible ("bypass") — eso podría requerirse
+ * para canonicalización completa Conway. Para nuestros tests es
+ * suficiente.
+ */
+export declare function simplify(s: SurrealNumber): SurrealNumber;
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/combinatorial-games/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorial-games/index.ts"],"names":[],"mappings":"AAgCA,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAE3C,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC;CACrC;AAMD;;;GAGG;AACH,wBAAgB,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAI5C;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EACtB,KAAK,EAAE,CAAC,EACR,KAAK,GAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAA6B,GACrD,MAAM,CAgBR;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAEtE;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAI/C;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,CAYtF;AAID;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAuB5D;AAED;;;GAGG;AACH,wBAAgB,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAc3D;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC,CAsDhF;AAID,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,aAAa,EAAE,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC;CACjC;AAMD,mEAAmE;AACnE,eAAO,MAAM,IAAI,EAAE,aAAmC,CAAC;AAEvD,mBAAmB;AACnB,eAAO,MAAM,GAAG,EAAE,aAAuC,CAAC;AAE1D,oBAAoB;AACpB,eAAO,MAAM,SAAS,EAAE,aAAuC,CAAC;AAEhE,6EAA6E;AAC7E,eAAO,MAAM,IAAI,EAAE,aAA2C,CAAC;AAE/D;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,CAKhD;AAED;;GAEG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,aAAa,GAAG,aAAa,CAKtD;AAED;;GAEG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,GAAG,aAAa,CAQrE;AAwBD,wBAAgB,OAAO,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAOtE;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO,CAEjD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,aAAa,CAqCxD"}

package/dist/reasoning/combinatorial-games/index.js

@@ -0,0 +1,377 @@
+"use strict";
+// ============================================================
+// ST Combinatorial Games — Sprague-Grundy + Surreal numbers
+// ============================================================
+// Dos puntas complementarias del análisis de juegos combinatorios:
+//
+//   1. Juegos imparciales (mismas movidas para ambos jugadores) →
+//      Sprague-Grundy theorem: cada estado tiene un único valor
+//      grundy ∈ ℕ. Una posición es perdedora para el jugador a mover
+//      sii grundy = 0. Para juegos compuestos (suma disjunta), el
+//      valor se obtiene como XOR (nim-sum) de los componentes.
+//
+//   2. Juegos partisanos (movidas asimétricas Left/Right) → números
+//      surreales de Conway. Cada juego es un par { L | R } donde L y R
+//      son conjuntos de juegos (sus opciones). De aquí emergen los
+//      enteros, fracciones diádicas, ω, ε, *, ↑, etc.
+//
+// Convenciones:
+//   • Los juegos imparciales se modelan como una interfaz genérica
+//     `ImpartialGame<S>` con función de movidas y predicado terminal.
+//   • Los estados deben ser serializables a string (clave del caché);
+//     se exige una función `key` opcional; default = JSON.stringify.
+//   • Los surreales son recursivos. Sólo soportamos comparación y
+//     aritmética básica (add, negate, compare). Suficiente para
+//     verificar identidades como 1 + 1 = 2, *‖0, etc.
+//   • La simplificación de surreales aquí elimina opciones dominadas
+//     (Left domina a otra Left si es ≥; Right domina si es ≤). No
+//     hacemos "número simplicity" completo — sí suficiente para que
+//     los tests de identidad pasen sin explosión de tamaño.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.STAR = exports.MINUS_ONE = exports.ONE = exports.ZERO = void 0;
+exports.mex = mex;
+exports.grundyValue = grundyValue;
+exports.isWinning = isWinning;
+exports.nimSum = nimSum;
+exports.multiGameGrundy = multiGameGrundy;
+exports.nim = nim;
+exports.nim1d = nim1d;
+exports.chompGame = chompGame;
+exports.fromInt = fromInt;
+exports.negate = negate;
+exports.add = add;
+exports.compare = compare;
+exports.isFuzzy = isFuzzy;
+exports.simplify = simplify;
+function stateKey(game, state) {
+    return game.key ? game.key(state) : JSON.stringify(state);
+}
+/**
+ * Minimum Excludant: menor entero ≥ 0 que no está en el conjunto.
+ * mex(∅) = 0, mex({0,1,3}) = 2, mex({1,2}) = 0.
+ */
+function mex(set) {
+    let n = 0;
+    while (set.has(n))
+        n += 1;
+    return n;
+}
+/**
+ * Valor de Grundy del estado dado bajo el juego imparcial.
+ * Define: G(terminal) = 0; G(s) = mex { G(s') : s' ∈ moves(s) }.
+ * Usa caché (compartido entre llamadas) keyed por la clave canónica del estado.
+ */
+function grundyValue(game, state, cache = new Map()) {
+    const k = stateKey(game, state);
+    const cached = cache.get(k);
+    if (cached !== undefined)
+        return cached;
+    if (game.isTerminal(state)) {
+        cache.set(k, 0);
+        return 0;
+    }
+    const successors = game.moves(state);
+    const values = new Set();
+    for (const next of successors) {
+        values.add(grundyValue(game, next, cache));
+    }
+    const g = mex(values);
+    cache.set(k, g);
+    return g;
+}
+/**
+ * El jugador a mover gana sii grundy ≠ 0 (juego imparcial con convención
+ * normal: el que no puede mover, pierde).
+ */
+function isWinning(game, state) {
+    return grundyValue(game, state) !== 0;
+}
+/**
+ * Nim-sum: XOR bit a bit de los valores. Identidad del monoide de Grundy
+ * bajo suma disjunta de juegos imparciales.
+ */
+function nimSum(values) {
+    let acc = 0;
+    for (const v of values)
+        acc ^= v;
+    return acc;
+}
+/**
+ * Grundy de la suma disjunta de juegos imparciales independientes:
+ *   G(G1 + G2 + ... + Gn)(s1,...,sn) = G1(s1) ⊕ G2(s2) ⊕ ... ⊕ Gn(sn).
+ * Requiere games.length === states.length.
+ */
+function multiGameGrundy(games, states) {
+    if (games.length !== states.length) {
+        throw new Error(`multiGameGrundy: games (${games.length}) y states (${states.length}) deben tener igual longitud`);
+    }
+    const xs = [];
+    for (let i = 0; i < games.length; i += 1) {
+        // Cada juego tiene su propio caché.
+        xs.push(grundyValue(games[i], states[i]));
+    }
+    return nimSum(xs);
+}
+// ── Juegos pre-construidos ──────────────────────────────────
+/**
+ * Nim clásico: varios montones de piedras, un movimiento = sacar ≥1
+ * piedras de un único montón. Pierde quien no puede mover (todos los
+ * montones a 0). Estado: vector de tamaños (normalizado, sin ceros y
+ * ordenado descendente para que el caché sea efectivo entre simetrías).
+ */
+function nim(piles) {
+    if (piles.some((p) => p < 0 || !Number.isInteger(p))) {
+        throw new Error('nim: cada pila debe ser entero ≥ 0');
+    }
+    const canon = (s) => s.filter((x) => x > 0).sort((a, b) => b - a);
+    const initial = canon(piles);
+    return {
+        initial,
+        isTerminal: (s) => s.length === 0,
+        moves: (s) => {
+            const out = [];
+            for (let i = 0; i < s.length; i += 1) {
+                const v = s[i];
+                for (let take = 1; take <= v; take += 1) {
+                    const next = s.slice();
+                    next[i] = v - take;
+                    out.push(canon(next));
+                }
+            }
+            return out;
+        },
+        key: (s) => s.join(','),
+    };
+}
+/**
+ * Nim 1D: una sola pila de `stones` piedras; sacar 1..stones. Equivale
+ * a `nim([stones])` pero con estado más compacto (un número).
+ */
+function nim1d(stones) {
+    if (!Number.isInteger(stones) || stones < 0) {
+        throw new Error('nim1d: stones debe ser entero ≥ 0');
+    }
+    return {
+        initial: stones,
+        isTerminal: (s) => s === 0,
+        moves: (s) => {
+            const out = [];
+            for (let take = 1; take <= s; take += 1)
+                out.push(s - take);
+            return out;
+        },
+        key: (s) => String(s),
+    };
+}
+/**
+ * Chomp: tablero rows×cols de "chocolate". Cada movida elige una casilla
+ * viva (true) y "muerde" todo el rectángulo abajo-derecha desde ella. La
+ * casilla (0,0) es veneno: quien la come pierde (convención misère
+ * implementada como: estado terminal cuando solo queda (0,0)).
+ *
+ * Estado: matriz booleana rows×cols con true = casilla viva.
+ *
+ * Nota: Chomp tiene posición ganadora conocida para el primer jugador
+ * en todo tablero ≥ 2×2 (argumento de robo de estrategia), pero la
+ * estrategia explícita es desconocida en general. Para 1×1 (sólo el
+ * veneno) el jugador a mover pierde, así que grundy = 0.
+ */
+function chompGame(rows, cols) {
+    if (!Number.isInteger(rows) || !Number.isInteger(cols) || rows < 1 || cols < 1) {
+        throw new Error('chompGame: rows y cols deben ser enteros ≥ 1');
+    }
+    const buildInitial = () => {
+        const m = [];
+        for (let r = 0; r < rows; r += 1) {
+            const row = [];
+            for (let c = 0; c < cols; c += 1)
+                row.push(true);
+            m.push(row);
+        }
+        return m;
+    };
+    const isTerminal = (s) => {
+        // Terminal: sólo queda la casilla (0,0) viva (el veneno). El jugador
+        // a mover está obligado a comerla y pierde.
+        if (!s[0][0])
+            return true; // ya consumida (degenerate)
+        for (let r = 0; r < s.length; r += 1) {
+            const row = s[r];
+            for (let c = 0; c < row.length; c += 1) {
+                if (row[c] && !(r === 0 && c === 0))
+                    return false;
+            }
+        }
+        return true;
+    };
+    return {
+        initial: buildInitial(),
+        isTerminal,
+        moves: (s) => {
+            const out = [];
+            const R = s.length;
+            const C = s[0].length;
+            for (let r = 0; r < R; r += 1) {
+                for (let c = 0; c < C; c += 1) {
+                    if (!s[r][c])
+                        continue;
+                    if (r === 0 && c === 0 && !isTerminal(s)) {
+                        // Comer el veneno es legal sólo si es la única opción (terminal).
+                        // No lo ofrecemos como movida si hay otras casillas.
+                        continue;
+                    }
+                    // Comer (r,c) elimina toda casilla (r', c') con r' ≥ r y c' ≥ c.
+                    const next = s.map((row) => row.slice());
+                    for (let r2 = r; r2 < R; r2 += 1) {
+                        for (let c2 = c; c2 < C; c2 += 1) {
+                            next[r2][c2] = false;
+                        }
+                    }
+                    out.push(next);
+                }
+            }
+            return out;
+        },
+        key: (s) => s.map((row) => row.map((b) => (b ? '1' : '0')).join('')).join('/'),
+    };
+}
+function makeSurreal(left, right) {
+    return { left, right };
+}
+/** 0 = { | } — sin opciones para ninguno; "second player wins". */
+exports.ZERO = makeSurreal([], []);
+/** 1 = { 0 | }. */
+exports.ONE = makeSurreal([exports.ZERO], []);
+/** -1 = { | 0 }. */
+exports.MINUS_ONE = makeSurreal([], [exports.ZERO]);
+/** * (star) = { 0 | 0 } — primer jugador gana, no comparable a 0 (fuzzy). */
+exports.STAR = makeSurreal([exports.ZERO], [exports.ZERO]);
+/**
+ * Construye el surreal correspondiente al entero `n`.
+ *   0 = { | }
+ *   n = { n-1 | }            (n > 0)
+ *  -n = {     | -(n-1) }     (n < 0)
+ */
+function fromInt(n) {
+    if (!Number.isInteger(n))
+        throw new Error('fromInt: requiere entero');
+    if (n === 0)
+        return exports.ZERO;
+    if (n > 0)
+        return makeSurreal([fromInt(n - 1)], []);
+    return makeSurreal([], [fromInt(n + 1)]);
+}
+/**
+ * Negación: -G = { -GR | -GL }.
+ */
+function negate(s) {
+    return makeSurreal(s.right.map((r) => negate(r)), s.left.map((l) => negate(l)));
+}
+/**
+ * Suma de juegos: G + H = { GL+H, G+HL  |  GR+H, G+HR }.
+ */
+function add(a, b) {
+    const left = [];
+    for (const al of a.left)
+        left.push(add(al, b));
+    for (const bl of b.left)
+        left.push(add(a, bl));
+    const right = [];
+    for (const ar of a.right)
+        right.push(add(ar, b));
+    for (const br of b.right)
+        right.push(add(a, br));
+    return makeSurreal(left, right);
+}
+// ── Comparación de surreales ────────────────────────────────
+//
+// Definición Conway:
+//   G ≤ H  ⇔  ∀ GL.  ¬(H ≤ GL)     ∧     ∀ HR.  ¬(HR ≤ G)
+// Equivalentemente:
+//   G ≥ H  ⇔  H ≤ G
+//   G || H (fuzzy/incomparable) ⇔  ¬(G ≤ H) ∧ ¬(H ≤ G)
+//
+// `compare(a, b)` devuelve -1 si a<b, 1 si a>b, 0 si a==b. Si son
+// incomparables (fuzzy) lanza error explicito — usá `isFuzzy` antes o
+// `leq`/`geq` directamente.
+function leq(a, b) {
+    for (const al of a.left) {
+        if (leq(b, al))
+            return false;
+    }
+    for (const br of b.right) {
+        if (leq(br, a))
+            return false;
+    }
+    return true;
+}
+function compare(a, b) {
+    const ab = leq(a, b);
+    const ba = leq(b, a);
+    if (ab && ba)
+        return 0;
+    if (ab && !ba)
+        return -1;
+    if (!ab && ba)
+        return 1;
+    throw new Error('compare: surreales incomparables (fuzzy). Usá isFuzzy / leq / geq.');
+}
+/**
+ * G es fuzzy con 0 sii no satisface G ≤ 0 ni 0 ≤ G — es decir, el
+ * primer jugador gana. * es el ejemplo canónico.
+ */
+function isFuzzy(s) {
+    return !leq(s, exports.ZERO) && !leq(exports.ZERO, s);
+}
+/**
+ * Simplificación parcial: elimina opciones dominadas en cada lado.
+ *
+ *   En la lista Left, una opción L1 domina a L2 si L1 ≥ L2 (entonces
+ *   L2 puede borrarse: el jugador Left preferirá L1).
+ *   En la lista Right, una opción R1 domina a R2 si R1 ≤ R2.
+ *
+ * No hace eliminación reversible ("bypass") — eso podría requerirse
+ * para canonicalización completa Conway. Para nuestros tests es
+ * suficiente.
+ */
+function simplify(s) {
+    const simplifiedLeft = s.left.map((l) => simplify(l));
+    const simplifiedRight = s.right.map((r) => simplify(r));
+    // Dominancia Left: descartar L2 si existe L1 con L1 ≥ L2 (L1 ≠ L2).
+    const keptLeft = [];
+    for (let i = 0; i < simplifiedLeft.length; i += 1) {
+        const li = simplifiedLeft[i];
+        let dominated = false;
+        for (let j = 0; j < simplifiedLeft.length; j += 1) {
+            if (i === j)
+                continue;
+            const lj = simplifiedLeft[j];
+            if (leq(li, lj) && !leq(lj, li)) {
+                dominated = true;
+                break;
+            }
+        }
+        if (!dominated)
+            keptLeft.push(li);
+    }
+    // Dominancia Right: descartar R2 si existe R1 con R1 ≤ R2 (R1 ≠ R2).
+    const keptRight = [];
+    for (let i = 0; i < simplifiedRight.length; i += 1) {
+        const ri = simplifiedRight[i];
+        let dominated = false;
+        for (let j = 0; j < simplifiedRight.length; j += 1) {
+            if (i === j)
+                continue;
+            const rj = simplifiedRight[j];
+            if (leq(rj, ri) && !leq(ri, rj)) {
+                dominated = true;
+                break;
+            }
+        }
+        if (!dominated)
+            keptRight.push(ri);
+    }
+    return makeSurreal(keptLeft, keptRight);
+}
+//# sourceMappingURL=index.js.map

package/dist/reasoning/combinatorial-games/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorial-games/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;AAC/D,mEAAmE;AACnE,EAAE;AACF,kEAAkE;AAClE,gEAAgE;AAChE,qEAAqE;AACrE,kEAAkE;AAClE,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,uEAAuE;AACvE,mEAAmE;AACnE,sDAAsD;AACtD,EAAE;AACF,gBAAgB;AAChB,mEAAmE;AACnE,sEAAsE;AACtE,sEAAsE;AACtE,qEAAqE;AACrE,kEAAkE;AAClE,gEAAgE;AAChE,sDAAsD;AACtD,qEAAqE;AACrE,kEAAkE;AAClE,oEAAoE;AACpE,4DAA4D;AAC5D,+DAA+D;;;AAoB/D,kBAIC;AAOD,kCAoBC;AAMD,8BAEC;AAMD,wBAIC;AAOD,0CAYC;AAUD,kBAuBC;AAMD,sBAcC;AAeD,8BAsDC;AA+BD,0BAKC;AAKD,wBAKC;AAKD,kBAQC;AAwBD,0BAOC;AAMD,0BAEC;AAaD,4BAqCC;AA1VD,SAAS,QAAQ,CAAI,IAAsB,EAAE,KAAQ;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAgB,GAAG,CAAC,GAAgB;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,CAAC,IAAI,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CACzB,IAAsB,EACtB,KAAQ,EACR,QAA6B,IAAI,GAAG,EAAkB;IAEtD,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAI,IAAsB,EAAE,KAAQ;IAC3D,OAAO,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,SAAgB,MAAM,CAAC,MAAgB;IACrC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,GAAG,IAAI,CAAC,CAAC;IACjC,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,eAAe,CAAI,KAA8B,EAAE,MAAW;IAC5E,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,2BAA2B,KAAK,CAAC,MAAM,eAAe,MAAM,CAAC,MAAM,8BAA8B,CAClG,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,GAAa,EAAE,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,oCAAoC;QACpC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC;AACpB,CAAC;AAED,+DAA+D;AAE/D;;;;;GAKG;AACH,SAAgB,GAAG,CAAC,KAAe;IACjC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAW,EAAY,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO;QACL,OAAO;QACP,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QACjC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE;YACX,MAAM,GAAG,GAAe,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;oBACxC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;oBACvB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;oBACnB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;KACxB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,KAAK,CAAC,MAAc;IAClC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO;QACL,OAAO,EAAE,MAAM;QACf,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;QAC1B,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE;YACX,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC5D,OAAO,GAAG,CAAC;QACb,CAAC;QACD,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;KACtB,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,SAAS,CAAC,IAAY,EAAE,IAAY;IAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QAC/E,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,YAAY,GAAG,GAAgB,EAAE;QACrC,MAAM,CAAC,GAAgB,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,MAAM,GAAG,GAAc,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,CAAc,EAAW,EAAE;QAC7C,qEAAqE;QACrE,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,4BAA4B;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACpD,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,OAAO;QACL,OAAO,EAAE,YAAY,EAAE;QACvB,UAAU;QACV,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE;YACX,MAAM,GAAG,GAAkB,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC9B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAE,SAAS;oBACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;wBACzC,kEAAkE;wBAClE,qDAAqD;wBACrD,SAAS;oBACX,CAAC;oBACD,iEAAiE;oBACjE,MAAM,IAAI,GAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;oBACtD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;wBACjC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;4BACjC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;wBACvB,CAAC;oBACH,CAAC;oBACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;KAC/E,CAAC;AACJ,CAAC;AASD,SAAS,WAAW,CAAC,IAAqB,EAAE,KAAsB;IAChE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED,mEAAmE;AACtD,QAAA,IAAI,GAAkB,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAEvD,mBAAmB;AACN,QAAA,GAAG,GAAkB,WAAW,CAAC,CAAC,YAAI,CAAC,EAAE,EAAE,CAAC,CAAC;AAE1D,oBAAoB;AACP,QAAA,SAAS,GAAkB,WAAW,CAAC,EAAE,EAAE,CAAC,YAAI,CAAC,CAAC,CAAC;AAEhE,6EAA6E;AAChE,QAAA,IAAI,GAAkB,WAAW,CAAC,CAAC,YAAI,CAAC,EAAE,CAAC,YAAI,CAAC,CAAC,CAAC;AAE/D;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IACtE,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,YAAI,CAAC;IACzB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACpD,OAAO,WAAW,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAgB,MAAM,CAAC,CAAgB;IACrC,OAAO,WAAW,CAChB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAC7B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAC7B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,GAAG,CAAC,CAAgB,EAAE,CAAgB;IACpD,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/C,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACjD,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACjD,OAAO,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,+DAA+D;AAC/D,EAAE;AACF,qBAAqB;AACrB,0DAA0D;AAC1D,oBAAoB;AACpB,oBAAoB;AACpB,uDAAuD;AACvD,EAAE;AACF,kEAAkE;AAClE,sEAAsE;AACtE,4BAA4B;AAE5B,SAAS,GAAG,CAAC,CAAgB,EAAE,CAAgB;IAC7C,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IAC/B,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,OAAO,CAAC,CAAgB,EAAE,CAAgB;IACxD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,IAAI,EAAE,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC;IACzB,IAAI,CAAC,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,IAAI,KAAK,CAAC,oEAAoE,CAAC,CAAC;AACxF,CAAC;AAED;;;GAGG;AACH,SAAgB,OAAO,CAAC,CAAgB;IACtC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,YAAI,CAAC,IAAI,CAAC,GAAG,CAAC,YAAI,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,QAAQ,CAAC,CAAgB;IACvC,MAAM,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,oEAAoE;IACpE,MAAM,QAAQ,GAAoB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,qEAAqE;IACrE,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnD,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,OAAO,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC"}

package/dist/reasoning/mechanism-design/auctions.d.ts

@@ -0,0 +1,49 @@
+import type { AuctionResult } from './types';
+/**
+ * First-price sealed-bid: el ganador paga su propio bid.
+ *
+ * No es strategy-proof — el bidder racional shadea su bid bajo su
+ * valuation. Pero la regla es lo más simple del mundo.
+ */
+export declare function firstPriceSealed(bids: Map<string, number>): AuctionResult;
+/**
+ * Second-price sealed-bid (Vickrey): el ganador paga el segundo bid más
+ * alto. Es DSIC: bidding truthful es dominante.
+ *
+ * Si solo hay un bidder válido, paga 0 (no hay segundo precio). Esa es
+ * la convención estándar; en variantes con reserve, el reserve actúa
+ * como segundo precio si no hay otro bidder por encima.
+ */
+export declare function secondPriceSealed(bids: Map<string, number>): AuctionResult;
+/**
+ * English ascending auction: simulamos un reloj que sube en pasos de
+ * `increment`. Cada bidder sigue activo mientras el precio no supere
+ * su valuation. Cuando solo queda 1 activo, termina y paga el precio
+ * actual.
+ *
+ * Bajo bidders racionales (cada uno dropea exactamente en su valuation),
+ * el resultado es equivalente a second-price (el ganador paga ~ segundo
+ * valor más alto, módulo `increment`).
+ *
+ * Implementación: en vez de simular reloj, calculamos directo:
+ *   winner = bidder con max valuation
+ *   payment = ceil(secondHighest / increment) * increment   ≈ second + un step
+ *
+ * Para los tests usamos increment=1, lo que da payment ≈ second.
+ */
+export declare function englishAuction(bids: Map<string, number>, increment: number): AuctionResult;
+/**
+ * Dutch descending auction: reloj baja desde `initialPrice` con pasos
+ * `decrement`. El primer bidder en aceptar (precio ≤ su valuation)
+ * gana y paga ese precio.
+ *
+ * Estratégicamente, Dutch ≡ first-price sealed: cada bidder elige a qué
+ * precio aceptar, equivalente a elegir su bid. Implementamos via
+ * simulación discreta.
+ *
+ * `bidders.get(id)` = valor máximo que el bidder está dispuesto a pagar
+ * (su bid efectivo en el equivalente sealed). El primero en alcanzar
+ * un precio ≤ a su bid gana.
+ */
+export declare function dutchAuction(initialPrice: number, bidders: Map<string, number>, decrement: number): AuctionResult;
+//# sourceMappingURL=auctions.d.ts.map

package/dist/reasoning/mechanism-design/auctions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"auctions.d.ts","sourceRoot":"","sources":["../../../src/reasoning/mechanism-design/auctions.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAmB7C;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,aAAa,CAIzE;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,aAAa,CAsB1E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,aAAa,CAkC1F;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAC1B,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC5B,SAAS,EAAE,MAAM,GAChB,aAAa,CA6Bf"}