poker-flopsolve 0.2.0 → 0.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,2 @@
1
+
2
+ export { }
@@ -0,0 +1,57 @@
1
+ // src/engine-worker.ts
2
+ import { parentPort, workerData } from "worker_threads";
3
+
4
+ // src/engine.ts
5
+ var wasm = globalThis.WebAssembly;
6
+ var ENGINE_CONTROL = { generation: 0, done: 1, command: 2, mode: 3, traverser: 4, ready: 5, size: 8 };
7
+
8
+ // src/engine-worker.ts
9
+ var setup = workerData;
10
+ var { WebAssembly: wasm2 } = globalThis;
11
+ var memory = setup.memory;
12
+ var instance = new wasm2.Instance(setup.module, { env: { memory, abort: () => {
13
+ throw new Error("engine abort");
14
+ } } });
15
+ var engine = instance.exports;
16
+ engine.init(setup.header);
17
+ engine.setMaxActions(setup.maxActions);
18
+ engine.setExchange(...setup.exchange);
19
+ engine.setShard(...setup.shard);
20
+ engine.setPhase(0, 1);
21
+ var control = new Int32Array(setup.control);
22
+ var settings = new Float64Array(setup.settings);
23
+ var entries = setup.entryNodes.length;
24
+ var rowBytes = setup.stride * 4;
25
+ var partials = new Float32Array(memory.buffer, setup.partial, entries * setup.stride);
26
+ var [, reach] = setup.exchange;
27
+ var generation = Atomics.load(control, ENGINE_CONTROL.generation);
28
+ Atomics.add(control, ENGINE_CONTROL.ready, 1);
29
+ Atomics.notify(control, ENGINE_CONTROL.ready);
30
+ for (; ; ) {
31
+ Atomics.wait(control, ENGINE_CONTROL.generation, generation);
32
+ generation = Atomics.load(control, ENGINE_CONTROL.generation);
33
+ if (Atomics.load(control, ENGINE_CONTROL.command) === 1) break;
34
+ const mode = Atomics.load(control, ENGINE_CONTROL.mode);
35
+ const traverser = Atomics.load(control, ENGINE_CONTROL.traverser);
36
+ const [positive, negative, sum, weight, clamp] = settings;
37
+ for (let entry = 0; entry < entries; entry++) {
38
+ const slot = reach + entry * 2 * rowBytes;
39
+ const out = engine.runChance(
40
+ mode,
41
+ traverser,
42
+ setup.entryNodes[entry],
43
+ slot,
44
+ slot + rowBytes,
45
+ positive,
46
+ negative,
47
+ sum,
48
+ weight,
49
+ clamp
50
+ );
51
+ partials.set(new Float32Array(memory.buffer, out, setup.stride), entry * setup.stride);
52
+ }
53
+ Atomics.add(control, ENGINE_CONTROL.done, 1);
54
+ Atomics.notify(control, ENGINE_CONTROL.done);
55
+ }
56
+ parentPort?.close();
57
+ //# sourceMappingURL=engine-worker.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/engine-worker.ts","../src/engine.ts"],"sourcesContent":["/**\n * An engine worker: one thread of a WebAssembly solve.\n *\n * Purpose: walk this thread's slice of the runouts at the split round, over\n * the memory every thread shares, when the main thread signals. The protocol\n * is src/parallel.ts's: the main thread collects the reach each entry needs,\n * every thread walks its slice from each entry, the main thread adds the\n * slices up and finishes. Here all of it happens in shared WebAssembly\n * memory, so nothing is copied between threads but a few numbers of control.\n */\n\nimport { parentPort, workerData } from 'node:worker_threads';\nimport type { EngineExports, EngineWorkerSetup } from './engine.ts';\nimport { ENGINE_CONTROL } from './engine.ts';\n\nconst setup = workerData as EngineWorkerSetup;\nconst { WebAssembly: wasm } = globalThis as unknown as {\n\tWebAssembly: { Instance: new (module: unknown, imports: object) => { exports: Record<string, unknown> } };\n};\nconst memory = setup.memory as { buffer: SharedArrayBuffer };\nconst instance = new wasm.Instance(setup.module, { env: { memory, abort: () => { throw new Error('engine abort'); } } });\nconst engine = instance.exports as unknown as EngineExports;\nengine.init(setup.header);\nengine.setMaxActions(setup.maxActions);\nengine.setExchange(...setup.exchange);\nengine.setShard(...setup.shard);\nengine.setPhase(0, 1);\n\nconst control = new Int32Array(setup.control);\nconst settings = new Float64Array(setup.settings);\nconst entries = setup.entryNodes.length;\nconst rowBytes = setup.stride * 4;\nconst partials = new Float32Array(memory.buffer, setup.partial, entries * setup.stride);\nconst [, reach] = setup.exchange;\n\n// Latch the generation before announcing readiness, so no dispatch is missed.\nlet generation = Atomics.load(control, ENGINE_CONTROL.generation);\nAtomics.add(control, ENGINE_CONTROL.ready, 1);\nAtomics.notify(control, ENGINE_CONTROL.ready);\n\nfor (;;) {\n\tAtomics.wait(control, ENGINE_CONTROL.generation, generation);\n\tgeneration = Atomics.load(control, ENGINE_CONTROL.generation);\n\tif (Atomics.load(control, ENGINE_CONTROL.command) === 1) break;\n\tconst mode = Atomics.load(control, ENGINE_CONTROL.mode);\n\tconst traverser = Atomics.load(control, ENGINE_CONTROL.traverser);\n\tconst [positive, negative, sum, weight, clamp] = settings;\n\tfor (let entry = 0; entry < entries; entry++) {\n\t\tconst slot = reach + entry * 2 * rowBytes;\n\t\tconst out = engine.runChance(\n\t\t\tmode, traverser, setup.entryNodes[entry], slot, slot + rowBytes, positive, negative, sum, weight, clamp,\n\t\t);\n\t\tpartials.set(new Float32Array(memory.buffer, out, setup.stride), entry * setup.stride);\n\t}\n\tAtomics.add(control, ENGINE_CONTROL.done, 1);\n\tAtomics.notify(control, ENGINE_CONTROL.done);\n}\n\nparentPort?.close();\n","/**\n * The WebAssembly traversal engine, set up.\n *\n * Purpose: lay a prepared spot out in one WebAssembly memory for\n * `assembly/engine.ts`, and give the solver its storage and a root traversal.\n *\n * The engine keeps the accumulators in its own memory as 32-bit floats; the\n * solver's `regret` and `strategySum` are views onto them, so everything that\n * reads storage from JavaScript — strategy queries, warm starts, `valuesAt` —\n * sees the very same numbers. It runs single-threaded, with 32-bit storage,\n * where WebAssembly SIMD is available; otherwise the JavaScript traversal in\n * cfr.ts runs.\n */\n\nimport { COMBOS, DECK } from './cards.ts';\nimport type { ActiveLists, Layout, PlayerIndex, RootTraversal } from './cfr.ts';\nimport { dcfrFactors, Mode, treeDepth } from './cfr.ts';\nimport type { HandSpace } from './hands.ts';\nimport type { Runouts } from './runouts.ts';\nimport type { Tree } from './tree.ts';\nimport { ENGINE_WASM } from './wasm/engine.ts';\nimport { ENGINE_SHARED_WASM } from './wasm/engine-shared.ts';\nimport type { ShardPlan } from './parallel.ts';\n\n/** The parts of the WebAssembly API used here, typed locally: the project builds without DOM typings. */\ninterface WasmApi {\n\tvalidate(bytes: Uint8Array): boolean;\n\tModule: new (bytes: Uint8Array) => object;\n\tInstance: new (module: object, imports: object) => { exports: Record<string, unknown> };\n\tMemory: new (descriptor: { initial: number; maximum?: number; shared?: boolean }) => { buffer: ArrayBuffer };\n}\n\nconst wasm = (globalThis as unknown as { WebAssembly?: WasmApi }).WebAssembly;\nconst modules: Record<'plain' | 'shared', object | null | undefined> = { plain: undefined, shared: undefined };\n\n/** The compiled engine, over plain or shared memory; null where unavailable. */\nexport function compiledEngine(kind: 'plain' | 'shared'): object | null {\n\tif (modules[kind] !== undefined) return modules[kind]!;\n\tmodules[kind] = null;\n\ttry {\n\t\tif (!wasm) return null;\n\t\tconst text = kind === 'plain' ? ENGINE_WASM : ENGINE_SHARED_WASM;\n\t\tconst bytes = Uint8Array.from(atob(text), (c) => c.charCodeAt(0));\n\t\tif (!wasm.validate(bytes)) return null;\n\t\tmodules[kind] = new wasm.Module(bytes);\n\t} catch {\n\t\tmodules[kind] = null;\n\t}\n\treturn modules[kind]!;\n}\n\nfunction compiled(): object | null {\n\treturn compiledEngine('plain');\n}\n\n/** Whether this platform can run the WebAssembly engine. */\nexport function engineAvailable(): boolean {\n\treturn compiled() !== null;\n}\n\n/** What the engine needs from a prepared spot. */\nexport interface EngineInput {\n\treadonly tree: Tree;\n\treadonly runouts: Runouts;\n\treadonly players: readonly [PlayerIndex, PlayerIndex];\n\treadonly layout: Layout;\n\treadonly active: ActiveLists;\n\treadonly hands: HandSpace;\n\treadonly runoutWeight: Float64Array;\n\treadonly chipScale: number;\n}\n\n/** A running engine. */\nexport interface Engine {\n\t/** The accumulators, as views onto the engine's memory. */\n\treadonly regret: Float32Array;\n\treadonly strategySum: Float32Array;\n\t/** Install as the solver's root traversal; `dcfr` picks the update rule. */\n\troot(dcfr: boolean): RootTraversal;\n\t/** Release worker threads, if any. */\n\tclose(): void;\n\t/** Threads doing the work, this one included. */\n\treadonly threads: number;\n}\n\n/** What an engine worker needs; see src/engine-worker.ts. */\nexport interface EngineWorkerSetup {\n\treadonly memory: unknown;\n\treadonly module: unknown;\n\treadonly header: number;\n\treadonly maxActions: number;\n\treadonly exchange: readonly [number, number, number, number];\n\treadonly shard: readonly [number, number, number];\n\treadonly entryNodes: Int32Array;\n\treadonly rootMe: number;\n\treadonly rootOpp: number;\n\treadonly partial: number;\n\treadonly stride: number;\n\treadonly control: SharedArrayBuffer;\n\treadonly settings: SharedArrayBuffer;\n}\n\n/** How a pool starts its workers; the platform layer supplies it. */\nexport type SpawnEngineWorker = (setup: EngineWorkerSetup, onError: (error: Error) => void) => { terminate(): void };\n\n/** Control slots shared with engine workers. */\nexport const ENGINE_CONTROL = { generation: 0, done: 1, command: 2, mode: 3, traverser: 4, ready: 5, size: 8 } as const;\n\n/**\n * Lay a spot out in a fresh memory and instantiate the engine over it, or\n * null where unavailable. With `pool`, the memory is shared and that many\n * threads split the runouts at the plan's round, as src/parallel.ts does for\n * the JavaScript engine.\n */\nexport function createEngine(\n\tinput: EngineInput,\n\tpool?: { plan: ShardPlan; threads: number; spawn: SpawnEngineWorker },\n): Engine | null {\n\tconst shared = pool !== undefined;\n\tconst compiledModule = compiledEngine(shared ? 'shared' : 'plain');\n\tif (!compiledModule || !wasm) return null;\n\tconst { tree, runouts, layout, active, hands } = input;\n\tconst threads = pool ? pool.threads : 1;\n\n\tconst flatten = (parts: readonly Int32Array[]): [Int32Array, Int32Array] => {\n\t\tconst bases = new Int32Array(parts.length + 1);\n\t\tfor (let i = 0; i < parts.length; i++) bases[i + 1] = bases[i] + parts[i].length;\n\t\tconst flat = new Int32Array(bases[parts.length]);\n\t\tparts.forEach((part, i) => flat.set(part, bases[i]));\n\t\treturn [bases, flat];\n\t};\n\tconst [upRound, upStart] = flatten(hands.upStart);\n\tconst [childRound, childStart] = flatten(runouts.childStart);\n\tconst [orbitRound, orbitStart] = flatten(runouts.orbitStart);\n\tconst maxCount = Math.max(4, ...active.count);\n\tconst stride = Math.ceil(maxCount / 4) * 4;\n\tconst maxActions = Math.max(1, layout.maxActions);\n\tconst depths = treeDepth(tree) + 2;\n\tconst rowBytes = stride * 4;\n\tconst depthBytes = rowBytes * (3 + 2 * maxActions);\n\n\tconst pieces: { data: ArrayBufferView | null; bytes: number }[] = [];\n\tconst add = (data: ArrayBufferView | null, bytes = data ? data.byteLength : 0): number => {\n\t\tpieces.push({ data, bytes: Math.ceil(Math.max(bytes, 4) / 16) * 16 });\n\t\treturn pieces.length - 1;\n\t};\n\t// Shared by every thread, in header order.\n\tconst common = [\n\t\tadd(tree.kind), add(tree.round), add(Uint8Array.from(tree.player, (p) => (p < 0 ? 255 : p))), add(tree.firstEdge),\n\t\tadd(tree.numEdges), add(tree.edgeChild), add(tree.payoff), add(layout.offset), add(layout.rowStart),\n\t\tadd(active.roundBase), add(active.start), add(Int32Array.from(active.count)), add(active.cardA), add(active.cardB),\n\t\tadd(active.strength), add(active.tieStart), add(active.ties), add(upRound), add(upStart), add(hands.up),\n\t\tadd(hands.sameStart), add(hands.same), add(childRound), add(childStart), add(orbitRound), add(orbitStart),\n\t\tadd(input.runoutWeight),\n\t\tadd(null, layout.totalSlots * 4), // regret\n\t\tadd(null, layout.totalSlots * 4), // strategy sums\n\t];\n\tconst REGRET = common[27];\n\tconst SUMS = common[28];\n\t// Each thread's own.\n\tconst own = Array.from({ length: threads }, () => ({\n\t\tbuffers: add(null, depths * depthBytes),\n\t\tcardSums: add(null, 52 * 8 + stride * 8),\n\t\trootMe: add(null, rowBytes),\n\t\trootOpp: add(null, rowBytes),\n\t\theader: add(null, 40 * 4),\n\t}));\n\t// The exchange between threads.\n\tconst entries = pool ? pool.plan.entryNodes.length : 0;\n\tconst entryIndexOf = pool ? add(pool.plan.entryIndexOf) : -1;\n\tconst reach = pool ? add(null, entries * 2 * rowBytes) : -1;\n\tconst values = pool ? add(null, entries * rowBytes) : -1;\n\tconst partials = pool ? add(null, (threads - 1) * entries * rowBytes) : -1;\n\n\tconst offsets: number[] = [];\n\tlet total = 64;\n\tfor (const piece of pieces) {\n\t\toffsets.push(total);\n\t\ttotal += piece.bytes;\n\t}\n\tif (total > 0xffff0000) return null; // past wasm32's 4 GB\n\tconst pages = Math.ceil(total / 65536) + 1;\n\tconst memory = shared ? new wasm.Memory({ initial: pages, maximum: pages, shared: true }) : new wasm.Memory({ initial: pages });\n\tconst bytes = new Uint8Array(memory.buffer);\n\tpieces.forEach((piece, i) => {\n\t\tif (piece.data) bytes.set(new Uint8Array(piece.data.buffer, piece.data.byteOffset, piece.data.byteLength), offsets[i]);\n\t});\n\tfor (const mine of own) {\n\t\tconst head = new Uint32Array(memory.buffer, offsets[mine.header], 40);\n\t\tcommon.forEach((slot, i) => (head[i] = offsets[slot]));\n\t\thead[29] = offsets[mine.buffers];\n\t\thead[30] = depthBytes;\n\t\thead[31] = rowBytes;\n\t\thead[32] = offsets[mine.cardSums];\n\t\thead[33] = input.chipScale;\n\t}\n\n\tconst instance = new wasm.Instance(compiledModule, { env: { memory, abort: () => { throw new Error('engine abort'); } } });\n\tconst exports = instance.exports as unknown as EngineExports;\n\texports.init(offsets[own[0].header]);\n\texports.setMaxActions(maxActions);\n\n\tconst regret = new Float32Array(memory.buffer, offsets[REGRET], layout.totalSlots);\n\tconst strategySum = new Float32Array(memory.buffer, offsets[SUMS], layout.totalSlots);\n\tconst me = new Float32Array(memory.buffer, offsets[own[0].rootMe], stride);\n\tconst opp = new Float32Array(memory.buffer, offsets[own[0].rootOpp], stride);\n\tconst result = new Float64Array(COMBOS);\n\tconst rootList = (player: 0 | 1): [number, number] => {\n\t\tconst slot = active.roundBase[0] * 2 + player;\n\t\treturn [active.start[slot], active.count[slot]];\n\t};\n\tconst settingsFor = (mode: number, iterWeight: number, dcfr: boolean): [number, number, number, number, number] => {\n\t\tif (mode === Mode.Train && dcfr) {\n\t\t\tconst { keepPositive, keepNegative, keepSum } = dcfrFactors(iterWeight);\n\t\t\treturn [keepPositive, keepNegative, keepSum, 1, 0];\n\t\t}\n\t\treturn [1, 1, 1, iterWeight, dcfr ? 0 : 1];\n\t};\n\n\t// Threads: workers over the same memory, each with its own header.\n\tlet control: Int32Array | null = null;\n\tlet settings: Float64Array | null = null;\n\tconst workers: { terminate(): void }[] = [];\n\tlet failure: Error | null = null;\n\tif (pool) {\n\t\tconst plan = pool.plan;\n\t\tconst controlBuffer = new SharedArrayBuffer(ENGINE_CONTROL.size * 4);\n\t\tconst settingsBuffer = new SharedArrayBuffer(8 * 8);\n\t\tcontrol = new Int32Array(controlBuffer);\n\t\tsettings = new Float64Array(settingsBuffer);\n\t\texports.setExchange(offsets[entryIndexOf], offsets[reach], offsets[values], stride);\n\t\tfor (let w = 1; w < threads; w++) {\n\t\t\tconst setup: EngineWorkerSetup = {\n\t\t\t\tmemory, module: compiledModule, header: offsets[own[w].header], maxActions,\n\t\t\t\texchange: [offsets[entryIndexOf], offsets[reach], offsets[values], stride],\n\t\t\t\tshard: [plan.round, plan.bounds[w], plan.bounds[w + 1]],\n\t\t\t\tentryNodes: plan.entryNodes,\n\t\t\t\trootMe: offsets[own[w].rootMe], rootOpp: offsets[own[w].rootOpp],\n\t\t\t\tpartial: offsets[partials] + (w - 1) * entries * rowBytes,\n\t\t\t\tstride, control: controlBuffer, settings: settingsBuffer,\n\t\t\t};\n\t\t\tworkers.push(pool.spawn(setup, (error) => {\n\t\t\t\tfailure ??= error;\n\t\t\t\tAtomics.store(control!, ENGINE_CONTROL.ready, threads);\n\t\t\t\tAtomics.add(control!, ENGINE_CONTROL.done, threads);\n\t\t\t\tAtomics.notify(control!, ENGINE_CONTROL.done);\n\t\t\t\tAtomics.notify(control!, ENGINE_CONTROL.ready);\n\t\t\t}));\n\t\t}\n\t\tfor (;;) {\n\t\t\tconst ready = Atomics.load(control, ENGINE_CONTROL.ready);\n\t\t\tif (ready >= threads - 1 || failure) break;\n\t\t\tAtomics.wait(control, ENGINE_CONTROL.ready, ready, 20);\n\t\t}\n\t\tif (failure) {\n\t\t\tfor (const worker of workers) worker.terminate();\n\t\t\tthrow failure;\n\t\t}\n\t}\n\n\tconst run = (mode: number, traverser: 0 | 1, iterWeight: number, dcfr: boolean): Float64Array => {\n\t\tfor (const player of [0, 1] as const) {\n\t\t\tconst [from, count] = rootList(player);\n\t\t\tconst into = player === traverser ? me : opp;\n\t\t\tconst weights = input.players[player].weights;\n\t\t\tfor (let i = 0; i < count; i++) into[i] = weights[active.list[from + i]];\n\t\t}\n\t\tconst [positive, negative, sum, weight, clamp] = settingsFor(mode, iterWeight, dcfr);\n\t\tlet at: number;\n\t\tif (!pool) {\n\t\t\tat = exports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);\n\t\t} else {\n\t\t\tconst plan = pool.plan;\n\t\t\t// Collect: walk above the split, recording what the workers need.\n\t\t\texports.setShard(plan.round, 0, 0);\n\t\t\texports.setPhase(1, 0);\n\t\t\texports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);\n\t\t\t// Every thread walks its slice of the split round.\n\t\t\tsettings!.set([positive, negative, sum, weight, clamp]);\n\t\t\tAtomics.store(control!, ENGINE_CONTROL.done, 0);\n\t\t\tAtomics.store(control!, ENGINE_CONTROL.mode, mode);\n\t\t\tAtomics.store(control!, ENGINE_CONTROL.traverser, traverser);\n\t\t\tAtomics.store(control!, ENGINE_CONTROL.command, 0);\n\t\t\tAtomics.add(control!, ENGINE_CONTROL.generation, 1);\n\t\t\tAtomics.notify(control!, ENGINE_CONTROL.generation);\n\t\t\texports.setShard(plan.round, plan.bounds[0], plan.bounds[1]);\n\t\t\texports.setPhase(0, 1);\n\t\t\tconst valueView = new Float32Array(memory.buffer, offsets[values], entries * stride);\n\t\t\tfor (let entry = 0; entry < entries; entry++) {\n\t\t\t\tconst slot = offsets[reach] + entry * 2 * rowBytes;\n\t\t\t\tconst out = exports.runChance(mode, traverser, plan.entryNodes[entry], slot, slot + rowBytes, positive, negative, sum, weight, clamp);\n\t\t\t\tvalueView.set(new Float32Array(memory.buffer, out, stride), entry * stride);\n\t\t\t}\n\t\t\tfor (;;) {\n\t\t\t\tconst done = Atomics.load(control!, ENGINE_CONTROL.done);\n\t\t\t\tif (done >= threads - 1 || failure) break;\n\t\t\t\tAtomics.wait(control!, ENGINE_CONTROL.done, done, 50);\n\t\t\t}\n\t\t\tif (failure) throw failure;\n\t\t\tconst partialView = new Float32Array(memory.buffer, offsets[partials], (threads - 1) * entries * stride);\n\t\t\tfor (let w = 0; w < threads - 1; w++) {\n\t\t\t\tfor (let i = 0; i < entries * stride; i++) valueView[i] += partialView[w * entries * stride + i];\n\t\t\t}\n\t\t\t// Finish above the split from the totals, now applying updates.\n\t\t\texports.setShard(plan.round, 0, 0);\n\t\t\texports.setPhase(2, 1);\n\t\t\tat = exports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);\n\t\t\texports.setPhase(0, 1);\n\t\t\texports.setShard(-1, 0, 0);\n\t\t}\n\t\tconst [, count] = rootList(traverser);\n\t\tconst values32 = new Float32Array(memory.buffer, at, count);\n\t\tfor (let i = 0; i < count; i++) result[i] = values32[i];\n\t\treturn result;\n\t};\n\n\treturn {\n\t\tregret,\n\t\tstrategySum,\n\t\tthreads,\n\t\troot(dcfr) {\n\t\t\treturn (mode, traverser, iterWeight) => run(mode, traverser, iterWeight, dcfr);\n\t\t},\n\t\tclose() {\n\t\t\tif (!control) return;\n\t\t\tAtomics.store(control, ENGINE_CONTROL.command, 1);\n\t\t\tAtomics.add(control, ENGINE_CONTROL.generation, 1);\n\t\t\tAtomics.notify(control, ENGINE_CONTROL.generation);\n\t\t\tfor (const worker of workers) worker.terminate();\n\t\t},\n\t};\n}\n\n/** The engine's exports. */\nexport interface EngineExports {\n\tinit(header: number): void;\n\tsetMaxActions(count: number): void;\n\tsetShard(round: number, start: number, end: number): void;\n\tsetExchange(entries: number, reach: number, values: number, stride: number): void;\n\tsetPhase(phase: number, apply: number): void;\n\trun(mode: number, traverser: number, me: number, opp: number, positive: number, negative: number, sum: number, weight: number, clamp: number): number;\n\trunChance(mode: number, traverser: number, node: number, me: number, opp: number, positive: number, negative: number, sum: number, weight: number, clamp: number): number;\n}\n"],"mappings":";AAWA,SAAS,YAAY,kBAAkB;;;ACqBvC,IAAM,OAAQ,WAAoD;AA0E3D,IAAM,iBAAiB,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,GAAG,MAAM,EAAE;;;AD3F7G,IAAM,QAAQ;AACd,IAAM,EAAE,aAAaA,MAAK,IAAI;AAG9B,IAAM,SAAS,MAAM;AACrB,IAAM,WAAW,IAAIA,MAAK,SAAS,MAAM,QAAQ,EAAE,KAAK,EAAE,QAAQ,OAAO,MAAM;AAAE,QAAM,IAAI,MAAM,cAAc;AAAG,EAAE,EAAE,CAAC;AACvH,IAAM,SAAS,SAAS;AACxB,OAAO,KAAK,MAAM,MAAM;AACxB,OAAO,cAAc,MAAM,UAAU;AACrC,OAAO,YAAY,GAAG,MAAM,QAAQ;AACpC,OAAO,SAAS,GAAG,MAAM,KAAK;AAC9B,OAAO,SAAS,GAAG,CAAC;AAEpB,IAAM,UAAU,IAAI,WAAW,MAAM,OAAO;AAC5C,IAAM,WAAW,IAAI,aAAa,MAAM,QAAQ;AAChD,IAAM,UAAU,MAAM,WAAW;AACjC,IAAM,WAAW,MAAM,SAAS;AAChC,IAAM,WAAW,IAAI,aAAa,OAAO,QAAQ,MAAM,SAAS,UAAU,MAAM,MAAM;AACtF,IAAM,CAAC,EAAE,KAAK,IAAI,MAAM;AAGxB,IAAI,aAAa,QAAQ,KAAK,SAAS,eAAe,UAAU;AAChE,QAAQ,IAAI,SAAS,eAAe,OAAO,CAAC;AAC5C,QAAQ,OAAO,SAAS,eAAe,KAAK;AAE5C,WAAS;AACR,UAAQ,KAAK,SAAS,eAAe,YAAY,UAAU;AAC3D,eAAa,QAAQ,KAAK,SAAS,eAAe,UAAU;AAC5D,MAAI,QAAQ,KAAK,SAAS,eAAe,OAAO,MAAM,EAAG;AACzD,QAAM,OAAO,QAAQ,KAAK,SAAS,eAAe,IAAI;AACtD,QAAM,YAAY,QAAQ,KAAK,SAAS,eAAe,SAAS;AAChE,QAAM,CAAC,UAAU,UAAU,KAAK,QAAQ,KAAK,IAAI;AACjD,WAAS,QAAQ,GAAG,QAAQ,SAAS,SAAS;AAC7C,UAAM,OAAO,QAAQ,QAAQ,IAAI;AACjC,UAAM,MAAM,OAAO;AAAA,MAClB;AAAA,MAAM;AAAA,MAAW,MAAM,WAAW,KAAK;AAAA,MAAG;AAAA,MAAM,OAAO;AAAA,MAAU;AAAA,MAAU;AAAA,MAAU;AAAA,MAAK;AAAA,MAAQ;AAAA,IACnG;AACA,aAAS,IAAI,IAAI,aAAa,OAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,QAAQ,MAAM,MAAM;AAAA,EACtF;AACA,UAAQ,IAAI,SAAS,eAAe,MAAM,CAAC;AAC3C,UAAQ,OAAO,SAAS,eAAe,IAAI;AAC5C;AAEA,YAAY,MAAM;","names":["wasm"]}
package/dist/index.d.ts CHANGED
@@ -874,8 +874,10 @@ interface SolveOptions {
874
874
  readonly exploitEvery?: number;
875
875
  readonly onProgress?: (info: Progress) => void;
876
876
  /**
877
- * Accumulator storage. Unset, a small spot uses 'f64', a larger one 'f32',
878
- * and one too big for either under the spot's `maxBytes` uses 'i16'.
877
+ * Accumulator storage. Unset, 'f32' — what the WebAssembly engine runs —
878
+ * or 'i16' for a spot too big for it under `maxBytes`. 'f64' is there on
879
+ * request and runs the JavaScript engine; measured, it buys no accuracy
880
+ * an exploitability target can see.
879
881
  *
880
882
  * 'i16' stores regrets and strategy sums as 16-bit integers with one scale
881
883
  * per node and board, about halving memory. It is for fitting a spot, not
@@ -955,6 +957,12 @@ interface SolveOptions {
955
957
  * either way, to the bit; this exists to compare the two. Default true.
956
958
  */
957
959
  readonly simd?: boolean;
960
+ /**
961
+ * Which traversal runs. Unset, the WebAssembly engine wherever it applies
962
+ * — one thread, 32-bit storage, WebAssembly SIMD available — and the
963
+ * JavaScript one otherwise. 'js' forces JavaScript, to compare the two.
964
+ */
965
+ readonly engine?: 'js';
958
966
  }
