@table-games-engine/core 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,59 @@
-# Temporary Holding Version
+# @table-games-engine/core
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The deterministic, in-process engine for turn-based table games: state, actions, priority, triggers, seeded randomness and per-player views. Game logic is written against its types.
+
+Most game authors don't install this directly: it comes with [`@table-games-engine/game-kit`](https://www.npmjs.com/package/@table-games-engine/game-kit), which scaffolds a game that already depends on it. Games import types and helpers from it:
+
+```ts
+import { ok, reject, resolved, type ActionHandler, type GamePlugin } from '@table-games-engine/core';
+
+const fireBolt: ActionHandler = (ctx, frame) => {
+  const actor = 'actor' in frame ? frame.actor : frame.controller;
+  const target = ctx.getActivePlayers().find((p) => p !== actor);
+  if (!target) return reject('rule-violation');          // illegal move: nothing changes
+  return resolved([
+    { domain: 'player', operation: { type: 'add-resource', playerId: target, resource: 'life', delta: -2 } },
+    { domain: 'turn', operation: { type: 'advance' } },  // end the turn
+  ]);
+};
+```
+
+## Install
+
+```sh
+npm install @table-games-engine/core
+```
+
+ESM only.
+
+## What a game provides
+
+A `GamePlugin` has `id`, `version`, `manifest`, `requiredMechanics`, `setup`, `actionHandlers`, `winConditionChecker` and `legalMoves(state, playerId)`. `legalMoves` returns every concrete move the player may submit now, and `[]` when they do not hold priority or the game is over. Handlers must be pure: return mutations, never modify `ctx.state`.
+
+Helpers for handlers:
+
+- `resolved(mutations, events?)` - a successful result.
+- `reject(reason)` - an illegal move (`'rule-violation'`, `'condition-failed'`, `'targets-illegal'`); state does not change.
+- `ok(value)` - generic `Result` success constructor (`err(error)` is its failure counterpart). `setup` returns `ok({ state })`.
+
+## Running the engine
+
+Use these to run matches yourself (in tests, simulators, servers):
+
+```ts
+import { setupMatch, driveAction, rulesFromPlugin, computePlayerView } from '@table-games-engine/core';
+```
+
+- `setupMatch` and `driveAction` start a match from a `GamePlugin` and apply one player input.
+- `createEngine(manifest, initialState, handlers)` is the lower-level facade (`applyAction`, `resolveTopFrame`, `getState`).
+- `computePlayerView(state, manifest, playerId)` returns what one player may see.
+- Randomness: `seedRng`, `nextRandom`, `randomInt`, `randomPick`, `randomShuffle`. Inside handlers use `ctx.random*`.
+- Lower-level building blocks are also exported (`applyMutation`, `applyTransition`, `validateAction`, `resolveTopFrame`, `scanTriggers`, `advanceTurn`, `advancePhase`, `checkWin`, priority helpers).
+
+## Determinism
+
+The same initial state, manifest, handlers and inputs always produce the same final state. The engine never calls `Math.random` or `Date.now`; all randomness flows through `MatchState.rng` (xorshift32).
+
+## Licence
+
+Apache-2.0

package/dist/engine/context.d.ts

@@ -0,0 +1,29 @@
+/**
+ * @fileoverview GameEngineContext factory.
+ *
+ * Builds a read-only context that game logic uses to query state and consume
+ * deterministic randomness. The context is the ONLY API surface available to
+ * game logic; no Math.random, no Date.now, no I/O.
+ *
+ * The context is stateless w.r.t. RNG: every random* call seeds from
+ * state.rng.state and returns a new state for the caller to thread via an
+ * RngMutation. The engine — not the context — advances state.rng.
+ *
+ * Default behaviors for `evaluateCondition`, `validateTargets`, and
+ * `prepareEffect` are intentionally no-ops here. Manifests register concrete
+ * evaluators / executors via the EngineOperations facade in Task 14, which
+ * wraps the base context.
+ */
+import type { GameEngineContext } from '../types/engine';
+import type { GameManifest } from '../types/definition';
+import type { MatchState } from '../types/state';
+/**
+ * Build a read-only GameEngineContext bound to (manifest, state).
+ *
+ * The returned context:
+ * - Holds a per-context counter for `generateId`. Two contexts built from the
+ *   same state will produce the same ID sequence given the same call order.
+ * - Treats RNG as stateless: each `random*` call seeds from `state.rng.state`.
+ * - Returns immutable views of state collections.
+ */
+export declare function createContext(manifest: GameManifest, state: MatchState): GameEngineContext;

