Import the game's save, and fix island loading races

CLAUDE.md

@@ -173,6 +173,12 @@ Share codes, saved layouts, the templates and the CLI's output are all blueprint
 are described in `packages/solver/CLAUDE.md`. **Never compare encoded codes to
 test whether two layouts match** — use `blueprintKey()`.
 
+The one code that is not a blueprint is the game's own: its Export to Optimizer
+button writes an `R2X1.` code with the player's whole save, read by
+`encoding/gameExport.ts` and mapped onto ours by `data/gameImport.ts`. Its format
+is the game's, specified in `docs/game-export.md`; the app side is in
+`src/lib/state/CLAUDE.md`.
+
 ### Two halves: UI shell and solver engine
 
 - **UI shell** — Svelte 5 components + runes state classes: paint a grid, manage

README.md

@@ -29,6 +29,12 @@ Workers so the board stays interactive while it thinks.
   best arrangement, so it keeps up to ten boards that tie on power and lets you
   cycle them and apply the one you like. Which tie is nicest to build is the one
   judgement the solver cannot make.
+- **Load your game.** The game's **Export to Optimizer** button copies a code
+  with your whole save — every island's cleared obstacles and buildings, your
+  unlocks, Time Lab and anomaly. Paste it into **Import code** and the optimizer
+  is set up exactly as you are, with research still in progress either counted
+  as done or turned into the upgrade plan. The format is in
+  [`docs/game-export.md`](docs/game-export.md).
 - **Share codes and links.** Any board — hand-built or solved — compresses to a
   short code, or a `?bp=` URL. Opening someone's link is a read-only preview
   until you choose to adopt it.

docs/SOLVER.md

@@ -9,8 +9,8 @@ the terminal.
 packages/solver/
   src/solver/     the engine: types, island split, simulation, distribution, search
   src/data/       the authored building tables, the anomaly table, the shipped island codes,
-                  unlock resolution
-  src/encoding/   the blueprint wire format
+                  unlock resolution, mapping a game export onto all of that
+  src/encoding/   the blueprint wire format, and a reader for the game's export code
   src/utils/      the game's number ladder
   src/grid.ts     tile predicates and the ASCII alphabet the tests are written in
   bin/            the CLI (`npm run solve`)

docs/game-export.md