959
967
  /** See `SolveOptions.approximations`. */
960
968
  interface Approximations {
@@ -1047,6 +1055,8 @@ interface SolveRun {
1047
1055
  readonly completed: number;
1048
1056
  /** Iterations behind the strategy, counting any a warm start inherited. */
1049
1057
  readonly totalIterations: number;
1058
+ /** Which traversal runs: the WebAssembly engine or the JavaScript one. */
1059
+ readonly engine: 'wasm' | 'js';
1050
1060
  /** What a warm start carried over, or null without one. */
1051
1061
  readonly warmStart: WarmStartReport | null;
1052
1062
  /** Run `count` more iterations. */
package/dist/index.js CHANGED
@@ -2078,6 +2078,262 @@ function makeSolver(ctx) {
2078
2078
  };
2079
2079
  }
2080
2080
 
2081
+ // src/wasm/engine.ts
2082
+ var ENGINE_WASM = "AGFzbQEAAAABTglgAX8AYAZ/f39/f38Bf2AFf39/f38AYAd/f39/f3x/AGADf39/AGACf38AYAR/f39/AGAKf39/f399fX19fwF/YAl/f39/fX19fX8BfwIPAQNlbnYGbWVtb3J5AgAAAwsKAQIDBAUABgcIAAaOAjJ/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt8AUQAAAAAAADwPwt/AUF/C38BQQALfwFBAAt/AUEAC38BQQELfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC30BQwAAgD8LfQFDAAAAAAt9AUMAAIA/C30BQwAAgD8LfwFBAAt/AUEBCwdXCAhzZXRTaGFyZAADC3NldEV4Y2hhbmdlAAYIc2V0UGhhc2UABARpbml0AAkNc2V0TWF4QWN0aW9ucwAFA3J1bgAICXJ1bkNoYW5jZQAHBm1lbW9yeQIACqshCuIYBBV/An0FewN8Ix0gBSMebGohDSACIwkjASABai0AACIHQQJ0aigCAGpBAXQiCCAAaiIPQQJ0IgkjCmooAgAhCiMLIAlqKAIAIQtBASAAayIQIAhqIghBAnQiESMKaigCACESIwsgEWooAgAhESMAIAFqLQAAIhNBAkYEQCMUIAlqKAIAIQIjBiABQQJ0aigCALciIpogIiAAQQFGGyMaIAdBA3RqKwMAoiMhoyEkQQAhAANAIAAgEUgEQCAjIAQgAEECdGoqAgC7IiKgISMjICAAIBJqIgEjDGotAABBA3RqIgMgAysDACAioDkDACMgIw0gAWotAABBA3RqIgEgASsDACAioDkDACAAQQFqIQAMAQsLQQAhAANAIAAgC0gEQCANIABBAnRqICQgIyMgIAAgCmoiASMMai0AAEEDdGorAwAjICMNIAFqLQAAQQN0aisDAKAjFSAAIAJqQQJ0aigCACIBQQBOBHwgBCABQQJ0aioCALsFRAAAAAAAAAAAC6GhorY4AgAgAEEBaiEADAELCyMgQQBBoAP8CwAgDQ8LIBNBAksEQCAEIBIgESAKIAsjBiABQQJ0aigCALcjGiAHQQN0aisDAKIjIaMgDRACIA0PCyATQQFGBEAgDUEAIAtBAnQiBvwLACAHQQFqIgcjIkYjJUEAR3EEQCMnIAFBAnRqKAIAIghBAE4EQCMlQQFGBEAjKCMqIAhBAXRsaiIAIAMgBvwKAAAgACMqaiAEIBFBAnT8CgAABSANIykgCCMqbGogC0ECdPwKAAALIA0PCwsjBSMDIAFBAnRqKAIAQQJ0aigCACEIIxkgB0ECdCIBIxhqKAIAQQJ0aiEJIxIjESABaigCAEECdGohCiMdIAUjHmxqIgYjHyAAQQFqbGohCyMJIAFqKAIAIQ8jFyMWIAFqKAIAQQJ0aiIMIAJBAnRqKAIAIQEgDCACQQFqQQJ0aigCACEMIAcjIkYEQCMkIAwjJCAMSBshDCMjIAEjIyABShshAQsgBiMfIBBBAWpsaiEHA0AgASAMSARAIwsgASAPakEBdCICIABqQQJ0aigCACERIwsgAiAQakECdGooAgAhEiAJIAFBAWpBAnRqKAIAIRNBACEGIAkgAUECdGooAgAiFCECA0AgAiATSARAIxMgCiACQQF0Ig4gAGpBAnRqKAIAQQF0aiEVIAIgFEYEQCMTIAogDiAQakECdGooAgBBAXRqIQZBACEOA0AgDiARSARAIAsgDkECdGogAyAVIA5BAXRqLwEAQQJ0aioCADgCACAOQQFqIQ4MAQsLQQAhDgNAIA4gEkgEQCAHIA5BAnRqIAQgBiAOQQF0ai8BAEECdGoqAgA4AgAgDkEBaiEODAELCyAAIAggASALIAcgBUEBahAAIQYLQQAhDgNAIA4gEUgEQCANIBUgDkEBdGovAQBBAnRqIhYgFioCACAGIA5BAnRqKgIAkjgCACAOQQFqIQ4MAQsLIAJBAWohAgwBCwsgAUEBaiEBDAELCyANDwsgAUECdCIHIwNqKAIAIQojByAHaigCACMEIAFqLQAAIgkjCCAPIAgjAiABai0AACIQIABGIggbIhJBAnRqKAIAbGpBAnQiASMbaiETIxwgAWohFCMdIAUjHmxqIx9BA2xqIRUgCyARIAgbIhFBAnQiASEWIysEQCAVIAEgCWxqIgdBACAB/AsAA0AgCSAOSgRAIAEgDmwiBiAUaiEXIAYgFWohBkEAIQ8DQCAPIBFIBEAgD0ECdCIYIBdqKgIAIRsgBiAYaiAbOAIAIAcgGGoiGCAYKgIAIBuSOAIAIA9BAWohDwwBCwsgDkEBaiEODAELC0EAIQ4DQCAOIBFIBEAgDkECdCIGIAdqKgIAQwAAAABeRQRAQwAAAAAhG0EAIQ8DQCAJIA9KBEAgASAPbCIXIBNqIAZqKgIAIhxDAAAAACAcQwAAAABeGyEcIBUgF2ogBmogHDgCACAbIBySIRsgD0EBaiEPDAELCyAGIAdqIBs4AgALIA5BAWohDgwBCwsFIBFBfHEhASAVIBFBAnQiDiAJbGoiB0EAIA78CwADQCAGIAlIBEAgBiAObCIPIBNqIRcgDyAVaiEYQQAhDwNAIAEgD0oEQCAPQQJ0IhkgF2r9AAQA/QwAAAAAAAAAAAAAAAAAAAAA/ekBIR0gGCAZaiAd/QsEACAHIBlqIhkgGf0ABAAgHf3kAf0LBAAgD0EEaiEPDAELCwNAIA8gEUgEQCAPQQJ0IhkgF2oqAgAiG0MAAAAAIBtDAAAAAF4bIRsgGCAZaiAbOAIAIAcgGWoiGSAZKgIAIBuSOAIAIA9BAWohDwwBCwsgBkEBaiEGDAELCwtBACEPIBFBAnQhBkMAAIA/IAmylf0TIR0gEUF8cSEOA0AgCSAPSgRAIBUgBiAPbGohF0EAIQEDQCABIA5IBEAgAUECdCIYIAdq/QAEACEeIBcgGGoiGCAY/QAEACAe/ecBIB0gHv0MAAAAAAAAAAAAAAAAAAAAAP1E/VL9CwQAIAFBBGohAQwBCwsDQCABIBFIBEAgAUECdCIYIAdqKgIAIRsgFyAYaiIYIBtDAAAAAF4EfSAYKgIAIBuVBUMAAIA/IAmylQs4AgAgAUEBaiEBDAELCyAPQQFqIQ8MAQsLIytBAUYgCHEEQANAIAkgDEoEQCAAIwUgCiAMakECdGooAgAgAiADIAQgBUEBahAAIQYgDARAQQAhAQNAIAEgC0gEQCABQQJ0IgcgBmoqAgAiGyAHIA1qIgcqAgBeBEAgByAbOAIACyABQQFqIQEMAQsLBSANIAYgC0ECdPwKAAALIAxBAWohDAwBCwsgDQ8LIA1BACALQQJ0/AsAIx0gBSMebGoiASMfIBBBAWpsaiEGIAEjH0EDbGojMSMfbGohASADIAQgCBshByARQXxxIQwgC0F8cSEQQQAhDgNAIAkgDkoEQCAVIA4gFmxqIRdBACEPA0AgDCAPSgRAIA9BAnQiGCAGaiAHIBhq/QAEACAXIBhq/QAEAP3mAf0LBAAgD0EEaiEPDAELCwNAIA8gEUgEQCAPQQJ0IhggBmogByAYaioCACAXIBhqKgIAlDgCACAPQQFqIQ8MAQsLIAgEfyAAIwUgCiAOakECdGooAgAgAiAGIAQgBUEBahAABSAAIwUgCiAOakECdGooAgAgAiADIAYgBUEBahAACyEYIAgEQCABIA4gFmxqIBggFvwKAABBACEPA0AgDyAQSARAIA9BAnQiGSANaiIaIBr9AAQAIBcgGWr9AAQAIBggGWr9AAQA/eYB/eQB/QsEACAPQQRqIQ8MAQsLA0AgCyAPSgRAIA9BAnQiGSANaiIaIBoqAgAgFyAZaioCACAYIBlqKgIAlJI4AgAgD0EBaiEPDAELCwVBACEPA0AgDyAQSARAIA9BAnQiFyANaiIZIBn9AAQAIBcgGGr9AAQA/eQB/QsEACAPQQRqIQ8MAQsLA0AgCyAPSgRAIA9BAnQiFyANaiIZIBkqAgAgFyAYaioCAJI4AgAgD0EBaiEPDAELCwsgDkEBaiEODAELCyMmQQAjK0UgCHEbBEBBACEFIBFBAnQhACMs/RMhICMt/RMhHyMu/RMhHiMv/RMhHSARQXxxIQQDQCAFIAlIBEAgACAFbCEGQQAhAgNAIAIgBEgEQCAGIBNqIgcgAkECdCIIav0ABAAiISAgIB8gIf0MAAAAAAAAAAAAAAAAAAAAAP1E/VL95gEgASAGaiAIav0ABAAgCCANav0ABAD95QH95AEhISAHIAhqICH9DAAAAAAAAAAAAAAAAAAAAAD96QEgISMwG/0LBAAgBiAUaiAIaiIHIAf9AAQAIB795gEgHSADIAhq/QAEACAGIBVqIAhq/QAEAP3mAf3mAf3kAf0LBAAgAkEEaiECDAELCwNAIAIgEUgEQCACQQJ0IgcgBiATamoqAgAiGyMsIy0gG0MAAAAAXhuUIAEgBmogB2oqAgCSIAcgDWoqAgCTIhtDAAAAAF1BACMwGwRAQwAAAAAhGwsgBiATaiAHaiAbOAIAIAYgFGogB2oiCCAIKgIAIy6UIy8gAyAHaioCAJQgBiAVaiAHaioCAJSSOAIAIAJBAWohAgwBCwsgBUEBaiEFDAELCyMPIBJBAnRqKAIAIgAjDyASQQFqQQJ0aigCACIBSARAIBMgCSARIAAgARABIBQgCSARIAAgARABCwsgDQvHAQIFfwF9IAJBAnQhCQNAIAEgB0oEQCAAIAcgCWxqIQggAyECA0AgAiAESARAIxAgAkECdGooAgAhBkMAAAAAIQpBASEFA0AgBSAGTARAIAogCCMQIAIgBWpBAnRqKAIAQQJ0aioCAJIhCiAFQQFqIQUMAQsLIAogBrKVIQpBASEFA0AgBSAGTARAIAgjECACIAVqQQJ0aigCAEECdGogCjgCACAFQQFqIQUMAQsLIAIgBkEBamohAgwBCwsgB0EBaiEHDAELCwvxAwIGfwJ8IyBBoANqIQkDQCAEIAhKBEAjDiADIAhqQQJ0aigCACELA0AgAiAHSgR/Iw4gASAHakECdGooAgAgC0gFQQALBEAgDSAAIAdBAnRqKgIAuyIOoCENIyAgASAHaiIKIwxqLQAAQQN0aiIMIAwrAwAgDqA5AwAjICMNIApqLQAAQQN0aiIKIAorAwAgDqA5AwAgB0EBaiEHDAELCyAJIAhBA3RqIA0jICADIAhqIgojDGotAABBA3RqKwMAIyAjDSAKai0AAEEDdGorAwCgoTkDACAIQQFqIQgMAQsLIyBBAEGgA/wLAEQAAAAAAAAAACENIAJBAWshByAEQQFrIQIDQCACQQBOBEAjDiACIANqQQJ0aigCACEEA0AgB0EATgR/Iw4gASAHakECdGooAgAgBEoFQQALBEAgDSAAIAdBAnRqKgIAuyIOoCENIyAgASAHaiIIIwxqLQAAQQN0aiIKIAorAwAgDqA5AwAjICMNIAhqLQAAQQN0aiIIIAgrAwAgDqA5AwAgB0EBayEHDAELCyAGIAJBAnRqIAUgCSACQQN0aisDACANIyAgAiADaiIEIwxqLQAAQQN0aisDACMgIw0gBGotAABBA3RqKwMAoKGhorY4AgAgAkEBayECDAELCyMgQQBBoAP8CwALDgAgACQiIAEkIyACJCQLDQAgACQlIAFBAEckJgsGACAAJDELFQAgACQnIAEkKCACJCkgA0ECdCQqCysAIAAkKyAFJCwgBiQtIAckLiAIJC8gCUEARyQwIAEgAkEAIAMgBEEAEAALKwAgACQrIAQkLCAFJC0gBiQuIAckLyAIQQBHJDAgAUEAQQAgAiADQQAQAAv2AQAgACgCACQAIAAoAgQkASAAKAIIJAIgACgCDCQDIAAoAhAkBCAAKAIUJAUgACgCGCQGIAAoAhwkByAAKAIgJAggACgCJCQJIAAoAigkCiAAKAIsJAsgACgCMCQMIAAoAjQkDSAAKAI4JA4gACgCPCQPIABBQGsoAgAkECAAKAJEJBEgACgCSCQSIAAoAkwkEyAAKAJQJBQgACgCVCQVIAAoAlgkFiAAKAJcJBcgACgCYCQYIAAoAmQkGSAAKAJoJBogACgCbCQbIAAoAnAkHCAAKAJ0JB0gACgCeCQeIAAoAnwkHyAAKAKAASQgIAAoAoQBuCQhCw==";
2083
+
2084
+ // src/wasm/engine-shared.ts
2085
+ var ENGINE_SHARED_WASM = "AGFzbQEAAAABTglgAX8AYAZ/f39/f38Bf2AFf39/f38AYAd/f39/f3x/AGADf39/AGACf38AYAR/f39/AGAKf39/f399fX19fwF/YAl/f39/fX19fX8BfwISAQNlbnYGbWVtb3J5AgMAgIAEAwsKAQIDBAUABgcIAAaOAjJ/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC38BQQALfwFBAAt8AUQAAAAAAADwPwt/AUF/C38BQQALfwFBAAt/AUEAC38BQQELfwFBAAt/AUEAC38BQQALfwFBAAt/AUEAC30BQwAAgD8LfQFDAAAAAAt9AUMAAIA/C30BQwAAgD8LfwFBAAt/AUEBCwdXCAhzZXRTaGFyZAADC3NldEV4Y2hhbmdlAAYIc2V0UGhhc2UABARpbml0AAkNc2V0TWF4QWN0aW9ucwAFA3J1bgAICXJ1bkNoYW5jZQAHBm1lbW9yeQIACqshCuIYBBV/An0FewN8Ix0gBSMebGohDSACIwkjASABai0AACIHQQJ0aigCAGpBAXQiCCAAaiIPQQJ0IgkjCmooAgAhCiMLIAlqKAIAIQtBASAAayIQIAhqIghBAnQiESMKaigCACESIwsgEWooAgAhESMAIAFqLQAAIhNBAkYEQCMUIAlqKAIAIQIjBiABQQJ0aigCALciIpogIiAAQQFGGyMaIAdBA3RqKwMAoiMhoyEkQQAhAANAIAAgEUgEQCAjIAQgAEECdGoqAgC7IiKgISMjICAAIBJqIgEjDGotAABBA3RqIgMgAysDACAioDkDACMgIw0gAWotAABBA3RqIgEgASsDACAioDkDACAAQQFqIQAMAQsLQQAhAANAIAAgC0gEQCANIABBAnRqICQgIyMgIAAgCmoiASMMai0AAEEDdGorAwAjICMNIAFqLQAAQQN0aisDAKAjFSAAIAJqQQJ0aigCACIBQQBOBHwgBCABQQJ0aioCALsFRAAAAAAAAAAAC6GhorY4AgAgAEEBaiEADAELCyMgQQBBoAP8CwAgDQ8LIBNBAksEQCAEIBIgESAKIAsjBiABQQJ0aigCALcjGiAHQQN0aisDAKIjIaMgDRACIA0PCyATQQFGBEAgDUEAIAtBAnQiBvwLACAHQQFqIgcjIkYjJUEAR3EEQCMnIAFBAnRqKAIAIghBAE4EQCMlQQFGBEAjKCMqIAhBAXRsaiIAIAMgBvwKAAAgACMqaiAEIBFBAnT8CgAABSANIykgCCMqbGogC0ECdPwKAAALIA0PCwsjBSMDIAFBAnRqKAIAQQJ0aigCACEIIxkgB0ECdCIBIxhqKAIAQQJ0aiEJIxIjESABaigCAEECdGohCiMdIAUjHmxqIgYjHyAAQQFqbGohCyMJIAFqKAIAIQ8jFyMWIAFqKAIAQQJ0aiIMIAJBAnRqKAIAIQEgDCACQQFqQQJ0aigCACEMIAcjIkYEQCMkIAwjJCAMSBshDCMjIAEjIyABShshAQsgBiMfIBBBAWpsaiEHA0AgASAMSARAIwsgASAPakEBdCICIABqQQJ0aigCACERIwsgAiAQakECdGooAgAhEiAJIAFBAWpBAnRqKAIAIRNBACEGIAkgAUECdGooAgAiFCECA0AgAiATSARAIxMgCiACQQF0Ig4gAGpBAnRqKAIAQQF0aiEVIAIgFEYEQCMTIAogDiAQakECdGooAgBBAXRqIQZBACEOA0AgDiARSARAIAsgDkECdGogAyAVIA5BAXRqLwEAQQJ0aioCADgCACAOQQFqIQ4MAQsLQQAhDgNAIA4gEkgEQCAHIA5BAnRqIAQgBiAOQQF0ai8BAEECdGoqAgA4AgAgDkEBaiEODAELCyAAIAggASALIAcgBUEBahAAIQYLQQAhDgNAIA4gEUgEQCANIBUgDkEBdGovAQBBAnRqIhYgFioCACAGIA5BAnRqKgIAkjgCACAOQQFqIQ4MAQsLIAJBAWohAgwBCwsgAUEBaiEBDAELCyANDwsgAUECdCIHIwNqKAIAIQojByAHaigCACMEIAFqLQAAIgkjCCAPIAgjAiABai0AACIQIABGIggbIhJBAnRqKAIAbGpBAnQiASMbaiETIxwgAWohFCMdIAUjHmxqIx9BA2xqIRUgCyARIAgbIhFBAnQiASEWIysEQCAVIAEgCWxqIgdBACAB/AsAA0AgCSAOSgRAIAEgDmwiBiAUaiEXIAYgFWohBkEAIQ8DQCAPIBFIBEAgD0ECdCIYIBdqKgIAIRsgBiAYaiAbOAIAIAcgGGoiGCAYKgIAIBuSOAIAIA9BAWohDwwBCwsgDkEBaiEODAELC0EAIQ4DQCAOIBFIBEAgDkECdCIGIAdqKgIAQwAAAABeRQRAQwAAAAAhG0EAIQ8DQCAJIA9KBEAgASAPbCIXIBNqIAZqKgIAIhxDAAAAACAcQwAAAABeGyEcIBUgF2ogBmogHDgCACAbIBySIRsgD0EBaiEPDAELCyAGIAdqIBs4AgALIA5BAWohDgwBCwsFIBFBfHEhASAVIBFBAnQiDiAJbGoiB0EAIA78CwADQCAGIAlIBEAgBiAObCIPIBNqIRcgDyAVaiEYQQAhDwNAIAEgD0oEQCAPQQJ0IhkgF2r9AAQA/QwAAAAAAAAAAAAAAAAAAAAA/ekBIR0gGCAZaiAd/QsEACAHIBlqIhkgGf0ABAAgHf3kAf0LBAAgD0EEaiEPDAELCwNAIA8gEUgEQCAPQQJ0IhkgF2oqAgAiG0MAAAAAIBtDAAAAAF4bIRsgGCAZaiAbOAIAIAcgGWoiGSAZKgIAIBuSOAIAIA9BAWohDwwBCwsgBkEBaiEGDAELCwtBACEPIBFBAnQhBkMAAIA/IAmylf0TIR0gEUF8cSEOA0AgCSAPSgRAIBUgBiAPbGohF0EAIQEDQCABIA5IBEAgAUECdCIYIAdq/QAEACEeIBcgGGoiGCAY/QAEACAe/ecBIB0gHv0MAAAAAAAAAAAAAAAAAAAAAP1E/VL9CwQAIAFBBGohAQwBCwsDQCABIBFIBEAgAUECdCIYIAdqKgIAIRsgFyAYaiIYIBtDAAAAAF4EfSAYKgIAIBuVBUMAAIA/IAmylQs4AgAgAUEBaiEBDAELCyAPQQFqIQ8MAQsLIytBAUYgCHEEQANAIAkgDEoEQCAAIwUgCiAMakECdGooAgAgAiADIAQgBUEBahAAIQYgDARAQQAhAQNAIAEgC0gEQCABQQJ0IgcgBmoqAgAiGyAHIA1qIgcqAgBeBEAgByAbOAIACyABQQFqIQEMAQsLBSANIAYgC0ECdPwKAAALIAxBAWohDAwBCwsgDQ8LIA1BACALQQJ0/AsAIx0gBSMebGoiASMfIBBBAWpsaiEGIAEjH0EDbGojMSMfbGohASADIAQgCBshByARQXxxIQwgC0F8cSEQQQAhDgNAIAkgDkoEQCAVIA4gFmxqIRdBACEPA0AgDCAPSgRAIA9BAnQiGCAGaiAHIBhq/QAEACAXIBhq/QAEAP3mAf0LBAAgD0EEaiEPDAELCwNAIA8gEUgEQCAPQQJ0IhggBmogByAYaioCACAXIBhqKgIAlDgCACAPQQFqIQ8MAQsLIAgEfyAAIwUgCiAOakECdGooAgAgAiAGIAQgBUEBahAABSAAIwUgCiAOakECdGooAgAgAiADIAYgBUEBahAACyEYIAgEQCABIA4gFmxqIBggFvwKAABBACEPA0AgDyAQSARAIA9BAnQiGSANaiIaIBr9AAQAIBcgGWr9AAQAIBggGWr9AAQA/eYB/eQB/QsEACAPQQRqIQ8MAQsLA0AgCyAPSgRAIA9BAnQiGSANaiIaIBoqAgAgFyAZaioCACAYIBlqKgIAlJI4AgAgD0EBaiEPDAELCwVBACEPA0AgDyAQSARAIA9BAnQiFyANaiIZIBn9AAQAIBcgGGr9AAQA/eQB/QsEACAPQQRqIQ8MAQsLA0AgCyAPSgRAIA9BAnQiFyANaiIZIBkqAgAgFyAYaioCAJI4AgAgD0EBaiEPDAELCwsgDkEBaiEODAELCyMmQQAjK0UgCHEbBEBBACEFIBFBAnQhACMs/RMhICMt/RMhHyMu/RMhHiMv/RMhHSARQXxxIQQDQCAFIAlIBEAgACAFbCEGQQAhAgNAIAIgBEgEQCAGIBNqIgcgAkECdCIIav0ABAAiISAgIB8gIf0MAAAAAAAAAAAAAAAAAAAAAP1E/VL95gEgASAGaiAIav0ABAAgCCANav0ABAD95QH95AEhISAHIAhqICH9DAAAAAAAAAAAAAAAAAAAAAD96QEgISMwG/0LBAAgBiAUaiAIaiIHIAf9AAQAIB795gEgHSADIAhq/QAEACAGIBVqIAhq/QAEAP3mAf3mAf3kAf0LBAAgAkEEaiECDAELCwNAIAIgEUgEQCACQQJ0IgcgBiATamoqAgAiGyMsIy0gG0MAAAAAXhuUIAEgBmogB2oqAgCSIAcgDWoqAgCTIhtDAAAAAF1BACMwGwRAQwAAAAAhGwsgBiATaiAHaiAbOAIAIAYgFGogB2oiCCAIKgIAIy6UIy8gAyAHaioCAJQgBiAVaiAHaioCAJSSOAIAIAJBAWohAgwBCwsgBUEBaiEFDAELCyMPIBJBAnRqKAIAIgAjDyASQQFqQQJ0aigCACIBSARAIBMgCSARIAAgARABIBQgCSARIAAgARABCwsgDQvHAQIFfwF9IAJBAnQhCQNAIAEgB0oEQCAAIAcgCWxqIQggAyECA0AgAiAESARAIxAgAkECdGooAgAhBkMAAAAAIQpBASEFA0AgBSAGTARAIAogCCMQIAIgBWpBAnRqKAIAQQJ0aioCAJIhCiAFQQFqIQUMAQsLIAogBrKVIQpBASEFA0AgBSAGTARAIAgjECACIAVqQQJ0aigCAEECdGogCjgCACAFQQFqIQUMAQsLIAIgBkEBamohAgwBCwsgB0EBaiEHDAELCwvxAwIGfwJ8IyBBoANqIQkDQCAEIAhKBEAjDiADIAhqQQJ0aigCACELA0AgAiAHSgR/Iw4gASAHakECdGooAgAgC0gFQQALBEAgDSAAIAdBAnRqKgIAuyIOoCENIyAgASAHaiIKIwxqLQAAQQN0aiIMIAwrAwAgDqA5AwAjICMNIApqLQAAQQN0aiIKIAorAwAgDqA5AwAgB0EBaiEHDAELCyAJIAhBA3RqIA0jICADIAhqIgojDGotAABBA3RqKwMAIyAjDSAKai0AAEEDdGorAwCgoTkDACAIQQFqIQgMAQsLIyBBAEGgA/wLAEQAAAAAAAAAACENIAJBAWshByAEQQFrIQIDQCACQQBOBEAjDiACIANqQQJ0aigCACEEA0AgB0EATgR/Iw4gASAHakECdGooAgAgBEoFQQALBEAgDSAAIAdBAnRqKgIAuyIOoCENIyAgASAHaiIIIwxqLQAAQQN0aiIKIAorAwAgDqA5AwAjICMNIAhqLQAAQQN0aiIIIAgrAwAgDqA5AwAgB0EBayEHDAELCyAGIAJBAnRqIAUgCSACQQN0aisDACANIyAgAiADaiIEIwxqLQAAQQN0aisDACMgIw0gBGotAABBA3RqKwMAoKGhorY4AgAgAkEBayECDAELCyMgQQBBoAP8CwALDgAgACQiIAEkIyACJCQLDQAgACQlIAFBAEckJgsGACAAJDELFQAgACQnIAEkKCACJCkgA0ECdCQqCysAIAAkKyAFJCwgBiQtIAckLiAIJC8gCUEARyQwIAEgAkEAIAMgBEEAEAALKwAgACQrIAQkLCAFJC0gBiQuIAckLyAIQQBHJDAgAUEAQQAgAiADQQAQAAv2AQAgACgCACQAIAAoAgQkASAAKAIIJAIgACgCDCQDIAAoAhAkBCAAKAIUJAUgACgCGCQGIAAoAhwkByAAKAIgJAggACgCJCQJIAAoAigkCiAAKAIsJAsgACgCMCQMIAAoAjQkDSAAKAI4JA4gACgCPCQPIABBQGsoAgAkECAAKAJEJBEgACgCSCQSIAAoAkwkEyAAKAJQJBQgACgCVCQVIAAoAlgkFiAAKAJcJBcgACgCYCQYIAAoAmQkGSAAKAJoJBogACgCbCQbIAAoAnAkHCAAKAJ0JB0gACgCeCQeIAAoAnwkHyAAKAKAASQgIAAoAoQBuCQhCw==";
2086
+
2087
+ // src/engine.ts
2088
+ var wasm2 = globalThis.WebAssembly;
2089
+ var modules = { plain: void 0, shared: void 0 };
2090
+ function compiledEngine(kind) {
2091
+ if (modules[kind] !== void 0) return modules[kind];
2092
+ modules[kind] = null;
2093
+ try {
2094
+ if (!wasm2) return null;
2095
+ const text = kind === "plain" ? ENGINE_WASM : ENGINE_SHARED_WASM;
2096
+ const bytes = Uint8Array.from(atob(text), (c) => c.charCodeAt(0));
2097
+ if (!wasm2.validate(bytes)) return null;
2098
+ modules[kind] = new wasm2.Module(bytes);
2099
+ } catch {
2100
+ modules[kind] = null;
2101
+ }
2102
+ return modules[kind];
2103
+ }
2104
+ var ENGINE_CONTROL = { generation: 0, done: 1, command: 2, mode: 3, traverser: 4, ready: 5, size: 8 };
2105
+ function createEngine(input, pool) {
2106
+ const shared = pool !== void 0;
2107
+ const compiledModule = compiledEngine(shared ? "shared" : "plain");
2108
+ if (!compiledModule || !wasm2) return null;
2109
+ const { tree, runouts, layout, active, hands } = input;
2110
+ const threads = pool ? pool.threads : 1;
2111
+ const flatten = (parts) => {
2112
+ const bases = new Int32Array(parts.length + 1);
2113
+ for (let i = 0; i < parts.length; i++) bases[i + 1] = bases[i] + parts[i].length;
2114
+ const flat = new Int32Array(bases[parts.length]);
2115
+ parts.forEach((part, i) => flat.set(part, bases[i]));
2116
+ return [bases, flat];
2117
+ };
2118
+ const [upRound, upStart] = flatten(hands.upStart);
2119
+ const [childRound, childStart] = flatten(runouts.childStart);
2120
+ const [orbitRound, orbitStart] = flatten(runouts.orbitStart);
2121
+ const maxCount = Math.max(4, ...active.count);
2122
+ const stride = Math.ceil(maxCount / 4) * 4;
2123
+ const maxActions = Math.max(1, layout.maxActions);
2124
+ const depths = treeDepth2(tree) + 2;
2125
+ const rowBytes = stride * 4;
2126
+ const depthBytes = rowBytes * (3 + 2 * maxActions);
2127
+ const pieces = [];
2128
+ const add = (data, bytes2 = data ? data.byteLength : 0) => {
2129
+ pieces.push({ data, bytes: Math.ceil(Math.max(bytes2, 4) / 16) * 16 });
2130
+ return pieces.length - 1;
2131
+ };
2132
+ const common = [
2133
+ add(tree.kind),
2134
+ add(tree.round),
2135
+ add(Uint8Array.from(tree.player, (p) => p < 0 ? 255 : p)),
2136
+ add(tree.firstEdge),
2137
+ add(tree.numEdges),
2138
+ add(tree.edgeChild),
2139
+ add(tree.payoff),
2140
+ add(layout.offset),
2141
+ add(layout.rowStart),
2142
+ add(active.roundBase),
2143
+ add(active.start),
2144
+ add(Int32Array.from(active.count)),
2145
+ add(active.cardA),
2146
+ add(active.cardB),
2147
+ add(active.strength),
2148
+ add(active.tieStart),
2149
+ add(active.ties),
2150
+ add(upRound),
2151
+ add(upStart),
2152
+ add(hands.up),
2153
+ add(hands.sameStart),
2154
+ add(hands.same),
2155
+ add(childRound),
2156
+ add(childStart),
2157
+ add(orbitRound),
2158
+ add(orbitStart),
2159
+ add(input.runoutWeight),
2160
+ add(null, layout.totalSlots * 4),
2161
+ // regret
2162
+ add(null, layout.totalSlots * 4)
2163
+ // strategy sums
2164
+ ];
2165
+ const REGRET = common[27];
2166
+ const SUMS = common[28];
2167
+ const own = Array.from({ length: threads }, () => ({
2168
+ buffers: add(null, depths * depthBytes),
2169
+ cardSums: add(null, 52 * 8 + stride * 8),
2170
+ rootMe: add(null, rowBytes),
2171
+ rootOpp: add(null, rowBytes),
2172
+ header: add(null, 40 * 4)
2173
+ }));
2174
+ const entries = pool ? pool.plan.entryNodes.length : 0;
2175
+ const entryIndexOf = pool ? add(pool.plan.entryIndexOf) : -1;
2176
+ const reach = pool ? add(null, entries * 2 * rowBytes) : -1;
2177
+ const values = pool ? add(null, entries * rowBytes) : -1;
2178
+ const partials = pool ? add(null, (threads - 1) * entries * rowBytes) : -1;
2179
+ const offsets = [];
2180
+ let total = 64;
2181
+ for (const piece of pieces) {
2182
+ offsets.push(total);
2183
+ total += piece.bytes;
2184
+ }
2185
+ if (total > 4294901760) return null;
2186
+ const pages = Math.ceil(total / 65536) + 1;
2187
+ const memory = shared ? new wasm2.Memory({ initial: pages, maximum: pages, shared: true }) : new wasm2.Memory({ initial: pages });
2188
+ const bytes = new Uint8Array(memory.buffer);
2189
+ pieces.forEach((piece, i) => {
2190
+ if (piece.data) bytes.set(new Uint8Array(piece.data.buffer, piece.data.byteOffset, piece.data.byteLength), offsets[i]);
2191
+ });
2192
+ for (const mine of own) {
2193
+ const head = new Uint32Array(memory.buffer, offsets[mine.header], 40);
2194
+ common.forEach((slot, i) => head[i] = offsets[slot]);
2195
+ head[29] = offsets[mine.buffers];
2196
+ head[30] = depthBytes;
2197
+ head[31] = rowBytes;
2198
+ head[32] = offsets[mine.cardSums];
2199
+ head[33] = input.chipScale;
2200
+ }
2201
+ const instance = new wasm2.Instance(compiledModule, { env: { memory, abort: () => {
2202
+ throw new Error("engine abort");
2203
+ } } });
2204
+ const exports = instance.exports;
2205
+ exports.init(offsets[own[0].header]);
2206
+ exports.setMaxActions(maxActions);
2207
+ const regret = new Float32Array(memory.buffer, offsets[REGRET], layout.totalSlots);
2208
+ const strategySum = new Float32Array(memory.buffer, offsets[SUMS], layout.totalSlots);
2209
+ const me = new Float32Array(memory.buffer, offsets[own[0].rootMe], stride);
2210
+ const opp = new Float32Array(memory.buffer, offsets[own[0].rootOpp], stride);
2211
+ const result = new Float64Array(COMBOS);
2212
+ const rootList = (player) => {
2213
+ const slot = active.roundBase[0] * 2 + player;
2214
+ return [active.start[slot], active.count[slot]];
2215
+ };
2216
+ const settingsFor = (mode, iterWeight, dcfr) => {
2217
+ if (mode === Mode.Train && dcfr) {
2218
+ const { keepPositive, keepNegative, keepSum } = dcfrFactors(iterWeight);
2219
+ return [keepPositive, keepNegative, keepSum, 1, 0];
2220
+ }
2221
+ return [1, 1, 1, iterWeight, dcfr ? 0 : 1];
2222
+ };
2223
+ let control = null;
2224
+ let settings = null;
2225
+ const workers = [];
2226
+ let failure = null;
2227
+ if (pool) {
2228
+ const plan = pool.plan;
2229
+ const controlBuffer = new SharedArrayBuffer(ENGINE_CONTROL.size * 4);
2230
+ const settingsBuffer = new SharedArrayBuffer(8 * 8);
2231
+ control = new Int32Array(controlBuffer);
2232
+ settings = new Float64Array(settingsBuffer);
2233
+ exports.setExchange(offsets[entryIndexOf], offsets[reach], offsets[values], stride);
2234
+ for (let w = 1; w < threads; w++) {
2235
+ const setup = {
2236
+ memory,
2237
+ module: compiledModule,
2238
+ header: offsets[own[w].header],
2239
+ maxActions,
2240
+ exchange: [offsets[entryIndexOf], offsets[reach], offsets[values], stride],
2241
+ shard: [plan.round, plan.bounds[w], plan.bounds[w + 1]],
2242
+ entryNodes: plan.entryNodes,
2243
+ rootMe: offsets[own[w].rootMe],
2244
+ rootOpp: offsets[own[w].rootOpp],
2245
+ partial: offsets[partials] + (w - 1) * entries * rowBytes,
2246
+ stride,
2247
+ control: controlBuffer,
2248
+ settings: settingsBuffer
2249
+ };
2250
+ workers.push(pool.spawn(setup, (error) => {
2251
+ failure ??= error;
2252
+ Atomics.store(control, ENGINE_CONTROL.ready, threads);
2253
+ Atomics.add(control, ENGINE_CONTROL.done, threads);
2254
+ Atomics.notify(control, ENGINE_CONTROL.done);
2255
+ Atomics.notify(control, ENGINE_CONTROL.ready);
2256
+ }));
2257
+ }
2258
+ for (; ; ) {
2259
+ const ready = Atomics.load(control, ENGINE_CONTROL.ready);
2260
+ if (ready >= threads - 1 || failure) break;
2261
+ Atomics.wait(control, ENGINE_CONTROL.ready, ready, 20);
2262
+ }
2263
+ if (failure) {
2264
+ for (const worker of workers) worker.terminate();
2265
+ throw failure;
2266
+ }
2267
+ }
2268
+ const run = (mode, traverser, iterWeight, dcfr) => {
2269
+ for (const player of [0, 1]) {
2270
+ const [from, count2] = rootList(player);
2271
+ const into = player === traverser ? me : opp;
2272
+ const weights = input.players[player].weights;
2273
+ for (let i = 0; i < count2; i++) into[i] = weights[active.list[from + i]];
2274
+ }
2275
+ const [positive, negative, sum, weight, clamp] = settingsFor(mode, iterWeight, dcfr);
2276
+ let at;
2277
+ if (!pool) {
2278
+ at = exports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);
2279
+ } else {
2280
+ const plan = pool.plan;
2281
+ exports.setShard(plan.round, 0, 0);
2282
+ exports.setPhase(1, 0);
2283
+ exports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);
2284
+ settings.set([positive, negative, sum, weight, clamp]);
2285
+ Atomics.store(control, ENGINE_CONTROL.done, 0);
2286
+ Atomics.store(control, ENGINE_CONTROL.mode, mode);
2287
+ Atomics.store(control, ENGINE_CONTROL.traverser, traverser);
2288
+ Atomics.store(control, ENGINE_CONTROL.command, 0);
2289
+ Atomics.add(control, ENGINE_CONTROL.generation, 1);
2290
+ Atomics.notify(control, ENGINE_CONTROL.generation);
2291
+ exports.setShard(plan.round, plan.bounds[0], plan.bounds[1]);
2292
+ exports.setPhase(0, 1);
2293
+ const valueView = new Float32Array(memory.buffer, offsets[values], entries * stride);
2294
+ for (let entry = 0; entry < entries; entry++) {
2295
+ const slot = offsets[reach] + entry * 2 * rowBytes;
2296
+ const out = exports.runChance(mode, traverser, plan.entryNodes[entry], slot, slot + rowBytes, positive, negative, sum, weight, clamp);
2297
+ valueView.set(new Float32Array(memory.buffer, out, stride), entry * stride);
2298
+ }
2299
+ for (; ; ) {
2300
+ const done = Atomics.load(control, ENGINE_CONTROL.done);
2301
+ if (done >= threads - 1 || failure) break;
2302
+ Atomics.wait(control, ENGINE_CONTROL.done, done, 50);
2303
+ }
2304
+ if (failure) throw failure;
2305
+ const partialView = new Float32Array(memory.buffer, offsets[partials], (threads - 1) * entries * stride);
2306
+ for (let w = 0; w < threads - 1; w++) {
2307
+ for (let i = 0; i < entries * stride; i++) valueView[i] += partialView[w * entries * stride + i];
2308
+ }
2309
+ exports.setShard(plan.round, 0, 0);
2310
+ exports.setPhase(2, 1);
2311
+ at = exports.run(mode, traverser, offsets[own[0].rootMe], offsets[own[0].rootOpp], positive, negative, sum, weight, clamp);
2312
+ exports.setPhase(0, 1);
2313
+ exports.setShard(-1, 0, 0);
2314
+ }
2315
+ const [, count] = rootList(traverser);
2316
+ const values32 = new Float32Array(memory.buffer, at, count);
2317
+ for (let i = 0; i < count; i++) result[i] = values32[i];
2318
+ return result;
2319
+ };
2320
+ return {
2321
+ regret,
2322
+ strategySum,
2323
+ threads,
2324
+ root(dcfr) {
2325
+ return (mode, traverser, iterWeight) => run(mode, traverser, iterWeight, dcfr);
2326
+ },
2327
+ close() {
2328
+ if (!control) return;
2329
+ Atomics.store(control, ENGINE_CONTROL.command, 1);
2330
+ Atomics.add(control, ENGINE_CONTROL.generation, 1);
2331
+ Atomics.notify(control, ENGINE_CONTROL.generation);
2332
+ for (const worker of workers) worker.terminate();
2333
+ }
2334
+ };
2335
+ }
2336
+
2081
2337
  // src/warm.ts