package/dist/engine/drive.d.ts

@@ -0,0 +1,28 @@
+/**
+ * @fileoverview The single "player submits a move" execution path.
+ *
+ * Used by the Nakama match handler and by game-kit simulate, so CI runs
+ * exactly what the server runs. Pure except for throwing on game-logic
+ * bugs (unresolvable frame, state-based actions that never settle).
+ */
+import type { ActionHandler, ActionInput, ActionValidationResult, GameManifest, ResolutionFailure, ResolutionResult, GamePlugin, MatchState, StateBasedActionChecker, StateTransition, WinConditionChecker } from '../types';
+export interface GameRules {
+    readonly manifest: GameManifest;
+    readonly handlers: Readonly<Record<string, ActionHandler>>;
+    readonly stateBasedActions?: StateBasedActionChecker;
+    readonly winChecker?: WinConditionChecker;
+}
+export type DriveResult = {
+    readonly ok: true;
+    readonly state: MatchState;
+    readonly transitions: ReadonlyArray<StateTransition>;
+} | {
+    readonly ok: false;
+    readonly error: ActionValidationResult;
+};
+/** Handler result that rejects the move: the server refuses the input and nothing changes. */
+export declare function reject(reason?: ResolutionFailure): ResolutionResult;
+/** Successful handler result. */
+export declare function resolved(mutations: ResolutionResult['mutations'], events?: ResolutionResult['events']): ResolutionResult;
+export declare function rulesFromPlugin(plugin: GamePlugin): GameRules;
+export declare function driveAction(rules: GameRules, state: MatchState, input: ActionInput): DriveResult;

package/dist/engine/frames.d.ts

@@ -0,0 +1,23 @@
+/**
+ * @fileoverview Stack frame builders.
+ *
+ * Pure functions that turn a validated `ActionInput` into a concrete
+ * `StackFrame`. Frame IDs are derived from `state.version` and the input's
+ * `clientId` (an idempotency key carried by every `ActionInput`). Same input
+ * applied to the same state always produces the same id — required for
+ * replay and event-log comparison.
+ */
+import type { ActionFrame, ActionInputAction, StackFrame } from '../types/stack';
+import type { ActionDef } from '../types/definition';
+import type { LogicalTimestamp, PlayerId } from '../types/primitives';
+export interface BuildActionFrameArgs {
+    readonly actor: PlayerId;
+    readonly def: ActionDef;
+    readonly data: ActionInputAction;
+    readonly tick: LogicalTimestamp;
+    readonly version: number;
+    readonly clientId: string;
+}
+export declare function buildActionFrame(args: BuildActionFrameArgs): ActionFrame;
+/** Re-export of the discriminated union for callers that want it. */
+export type AnyFrame = StackFrame;

package/dist/engine/lifecycle.d.ts