@@ -0,0 +1,243 @@
+# Export to Optimizer — the game's export code
+
+Reactor 2's **Export to Optimizer** button produces one text code holding the
+player's whole current state; the player pastes it into the optimizer's
+**Import code** dialog, which loads every unlocked island (and resets the locked
+ones to their untouched maps), the roster, the Time Lab, the anomaly and any
+research in progress.
+
+This is the format's specification. It was written for the game's developer to
+implement from, against game 1.1.10, and the game now ships it; every type,
+order and encoding rule below is exact. Where something is a recommendation
+rather than a rule, it says so.
+
+- **Writer:** the game.
+- **Reader:** `packages/solver/src/encoding/gameExport.ts` decodes a code, and
+  `packages/solver/src/data/gameImport.ts` maps it onto the optimizer's islands,
+  roster and plan.
+- **Samples:** `packages/solver/tests/gameExports/` holds real codes the game
+  produced, and `tests/gameExport.test.ts` pins the reader against them.
+
+The format follows the style of the optimizer's own layout codes ("blueprints"):
+one byte per tile, a building implying grass beneath it, deflate + base64url.
+Their codec is
+[`blueprint.ts`](https://github.com/OGMods/reactor2-optimizer/blob/main/packages/solver/src/encoding/blueprint.ts),
+for reference only — this export does **not** reuse its fixed byte tables; it
+uses a palette instead (section 3).
+
+## 1. What the game does
+
+- A button (suggested: in Settings) labelled **Export to Optimizer**.
+- On press: build the code (section 4), copy it to the clipboard
+  (`GUIUtility.systemCopyBuffer`), show a toast such as
+  "Code copied — paste it into the optimizer."
+- Optional fallback: open the native Share sheet with the same text.
+- The export is **read-only and one-way**. It never modifies the save, and the
+  game never imports anything back.
+- No personal data: no player id, account name or device data.
+
+## 2. Game facts this spec relies on
+
+Read from the 1.1.10 build, and confirmed against the first real exports: every
+coordinate, island boundary, obstacle and transformer in them matches the scene.
+
+- **One scene, one grid.** Scene `level1` has a single isometric `Grid`
+  (cell size 0.82 × 0.48). All islands are on it.
+- **Three terrain tilemaps** on that grid:
+  - `Map Tilemap` — `TileGrass` or `TileWater` per cell.
+  - `Trees Tilemap` — obstacles. Four `ObstacleSO`s: `Map_Forest_Coniferous`,
+    `Map_Forest_Deciduous`, `Map_Pond`, `Map_Rock`.
+  - `CantBuildHere Tilemap` — the transformers (one per island). Its three
+    other cells are decorations outside the islands; ignore them.
+- **Islands are `Area`s.** Each `Area` has an `AreaSO` id and a
+  `PolygonCollider2D` outlining it. Every land cell is inside exactly one
+  polygon.
+
+  | Area id  | Scene object     | Land cells |
+  | -------- | ---------------- | ---------- |
+  | `area_1` | Island Left - 1  | 74         |
+  | `area_2` | Island Right - 1 | 90         |
+  | `area_3` | Island Left - 2  | 115        |
+  | `area_4` | Island Right - 2 | 162        |
+  | `area_5` | Island Left - 3  | 180        |
+  | `area_6` | Island Right - 3 | 200        |
+  | `area_7` | Island Left - 4  | 230        |
+  | `area_8` | Island Right - 4 | 265        |
+
+  `area_city` holds no player buildings. **Do not export it.**
+
+- **Player changes live in the save:** cleared obstacles in
+  `RemovedObstaclePositions`, clears in progress in `OngoingRemovals`, placed
+  buildings in `BuildingSaves`.
+- **All upgrades are research.** 76 `ResearchSO`s across domains: 39 building
+  nodes (unlocks and tiers, e.g. `research_building_cooler1`), 25 economy, 11
+  Time Lab, 1 city. Research in progress is `ResearchManagerSO`'s
+  `OngoingResearchData`; several can run at once.
+- **Placed buildings have no tier of their own.** They run at the building's
+  current research level, so the code does not store a tier per building.
+- **Buildings only stand on grass** — never on water, an obstacle or a
+  transformer. The format depends on this (section 4.3).
+
+## 3. Definitions
+
+- **Cell** — one Tilemap cell on the shared grid, addressed by integer `(x, y)`
+  exactly as `Tilemap.WorldToCell` returns it. If the save stores world
+  positions, convert them to cells before writing.
+- **Cell's area** — the `Area` whose `PolygonCollider2D` contains the cell's
+  centre (`Tilemap.GetCellCenterWorld`). This rule assigns every land cell to
+  exactly one area on the 1.1.10 map. If the game already has a cell-to-area
+  lookup, use that instead.
+- **Palette** — a list of string ids written once near the start of the code.
+  Each cell is then stored as **one byte: its index in the palette**. This keeps
+  the code short (one byte per cell instead of a name) and means there is no
+  fixed number-per-building table to maintain: the ids are the game's own
+  strings, and a building added in a future update just appears in the list.
+  The palette is part of this format, not something that exists in the game.
+- **Level** — the number of levels purchased; `0` means none. Never write a
+  0-based index. A building research node at level 0 is a building not yet
+  unlocked.
+- **Seconds left** — remaining time at the moment of export, as
+  `GetRemainingTimeSeconds` (or the equivalent) returns it, rounded down to a
+  whole number.
+
+## 4. The code
+
+### 4.1 Envelope
+
+```
+R2X1.<payload>
+```
+
+- `R2X1.` — literal prefix. `1` is the format version (section 5).
+- `<payload>` = base64url( raw deflate( payload bytes ) ).
+  - **Raw deflate**: `System.IO.Compression.DeflateStream`, which the 1.1.10
+    build already ships. It writes raw deflate (no zlib or gzip header). Use
+    `CompressionLevel.Optimal`.
+  - **base64url**: standard base64, then replace `+` → `-`, `/` → `_`, and strip
+    trailing `=`.
+- No checksum. A truncated paste fails to decompress, which is how the importer
+  detects it.
+
+### 4.2 Payload bytes
+
+Primitive encodings (what .NET's `BinaryWriter` writes, UTF-8):
+
+| Type     | Bytes                                                     |
+| -------- | --------------------------------------------------------- |
+| `byte`   | 1                                                         |
+| `int16`  | 2, little-endian, signed                                  |
+| `uint16` | 2, little-endian                                          |
+| `int32`  | 4, little-endian, signed                                  |
+| `string` | 7-bit-encoded length (LEB128), then that many UTF-8 bytes |
+
+Six sections, always present, always in this order:
+
+| #   | Section                 | Contents                                                                                                                |
+| --- | ----------------------- | ----------------------------------------------------------------------------------------------------------------------- |
+| 1   | Header                  | `string` game version (`Application.version`) · `string` anomaly id (`"none"` if none) · `byte` anomaly balance version |
+| 2   | Palette                 | `byte` count · count × `string` id                                                                                      |
+| 3   | Islands                 | `byte` count · per island: see 4.3                                                                                      |
+| 4   | Research                | `uint16` count · per `ResearchSO`, all domains: `string` research id · `uint16` level                                   |
+| 5   | Research in progress    | `uint16` count · per entry: `string` research id · `uint16` level it will reach · `int32` seconds left                  |
+| 6   | Obstacles being cleared | `uint16` count · per entry: `int16` x · `int16` y · `int32` seconds left                                                |
+
+Rules:
+
+- **Palette order.** Entries 0–6 are always the terrain, in exactly this order:
+  `TileWater`, `TileGrass`, `Map_Rock`, `Map_Forest_Coniferous`,
+  `Map_Forest_Deciduous`, `Map_Pond`, `CantBuildHere`. After them, one entry for
+  each distinct building id that appears on any exported island, in any order.
+  Building ids are the ids the game saves buildings under.
+- **Research ids** are the ids the game saves research under (`ResearchId`).
+  Write **every** `ResearchSO`, including those at level 0, so a missing id
+  always means "this build did not have it".
+- **Anomaly balance version** says which balance figures this save's anomaly
+  runs under, for anomalies rebalanced after saves already used them (as
+  Tidal Ascendancy was). Write `0` if the game keeps no such distinction.
+
+### 4.3 One island
+
+```
+string  area id            e.g. "area_3"
+byte    flags              bit 0 = unlocked; other bits 0
+int16   minX               bounding box of the area's cells
+int16   minY
+byte    width              maxX - minX + 1
+byte    height             maxY - minY + 1
+byte[width*height] cells
+```
+
+Write all eight areas, `area_1` to `area_8`, locked ones included (their
+obstacles matter for planning).
+
+Cell bytes run row by row: outer loop `y` from `minY` to `minY + height - 1`,
+inner loop `x` from `minX` to `minX + width - 1`. For each `(x, y)`, the byte is
+the palette index of:
+
+1. `TileWater` if the cell's area is not this island;
+2. else the building's id, if a building stands on the cell;
+3. else the obstacle on `Trees Tilemap`, unless `(x, y)` is in
+   `RemovedObstaclePositions`;
+4. else `CantBuildHere` if `CantBuildHere Tilemap` has a transformer there;
+5. else `TileGrass` or `TileWater` from `Map Tilemap` (no tile = `TileWater`).
+
+A building cell implies grass beneath it, so terrain and buildings share one
+grid.
+
+### 4.4 Worked example
+
+A palette of `TileWater, TileGrass, Map_Rock, Map_Forest_Coniferous,
+Map_Forest_Deciduous, Map_Pond, CantBuildHere, cooler2, generator7` and this
+3 × 2 island:
+
+```
+y = minY     : water  grass   rock
+y = minY + 1 : grass  cooler2 generator7
+```
+
+has the cell bytes `00 01 02 01 07 08`.
+
+## 5. Versioning
+
+- The format version is the digit in the `R2X1.` prefix.
+- **Appending a new section at the end: no version bump.** The importer reads
+  the sections it knows and ignores trailing bytes.
+- **Changing, reordering or removing anything: bump the version** (`R2X2.`).
+  The importer refuses versions it does not know.
+- The game version string in the header tells the importer which building and
+  balance tables to use, so an old code still reads correctly.
+- **Ids are permanent.** Never reuse or rename a building, research, anomaly
+  or area id; add new ids instead.
+
+## 6. Expected size
+
+Measured by encoding the real 1.1.10 map:
+
+| Save                                    | Code length (characters) |
+| --------------------------------------- | ------------------------ |
+| Fresh save, no buildings                | 2,342                    |
+| Mid game, 60% of grass built on         | 2,852                    |
+| Late game, boards full                  | 2,985                    |
+| Worst case, 42 building kinds at random | 3,342                    |
+
+About 1,100 characters of each code are id strings; the rest is tiles. The
+first three real exports came to 2,347–2,460 characters.
+
+## 7. Notes from the first exports
+
+- **The two forests are named the other way round from our tiles.**
+  `Map_Forest_Deciduous` is the optimizer's `tree1` and
+  `Map_Forest_Coniferous` its `tree2`. Nothing for the game to change; the
+  reader maps them.
+- **Research ids are the game's, verbatim.** Gas plant's node is
+  `research_gas_plant`, not `research_building_gas_plant`, and two economy ids
+  end in a space (`DepositsSlotsResearchSO `, `IslandPriceReductionResearchSO `).
+  The roster also lists `research_building_tidal_plant`, a building the
+  optimizer does not carry yet. The reader matches ids exactly and skips unknown
+  ones.
+- **A code can pick up stray characters when pasted.** One sample ended in a
+  stray `ś`. The reader drops anything outside the base64url alphabet before
+  decoding; a code damaged in the middle still fails, at the inflate.
+- **Open question:** one sample reported a research in progress with 0 seconds
+  left. Either it had finished but was not collected, or the seconds are not
+  being read from the running timer.