2082
2338
  var SIZE_TOLERANCE = 1.35;
2083
2339
  var REGRET_STEPS2 = 32767;
@@ -2230,6 +2486,17 @@ function spawnWorker(setup, onError) {
2230
2486
  }
2231
2487
  };
2232
2488
  }
2489
+ function spawnEngineWorker(setup, onError) {
2490
+ const url = new URL(import.meta.url.endsWith(".ts") ? "../engine-worker.ts" : "./engine-worker.js", import.meta.url);
2491
+ const thread = new Worker(fileURLToPath(url), { workerData: setup });
2492
+ thread.on("error", onError);
2493
+ thread.unref();
2494
+ return {
2495
+ terminate() {
2496
+ void thread.terminate();
2497
+ }
2498
+ };
2499
+ }
2233
2500
 
2234
2501
  // src/parallel.ts
2235
2502
  var CONTROL = {
@@ -2534,7 +2801,7 @@ var PRECISION_BYTES = { f64: 8, f32: 4, i16: 2 };
2534
2801
  function createRun(spot, options = {}) {
2535
2802
  const maxBytes = spot.source.maxBytes ?? DEFAULT_MAX_BYTES;
2536
2803
  const { totalSlots, bytes } = spot.estimate;
2537
- const precision = options.analysisOnly ? "f32" : options.precision ?? (totalSlots < 4e6 && bytes * 2 <= maxBytes ? "f64" : bytes <= maxBytes ? "f32" : "i16");
2804
+ const precision = options.analysisOnly ? "f32" : options.precision ?? (bytes <= maxBytes ? "f32" : "i16");
2538
2805
  const relevant = new Uint8Array(COMBOS);
2539
2806
  for (const combo of spot.players[0].combos) relevant[combo] = 1;
2540
2807
  for (const combo of spot.players[1].combos) relevant[combo] = 1;
@@ -2547,20 +2814,34 @@ function createRun(spot, options = {}) {
2547
2814
  const width = PRECISION_BYTES[precision];
2548
2815
  const quantised = precision === "i16";
2549
2816
  const active = buildActiveLists(spot.runouts, spot.players, showdown);
2817
+ const hands = buildHandSpace(spot.runouts, spot.players, active);
2818
+ const engine = options.engine !== "js" && precision === "f32" && !options.analysisOnly && options.simd !== false ? createEngine(
2819
+ {
2820
+ tree: spot.tree,
2821
+ runouts: spot.runouts,
2822
+ players: spot.players,
2823
+ layout,
2824
+ active,
2825
+ hands,
2826
+ runoutWeight: weights,
2827
+ chipScale: spot.chipScale
2828
+ },
2829
+ plan ? { plan, threads: requested, spawn: spawnEngineWorker } : void 0
2830
+ ) : null;
2550
2831
  const ctx = {
2551
2832
  tree: spot.tree,
2552
2833
  runouts: spot.runouts,
2553
2834
  players: spot.players,
2554
2835
  layout,
2555
2836
  showdown,
2556
- regret: options.analysisOnly ? new Float32Array(0) : makeRegretStore(precision, allocate(layout.totalSlots * width)),
2557
- strategySum: makeSumStore(precision, allocate(layout.totalSlots * width)),
2837
+ regret: engine ? engine.regret : options.analysisOnly ? new Float32Array(0) : makeRegretStore(precision, allocate(layout.totalSlots * width)),
2838
+ strategySum: engine ? engine.strategySum : makeSumStore(precision, allocate(layout.totalSlots * width)),
2558
2839
  regretScale: quantised ? new Float64Array(allocate(layout.blocks * 8)) : null,
2559
2840
  sumScale: quantised ? new Float64Array(allocate(layout.blocks * 8)) : null,
2560
2841
  scratch: makeTerminalScratch(),
2561
2842
  chipScale: spot.chipScale,
2562
2843
  active,
2563
- hands: buildHandSpace(spot.runouts, spot.players, active),
2844
+ hands,
2564
2845
  runoutWeight: weights,
2565
2846
  shardStart: 0,
2566
2847
  shardEnd: plan ? plan.boards : 0,
@@ -2586,17 +2867,20 @@ function createRun(spot, options = {}) {
2586
2867
  offset = options.warmIteration ?? source.totalIterations;
2587
2868
  }
2588
2869
  const solver = makeSolver(ctx);
2589
- const pool = plan ? startPool(ctx, solver, plan, { config: spot.source, dcfr: ctx.dcfr, precision, approximations: options.approximations, simd: ctx.simd }, requested) : null;
2870
+ const pool = plan && !engine ? startPool(ctx, solver, plan, { config: spot.source, dcfr: ctx.dcfr, precision, approximations: options.approximations, simd: ctx.simd }, requested) : null;
2590
2871
  if (pool) solver.useRoot(pool.traverse);
2872
+ if (engine) solver.useRoot(engine.root(ctx.dcfr));
2873
+ const threadCount = pool ? pool.workers : engine ? engine.threads : 1;
2591
2874
  let completed = 0;
2592
2875
  return {
2593
2876
  spot,
2594
2877
  solver,
2595
- workers: pool ? pool.workers : 1,
2878
+ workers: threadCount,
2596
2879
  get completed() {
2597
2880
  return completed;
2598
2881
  },
2599
2882
  warmStart: warm,
2883
+ engine: engine ? "wasm" : "js",
2600
2884
  get totalIterations() {
2601
2885
  return offset + completed;
2602
2886
  },
@@ -2608,6 +2892,7 @@ function createRun(spot, options = {}) {
2608
2892
  close() {
2609
2893
  solver.useRoot(null);
2610
2894
  pool?.close();
2895
+ engine?.close();
2611
2896
  },
2612
2897
  exploitabilityPercent() {
2613
2898
  return 100 * solver.exploitability() / (spot.potUnits / spot.chipScale);
@@ -2615,7 +2900,7 @@ function createRun(spot, options = {}) {
2615
2900
  trueExploitabilityPercent() {
2616
2901
  if (!spot.runouts.approximate) return this.exploitabilityPercent();
2617
2902
  const real = createRun(defineSpot({ ...spot.source, runoutBuckets: false }), {
2618
- workers: pool ? pool.workers : 1,
2903
+ workers: threadCount,
2619
2904
  precision
2620
2905
  });
2621
2906
  try {
@@ -2626,7 +2911,7 @@ function createRun(spot, options = {}) {
2626
2911
  }
2627
2912
  },
2628
2913
  snapshot(history = [], stoppedAt = "iterations") {
2629
- return makeSolution(spot, ctx, solver, completed, offset + completed, [...history], stoppedAt, pool ? pool.workers : 1);
2914
+ return makeSolution(spot, ctx, solver, completed, offset + completed, [...history], stoppedAt, threadCount);
2630
2915
  }
2631
2916
  };
2632
2917
  }