@@ -0,0 +1,44 @@
+/**
+ * @fileoverview Lifecycle ops: advance turn, advance phase, win check.
+ *
+ * This is the glue layer between the resolution loop and game-defined
+ * predicates from the manifest. Each function is pure: it takes a state
+ * (and possibly the manifest) and returns either a new state or a
+ * `GameEndCheck` verdict — never mutating its inputs.
+ *
+ * State shape is left untouched. All structural changes go through
+ * `applyMutation` from `./reducer.ts` so we share the same exhaustive
+ * mutation machinery the rest of the engine uses.
+ */
+import type { MatchState } from '../types/state';
+import type { GameManifest } from '../types/definition';
+import type { GameEndCheck } from '../types/engine';
+/**
+ * Rotate the active player by one position in turnOrder and bump turnNumber.
+ *
+ * Delegates to the reducer's `turn:advance` op so wrap-around, index
+ * adjustment, and turnNumber accounting all live in one place.
+ */
+export declare function advanceTurn(state: MatchState): MatchState;
+/**
+ * Move to the first declared transition target leaving the current phase.
+ *
+ * Transitions live on the `PhaseGraph` (manifest.phases.transitions), NOT
+ * on individual `PhaseDef` objects. We pick the highest-priority transition
+ * whose `from` matches the current phase. If no transition exists, the
+ * state is returned unchanged.
+ *
+ * Conditional transition selection (e.g. via `triggerCondition`) is the
+ * responsibility of the EngineOperations facade in Task 13/14; this layer
+ * implements the universal "first declared next phase" default.
+ */
+export declare function advancePhase(state: MatchState, manifest: GameManifest): MatchState;
+/**
+ * Universal default win check: <=1 non-eliminated player.
+ *
+ * Game-specific manifests can override via a custom `WinConditionChecker`
+ * wired through the EngineOperations facade. This default handles the
+ * elimination case (`status === 'eliminated'`) and produces a `GameResult`
+ * with rankings ordered so the surviving player ranks 1st.
+ */
+export declare function checkWin(state: MatchState): GameEndCheck;

package/dist/engine/operations.d.ts

@@ -0,0 +1,45 @@
+/**
+ * @fileoverview EngineOperations facade.
+ *
+ * `createEngine(manifest, initialState, handlers)` returns an `Engine` that
+ * implements {@link EngineOperations} plus a `getState()` accessor. Every
+ * public method:
+ *   - validates inputs against the current state (read-only),
+ *   - composes a {@link StateTransition} via `applyTransition`,
+ *   - replaces the engine's internal state reference with the new state,
+ *   - returns the transition (or an error) wrapped in a {@link Result}.
+ *
+ * The engine itself is the only stateful piece in the runtime; every
+ * operation it performs is a pure transformation of the previous state,
+ * mediated by the reducer-driven `applyTransition` helper.
+ *
+ * Design notes:
+ *   - The action window in `state.priority.window` is derived data: it
+ *     depends on the current phase and stack. Before validating each
+ *     player input, we recompute the window via `computeWindow` and
+ *     replace it in-place on the snapshot fed to `validateAction`. This
+ *     replacement is NOT a transition — it never bumps `version`.
+ *   - Pass / concede / timeout inputs do NOT push a frame onto the stack.
+ *     Validation produces a sentinel "noop" frame (id starts with
+ *     `pass-noop` / `concede-noop` / `timeout-noop`); we detect those
+ *     sentinels and emit minimal mutations instead.
+ *   - Lifecycle helpers (`advancePhase`, `advanceTurn`) compute the next
+ *     state shape; we then synthesise the equivalent typed mutation and
+ *     run it through `applyTransition` so the version/event bookkeeping
+ *     stays consistent.
+ */
+import type { EngineOperations, ActionHandler } from '../types/engine';
+import type { GameManifest } from '../types/definition';
+import type { MatchState } from '../types/state';
+/**
+ * Engine instance: implements `EngineOperations` plus `getState()`.
+ *
+ * The instance holds the latest `MatchState` internally; tests and host
+ * runtimes (Nakama adapter, mini-duel fixture) inspect it via
+ * `getState()` between operations.
+ */
+export interface Engine extends EngineOperations {
+    /** Current internal state snapshot. */
+    getState(): MatchState;
+}
+export declare function createEngine(manifest: GameManifest, initialState: MatchState, handlers: Record<string, ActionHandler>): Engine;

package/dist/engine/priority.d.ts

@@ -0,0 +1,17 @@
+import type { PriorityState } from '../types/stack';
+import type { PlayerId, ImmutableList } from '../types/primitives';
+/**
+ * Pass order = active player, then turn order in clockwise rotation.
+ * Mirrors `runtime-action-processing.md` § 6.
+ */
+export declare function buildPassOrder(turnOrder: ImmutableList<PlayerId>, activePlayer: PlayerId): PlayerId[];
+export declare function advancePriority(p: PriorityState): PriorityState;
+export declare function markPassed(p: PriorityState, player: PlayerId): PriorityState;
+export declare function allPassed(p: PriorityState, activePlayers: ImmutableList<PlayerId>): boolean;
+/**
+ * After any stack change (push or pop), priority resets:
+ * - holder = active player
+ * - passed = []
+ * - consecutivePasses = 0
+ */
+export declare function resetPriorityOnStackChange(p: PriorityState, activePlayer: PlayerId): PriorityState;

package/dist/engine/reducer.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @fileoverview Pure state mutation reducer.
+ *
+ * `applyMutation(state, mutation) -> newState` is the ONE place state mutates.
+ * It is a pure function: never mutates input, always returns a new state via
+ * spread. The switch over `mutation.domain` is exhaustive: a `never`-typed
+ * default catches any forgotten case at compile time.
+ */
+import type { MatchState } from '../types/state';
+import type { StateMutation } from '../types/engine';
+/**
+ * Apply a single mutation, returning a new MatchState.
+ * Pure function; never mutates input.
+ *
+ * Unknown operation types are caught at compile time via the `never`-typed
+ * exhaustive default. The runtime throw guards against malformed JSON.
+ */
+export declare function applyMutation(state: MatchState, mutation: StateMutation): MatchState;

package/dist/engine/resolve.d.ts

@@ -0,0 +1,56 @@
+/**
+ * @fileoverview Top-of-stack resolver.
+ *
+ * `resolveTopFrame` is the pure, read-only step that runs when the engine is
+ * ready to resolve the next stack frame:
+ *
+ * 1. Peek the top frame (if the stack is empty, return `stack-empty`).
+ * 2. If the frame's targets are no longer valid, the frame fizzles.
+ * 3. Look up the registered `ActionHandler` for the frame:
+ *    - `action`/`reaction` frames dispatch by `actionTypeId`.
+ *    - `trigger` frames dispatch by `triggerId`.
+ *    - `effect` frames dispatch by `effectType`.
+ * 4. Build a read-only context and invoke the handler.
+ * 5. Return the handler's `ResolutionResult` wrapped in a `ResolveOutcome`.
+ *
+ * The resolver does NOT mutate state. It is the EngineOperations facade
+ * (Task 13) that takes the outcome and applies it via `applyTransition`.
+ */
+import type { MatchState } from '../types/state';
+import type { GameManifest } from '../types/definition';
+import type { ActionHandler, ResolutionResult } from '../types/engine';
+import type { FrameId } from '../types/primitives';
+/**
+ * Outcome of attempting to resolve the top stack frame.
+ *
+ * Discriminated union — callers should switch on `kind`:
+ * - `stack-empty`   : nothing to resolve.
+ * - `no-handler`    : a frame is on the stack but the manifest registered
+ *                     no handler for its dispatch key. The facade should
+ *                     treat this as a system error / no-op.
+ * - `fizzled`       : the frame's targets became invalid; the frame should
+ *                     be popped without effect.
+ * - `resolved`      : the handler ran and returned a `ResolutionResult`.
+ */
+export type ResolveOutcome = {
+    kind: 'stack-empty';
+} | {
+    kind: 'no-handler';
+    actionTypeId: string;
+} | {
+    kind: 'fizzled';
+    frameId: FrameId;
+    reason: 'targets-illegal';
+} | {
+    kind: 'resolved';
+    frameId: FrameId;
+    result: ResolutionResult;
+};
+/**
+ * Pure resolver: pops nothing, mutates nothing.
+ *
+ * The caller (EngineOperations facade) is responsible for translating the
+ * returned outcome into a `StateTransition` (popping the frame, applying
+ * mutations, appending events, queueing fired triggers, pushing child frames).
+ */
+export declare function resolveTopFrame(state: MatchState, manifest: GameManifest, handlers: Record<string, ActionHandler>): ResolveOutcome;

package/dist/engine/rng.d.ts

@@ -0,0 +1,25 @@
+import type { ImmutableList } from '../types/primitives';
+import type { RngState } from '../types/state';
+import type { RandomResult } from '../types/engine';
+/**
+ * Initialize an RngState from a string seed.
+ * Same string -> same state.
+ */
+export declare function seedRng(seed: string): RngState;
+/**
+ * Advance state once, return value in [0, 1) and new state.
+ */
+export declare function nextRandom(state: ImmutableList<number>): RandomResult<number>;
+/**
+ * Random integer in [min, max] inclusive.
+ */
+export declare function randomInt(state: ImmutableList<number>, min: number, max: number): RandomResult<number>;
+/**
+ * Pick a random element from array. Empty array -> undefined, no state advance.
+ */
+export declare function randomPick<T>(state: ImmutableList<number>, array: ReadonlyArray<T>): RandomResult<T | undefined>;
+/**
+ * Fisher-Yates shuffle using deterministic RNG.
+ * Returns a NEW array; does not mutate input.
+ */
+export declare function randomShuffle<T>(state: ImmutableList<number>, array: ReadonlyArray<T>): RandomResult<ReadonlyArray<T>>;

package/dist/engine/setup-match.d.ts

@@ -0,0 +1,17 @@
+/**
+ * @fileoverview Plugin → initial MatchState.
+ *
+ * Generalised from the TCG Nakama registration: setup functions receive a
+ * real GameEngineContext (seeded RNG, manifest) over a schema-valid empty
+ * state, and may build on `ctx.state`.
+ */
+import type { GameConfig } from '../types/definition';
+import type { GamePlugin } from '../types/plugins';
+import type { MatchState } from '../types/state';
+import type { PlayerId } from '../types/primitives';
+export interface SetupMatchArgs {
+    readonly playerIds: ReadonlyArray<PlayerId>;
+    readonly config: GameConfig;
+    readonly seed: string;
+}
+export declare function setupMatch(plugin: GamePlugin, args: SetupMatchArgs): MatchState;

package/dist/engine/stack.d.ts

@@ -0,0 +1,33 @@
+/**
+ * @fileoverview Pure helper functions over the action stack.
+ *
+ * These helpers are read-only inspectors of the {@link ActionStack}.
+ * They never mutate input.
+ *
+ * NOTE: `topFrame` and `isStackEmpty` already live in
+ * `../types/stack.ts` and are re-exported from the package root.
+ * Do not duplicate them here.
+ */
+import type { ActionStack, StackFrame } from '../types/stack';
+import type { FrameId } from '../types/primitives';
+/**
+ * Return the frame currently at the top of the stack, or undefined if empty.
+ *
+ * Equivalent to `topFrame` but provided here as the canonical engine helper.
+ */
+export declare function peek(stack: ActionStack): StackFrame | undefined;
+/**
+ * Find a frame by its FrameId. Returns undefined if no such frame exists.
+ */
+export declare function findFrame(stack: ActionStack, id: FrameId): StackFrame | undefined;
+/**
+ * Return the frame immediately above the given frame in the stack
+ * (the next frame closer to the top), or undefined if the given
+ * frame is at the top or not in the stack.
+ */
+export declare function frameAfter(stack: ActionStack, id: FrameId): StackFrame | undefined;
+/**
+ * Return the depth (index from the bottom of the stack, 0-indexed) of
+ * the frame with the given id, or -1 if not present.
+ */
+export declare function frameDepth(stack: ActionStack, id: FrameId): number;

package/dist/engine/transition.d.ts

@@ -0,0 +1,22 @@
+/**
+ * @fileoverview Transition applier.
+ *
+ * `applyTransition` composes a sequence of mutations on top of `MatchState`,
+ * appends events to `recentEvents`, bumps `version` by 1 and `tick` by 1, and
+ * returns both the new state and a `StateTransition` record describing the
+ * change. Pure: never mutates the input state.
+ */
+import type { StateMutation, StateTransition, TransitionType, TransitionCause } from '../types/engine';
+import type { MatchState, GameEvent } from '../types/state';
+import type { StateVersion } from '../types/primitives';
+/** Increment a branded StateVersion. */
+export declare function inc(v: StateVersion): StateVersion;
+export interface ApplyTransitionResult {
+    readonly newState: MatchState;
+    readonly transition: StateTransition;
+}
+/**
+ * Apply mutations + events to state, producing a new state and a logged transition.
+ * Increments version by 1 and tick by 1. Pure: input state is not mutated.
+ */
+export declare function applyTransition(state: MatchState, mutations: ReadonlyArray<StateMutation>, events: ReadonlyArray<GameEvent>, cause: TransitionCause, type?: TransitionType): ApplyTransitionResult;