@v12-engine/engine 0.1.0 → 0.4.0

package/dist/ai/economy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"economy.js","names":[],"sources":["../../src/ai/economy.ts"],"sourcesContent":["import { baseStats, constructionOf, type ResourceId, type UnitTypeDef } from '#engine/defs'\nimport type { AiArea } from './area'\nimport type { AiReport } from './report'\nimport { queueOf } from '#engine/systems/productionQueue'\nimport { builtSoFar } from '#engine/systems/construction'\nimport { snapshotOf } from '#engine/components'\nimport { distSq, type Vec2 } from '#engine/math'\nimport { gathering } from '#engine/orders/harvest'\nimport type { EntityState } from '#engine/session/protocol'\nimport { gathers } from '#engine/shared'\nimport { type Brain } from './brain'\nimport { type AiModule, type AiModuleDef, defineModule } from './module'\nimport { type AiCondition, evaluate } from './rules'\nimport type { Base, UnitSet } from './view'\nimport { pair, point, where } from './geometry'\nimport { ENGAGED, HALL_REACH } from './reach'\n\n/*\n * The economy (AI plan, C4): the workers, base by base. The old melee player sent an idle worker to the nearest mine\n * with a hall by it and trained workers while it had fewer than so many a hall; nothing kept count of where they\n * worked, so a new hall by a second mine was staffed only by what it trained itself, a mine past what it could take\n * kept getting more, and a raid on the mine was met by workers mining on. This is what a player watches on their\n * economy, written down:\n *\n * - **Workers per base, per resource** (`workersPer`): so many on the money at each base, so many on the other\n *   resource (harvest priorities, a town at a time). An idle worker goes where the most are missing, the\n *   nearest base first among equals.\n * - **Saturation** (`saturate`): a mine takes only so many workers before more of them only queue at it. A worker in\n *   a mine it enters one at a time (`resource.entered`, `slots`) is inside for its gather time, then walks to the hall\n *   and back: while it walks, others go in, so a mine serves as many as fit in one round trip, `slots × (1 + walk /\n *   gather)`, rounded up (five, for a mine twelve steps from a hall). A deposit worked from beside it (a tree) serves\n *   as many as it has slots, by home or, where none is near home, the woods nearest it however far. What stands on a\n *   mine to gather it (`builtOn`, a cursed mine) serves its `gatherers`.\n *   Workers past what their base's deposits serve are not trained.\n * - **Rebalancing**: a base whose deposits ran out, or that has more on them than they serve, gives what it has spare\n *   to a base that is short (a new expansion): workers walk over rather than wait for the new hall to train its own.\n * - **Training** workers at every hall that stands, up to what the bases want together, and a builder or so more\n *   (`builders`): a worker sent to build is off its mine meanwhile.\n * - **Expansions** (`expansions`, `expandWhen`): another hall by a mine nobody has a hall at, near enough home, once\n *   the condition holds (time and an army building, when left out): a want of the build plan, which saves up for it,\n *   sends a worker to look at the ground first where nobody has (the settler), and builds it anew when lost.\n * - **Workers flee a raid** (`workersFlee`): workers a raid is on, at a base its fighters do not hold, walk to the\n *   nearest base no enemy is at, and back to work at their own once it has stood clear a while.\n * - **What goes up by builders** gets one where nobody works on it, and **what the money is gathered at** where it\n *   has to stand on the mine first (`builtOn`) is built at each hall before anything else.\n *\n * Mending and building anew what was lost are the build plan's (B3: `repair`, `rebuild`). What the economy remembers\n * (who fled from where) is plain data in the brain's memory (`BrainMemory.economy`).\n */\n\n/** How far from home a mine is taken for another hall: further is across the map */\nconst EXPAND_REACH = 64\n/** A point so far from a place on the way to another */\nfunction towards(from: Vec2, to: Vec2, distance: number): Vec2 {\n\tconst length = Math.sqrt(distSq(from, to))\n\tif (length <= distance) return { x: to.x, z: to.z }\n\treturn { x: from.x + ((to.x - from.x) / length) * distance, z: from.z + ((to.z - from.z) / length) * distance }\n}\n\n/** How far from a mine's middle its side is, a mine being 3 or 4 wide: where a route to it goes */\nconst MINE_SIDE = 3.5\n/** How far from a mine's middle a route may end and the mine still count as walked to: by its side, a mine being 3 or 4 wide */\nconst MINE_WALK_REACH = 6\n/** How near a base what is at it is */\nconst AT_BASE = 20\n/** How far round the nearest tree the woods go that home gathers from, where none is near home */\nconst WOODS = 12\n/** The odds of the base's fighters near a worker against the foes on it, under which the worker runs */\nconst FLEE_UNDER = 0.5\n/** Seconds a base a worker fled from stands clear before it goes back */\nconst CLEAR_FOR = 5\n/** How near its builder a building half built is being worked on */\nconst AT_SITE = 10\n/** How many workers rebalancing moves in a think: a few at a time, so that a base never empties at once */\nconst MOVE_AT_ONCE = 3\n/** Seconds the other resource runs short, with the money piling up, before one more worker goes to it (AI2) */\nconst BLOCKED = 15\n/** What counts as the other resource running short, and as the money piling up: what little a building or a unit costs of it, and enough for most */\nconst SHORT_UNDER = 100\nconst PILED = 300\n/** How many more workers on the other resource at most, for what waits on it */\nconst MORE_AT_MOST = 3\n/** What the economy holds the workers that fled by (`ai.goals.take`): no goal sends them anywhere until they are back */\nconst FLED = 'economy:fled'\n\n/**\n * How many workers a base wants on each resource (`EconomyOptions.workersPer`): as numbers by resource id, or a\n * function of the base (`index` 0 is home)\n *\n * @beta\n */\nexport type WorkersPer = Partial<Record<ResourceId, number>> | ((ai: Brain, base: Base, index: number) => Partial<Record<ResourceId, number>>)\n\n/**\n * How a brain runs its economy (`BrainDef.economy`, the seat's `AiOptions.economy` over it, the `economy()` module's\n * own under both). Every field has a data form a save keeps; the function forms are the brain's to give again\n *\n * @beta\n */\nexport interface EconomyOptions {\n\t/** Workers on the game's money at each base, where `workersPer` says nothing of it: 8 when left out */\n\tworkers?: number\n\t/** Workers on the other resource, at home only, where `workersPer` says nothing of it: 3 when left out */\n\tlumberjacks?: number\n\t/**\n\t * Workers on each resource at each base (`WorkersPer`): `{ gold: 5, lumber: 3 }` at every base, or a function of the\n\t * base for one that differs (home, an expansion). What it leaves out is `workers` and `lumberjacks`\n\t */\n\tworkersPer?: WorkersPer\n\t/** Whether a base wants no more workers on a deposit than it serves (see the file's comment): yes when left out */\n\tsaturate?: boolean\n\t/** Whether its halls train workers up to what the bases want: yes when left out */\n\ttrainWorkers?: boolean\n\t/**\n\t * Workers trained past what the bases want, to build with: a worker sent to build is off the mine meanwhile, and a\n\t * mine with only as many as it serves would gather less. 1 when left out\n\t */\n\tbuilders?: number\n\t/** Halls to have past the first, each by a mine nobody has a hall at: the seat's `expansions`, else none */\n\texpansions?: number\n\t/**\n\t * When it may expand: a condition (`AiCondition`, as data or a function). Four minutes in and with a building that\n\t * trains soldiers, when left out\n\t */\n\texpandWhen?: AiCondition\n\t/** Whether workers a raid is on walk to a base no enemy is at, and back once theirs is clear: yes when left out */\n\tworkersFlee?: boolean\n}\n\n/**\n * What the economy remembers between thinks, as a save keeps it: the workers that fled a raid\n *\n * @beta\n */\nexport interface EconomyMemory {\n\t/** The version of the memory's format: 1 so far */\n\tv: 1\n\t/** Each worker that fled, by id: the base it fled (its middle), where to, since when, and since when its base stood clear */\n\tfled: Record<string, { from: Vec2; to: Vec2; since: number; clear?: number }>\n\t/**\n\t * Workers more on the other resource at home, while it runs short with the money piling up (AI2): one more each\n\t * `BLOCKED` seconds it stays so, at most `MORE_AT_MOST`, one fewer each twice that once it is not. Since when it has\n\t * been short (`since`) or not (`easy`), and who was sent to it lately (`moved`)\n\t */\n\tmaterial?: { more: number; since?: number; easy?: number; moved?: Record<string, number> }\n}\n\n/**\n * One base as the economy sees it (`ai.economy.bases()`, the report): its deposits, what they serve, the workers it\n * wants and has on each resource\n *\n * @beta\n */\nexport interface EconomyBase {\n\t/** The view's base */\n\tbase: Base\n\t/** Its deposits it gathers from, by resource: those of the money with a hall by them (or something of its own on them), the rest near it */\n\tdeposits: Partial<Record<ResourceId, EntityState[]>>\n\t/** How many workers its deposits of each resource serve at once */\n\tserves: Partial<Record<ResourceId, number>>\n\t/** How many it wants on each resource: what it is to have, no more than what is served where it saturates */\n\twants: Partial<Record<ResourceId, number>>\n\t/** The workers at work on each resource at it, by id */\n\tworking: Partial<Record<ResourceId, number[]>>\n}\n\n/**\n * The economy as the report shows it (`AiReport.economy.bases`, `fled`): each base with what it wants and has, the\n * workers that fled, how many it trains, what the next expansion waits for\n *\n * @beta\n */\nexport interface EconomyReport {\n\t/** The bases, each with where it is, its hall's entity id and per resource the workers working, wanted and served by it */\n\tbases: { at: [number, number]; hall: number; workers: Record<ResourceId, [working: number, wants: number, serves: number]> }[]\n\t/** The workers that fled a raid, each with the unit's id, the place it fled and the tick it fled at */\n\tfled: { unit: number; from: [number, number]; since: number }[]\n\t/** Workers it has, those queued counted, and what its bases want together */\n\tworkers: [have: number, want: number]\n\t/** Where the next hall goes, and what it waits for: the build plan's status of the want */\n\texpansion?: string\n}\n\n/**\n * The id of the want for another hall, on the build plan\n *\n * @internal\n */\nexport const EXPAND_WANT = 'economy.expand'\n\n/**\n * A brain's economy (`ai.economy`): its workers, base by base, run by the `economy()` module each think (`think`), or\n * by the melee player's turn, and asked by whoever wants to know (`bases`, `freeMine`, `waiting`). Kept in the brain's\n * memory (`BrainMemory.economy`)\n *\n * @internal\n */\nexport class Economy implements AiArea {\n\t/** What finds it on a brain (`ai.area(Economy)`): made the first time a module asks for it */\n\tstatic readonly id = 'economy'\n\t/** Makes the economy of a brain; what `ai.area(Economy)` calls the first time a module asks for it */\n\tstatic make(ai: Brain): Economy {\n\t\treturn new Economy(ai)\n\t}\n\t/** Its id among the brain's areas: what its memory and its report are kept under */\n\treadonly id = 'economy'\n\t/** What the log says where a save's memory of it is of a shape it does not read */\n\treadonly afresh = 'the save remembers the computer player’s economy in a shape this brain does not read: it starts afresh'\n\n\t/** Whether an `economy()` module is in the brain, or the melee player runs it: without one, nothing here runs by itself */\n\tenabled = false\n\t/**\n\t * Whether everything else waits for what the money is gathered at (`builtOn`, a cursed mine), with none of it\n\t * standing and none on its way: there is no money without it\n\t */\n\twaiting = false\n\tprivate memory: EconomyMemory = { v: 1, fled: {} }\n\tprivate moduleOptions: EconomyOptions = {}\n\tprivate thoughtAt = -1\n\tprivate found: { tick: number; bases: EconomyBase[] } | undefined\n\tprivate trained = 0\n\n\tconstructor(\n\t\t/** The brain it runs the economy of */\n\t\treadonly ai: Brain\n\t) {}\n\n\t/** Puts the `economy()` module's options under the brain's settings: what the module is made with */\n\tconfigure(options: EconomyOptions): void {\n\t\tthis.moduleOptions = options\n\t\tthis.enabled = true\n\t}\n\n\t/** How it runs the economy: the module's options, the brain's settings over them (`ai.settings.economy`) */\n\tget options(): EconomyOptions {\n\t\treturn this.ai.cache('economy.options', () => ({ ...this.moduleOptions, ...this.ai.settings.economy }))\n\t}\n\n\t/** How many of a unit type its buildings have queued: on their way, for what is counted as had */\n\tprivate queued(type: string): number {\n\t\tlet count = 0\n\t\tfor (const entity of this.ai.view.mine) for (const item of queueOf(entity)) if (item.kind === 'unit' && item.id === type) count++\n\t\treturn count\n\t}\n\n\t/** What a base wants on a resource where nothing caps it: `workersPer`, then `workers` on the money everywhere, `lumberjacks` on the other at home */\n\tprivate asked(kind: ResourceId, base: Base, index: number): number {\n\t\tconst options = this.options\n\t\tconst per = typeof options.workersPer === 'function' ? options.workersPer(this.ai, base, index) : (options.workersPer ?? {})\n\t\tconst asked = per[kind] ?? (kind === this.money ? (options.workers ?? 8) : index === 0 ? (options.lumberjacks ?? 3) : 0)\n\t\t// more at home while what it saves for waits on it (AI2)\n\t\treturn kind === this.material && index === 0 ? asked + (this.memory.material?.more ?? 0) : asked\n\t}\n\n\t/** The game's money: what most things cost (`Registry.currency`), the first resource where it names none */\n\tget money(): ResourceId {\n\t\tconst { registry } = this.ai\n\t\treturn registry.currency ?? registry.resources[0]?.id ?? ''\n\t}\n\n\t/** The other resource workers gather, where the game has one (lumber, in melee) */\n\tget material(): ResourceId | undefined {\n\t\treturn this.ai.registry.resources.find((resource) => resource.id !== this.money)?.id\n\t}\n\n\t/** What gathers: the first worker type the player can make (`worker` role) */\n\tget worker(): UnitTypeDef | undefined {\n\t\treturn this.ai.view.typesOf('worker')[0]\n\t}\n\n\t/** What stands on a mine to gather it there (`topper` role: `builtOn` the money), where the game has one */\n\tget topper(): UnitTypeDef | undefined {\n\t\treturn this.ai.view.typesOf('topper')[0]\n\t}\n\n\t/**\n\t * What gathers the other resource where the worker does not (a ghoul, who fights too): of the gatherers the player\n\t * can make, the first that gathers it. The worker where it does\n\t */\n\tget lumberjack(): UnitTypeDef | undefined {\n\t\tconst { worker, material } = this\n\t\tif (material === undefined || !worker || gathers(worker, material)) return worker\n\t\treturn this.ai.view.typesOf('gatherer').find((def) => def.kind === 'unit' && def !== worker && gathers(def, material))\n\t}\n\n\t/** Whether a building takes deposits of a resource (`dropOff`) */\n\tprivate takes(def: UnitTypeDef, kind: ResourceId): boolean {\n\t\treturn def.dropOff === true || (Array.isArray(def.dropOff) && def.dropOff.includes(kind))\n\t}\n\n\t/**\n\t * Its bases as the economy sees them, once a think: each of the view's bases (home first) with the deposits it\n\t * gathers from, what they serve, the workers it wants and those at work there\n\t */\n\tbases(): EconomyBase[] {\n\t\tconst { ai } = this\n\t\tif (this.found?.tick === ai.tick) return this.found.bases\n\t\tconst { view } = ai\n\t\tconst { money, material, topper, worker } = this\n\t\tconst saturate = this.options.saturate ?? true\n\t\tconst halls = view.mine\n\t\t\t.buildings()\n\t\t\t.finished()\n\t\t\t.where((_, def) => this.takes(def, money))\n\t\tconst toppers = topper ? view.mine.ofType(topper.id).finished() : undefined\n\t\tconst mines = view.resources.ofResource(money).alive()\n\t\tconst reach = HALL_REACH * HALL_REACH\n\t\tconst bases: EconomyBase[] = view.bases().map((base, index) => {\n\t\t\tconst deposits: EconomyBase['deposits'] = {}\n\t\t\tconst serves: EconomyBase['serves'] = {}\n\t\t\t// the money: the mines with a hall of its own by them, at this base; or, where the money is gathered at what\n\t\t\t// stands on a mine, those with one of its own on them\n\t\t\tconst served = mines.filter((each) =>\n\t\t\t\ttoppers\n\t\t\t\t\t? toppers.some((top) => top.x === each.x && top.z === each.z && base.buildings.has(top.id))\n\t\t\t\t\t: halls.some((hall) => distSq(hall, each) < reach && base.buildings.has(hall.id))\n\t\t\t)\n\t\t\tdeposits[money] = served\n\t\t\tserves[money] = served.reduce((sum, each) => sum + this.serving(each, base), 0)\n\t\t\tif (material !== undefined) {\n\t\t\t\tlet trees = view.resourcesNear(base).ofResource(material).alive().items\n\t\t\t\t// none by home (a hall away from the woods): the woods nearest it, however far, or home would never want any\n\t\t\t\tif (!trees.length && index === 0) {\n\t\t\t\t\tconst nearest = view.resources.ofResource(material).alive().nearest(base.at)\n\t\t\t\t\tif (nearest) trees = view.resourcesNear(nearest, WOODS).ofResource(material).alive().items\n\t\t\t\t}\n\t\t\t\tdeposits[material] = trees as EntityState[]\n\t\t\t\tserves[material] = trees.reduce((sum, each) => sum + (view.def(each).resource?.slots ?? 1), 0)\n\t\t\t}\n\t\t\tconst wants: EconomyBase['wants'] = {}\n\t\t\tfor (const kind of [money, ...(material !== undefined ? [material] : [])]) {\n\t\t\t\t// the workers only want what they can gather: the other resource is the lumberjacks' where they do not\n\t\t\t\tif (!worker || !gathers(worker, kind)) continue\n\t\t\t\tconst want = this.asked(kind, base, index)\n\t\t\t\twants[kind] = saturate ? Math.min(want, serves[kind] ?? 0) : (serves[kind] ?? 0) > 0 ? want : 0\n\t\t\t}\n\t\t\treturn { base, deposits, serves, wants, working: {} }\n\t\t})\n\t\t// who works where: each harvesting worker at the base nearest where it walks to (the mine, or the hall it brings\n\t\t// what it carries to: either is its base's; one sent to another base counts there on its way), else where it is,\n\t\t// on what it carries (or what it walks to)\n\t\tif (worker) {\n\t\t\tfor (const unit of view.mine.ofType(worker.id)) {\n\t\t\t\tif (unit.own?.order !== 'harvest') continue\n\t\t\t\tconst kind = snapshotOf(unit, gathering)?.kind ?? this.kindNear(unit.own.goal ?? unit)\n\t\t\t\tconst at = unit.own.goal ?? unit\n\t\t\t\tlet best: EconomyBase | undefined\n\t\t\t\tlet bestDistance = Infinity\n\t\t\t\tfor (const each of bases) {\n\t\t\t\t\tconst d = distSq(each.base.at, at)\n\t\t\t\t\tif (d < bestDistance) {\n\t\t\t\t\t\tbestDistance = d\n\t\t\t\t\t\tbest = each\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (best) (best.working[kind] ??= []).push(unit.id)\n\t\t\t}\n\t\t}\n\t\tthis.found = { tick: ai.tick, bases }\n\t\treturn bases\n\t}\n\n\t/** The resource of the deposit nearest a place: what a worker walking there will gather. The money where none is near */\n\tprivate kindNear(at: Vec2): ResourceId {\n\t\tconst near = this.ai.view.resources.nearest(at)\n\t\treturn near && distSq(near, at) < 6 * 6 ? (this.ai.view.def(near).resource?.id ?? this.money) : this.money\n\t}\n\n\t/**\n\t * How many workers one deposit of the money serves at once, as worked by this base (see the file's comment): what\n\t * stands on it to gather it says (`gatherers`); one entered serves its slots for every round trip from the hall\n\t * nearest it; one worked from beside, its slots\n\t */\n\tserving(deposit: EntityState, base: Base): number {\n\t\tconst { view, registry } = this.ai\n\t\tconst def = view.def(deposit)\n\t\tconst resource = def.resource\n\t\tconst { topper, worker } = this\n\t\tif (topper?.builtOn === resource?.id && topper) return topper.gatherers ?? 5\n\t\tif (!resource?.entered || !worker) return resource?.slots ?? 1\n\t\tconst hall = base.buildings.where((_, each) => this.takes(each, resource.id)).nearest(deposit)\n\t\tif (!hall) return resource.slots\n\t\t// the walk between the two edges: what has no size of its own (a deposit) stands in for nothing\n\t\tconst size = (each: UnitTypeDef) => (each.stats ? baseStats(each, registry).radius : 0) || 0\n\t\tconst speed = baseStats(worker, registry).moveSpeed || 0\n\t\tconst gap = Math.max(0, Math.sqrt(distSq(hall, deposit)) - size(view.def(hall)) - size(def))\n\t\tconst gather = resource.gatherTime ?? worker.harvester?.gatherTime ?? 1\n\t\tconst walk = speed > 0 ? (2 * gap) / speed : 0\n\t\treturn Math.max(1, Math.ceil((resource.slots || 1) * (1 + walk / Math.max(0.1, gather))))\n\t}\n\n\t/** Whether a unit is busy for someone else: in a squad (on an errand), held by a rule, or fled */\n\tprivate busy(unit: EntityState): boolean {\n\t\tconst { ai } = this\n\t\treturn ai.squads.squadOf(unit) !== undefined || ai.goals.ruled(unit.id) || this.memory.fled[unit.id] !== undefined\n\t}\n\n\t/**\n\t * A gold mine near enough home that nobody has a hall by, and nothing of anyone's stands on, and that a worker can\n\t * walk to from home: the nearest, for another hall. None where every one is taken, or none is known. A mine on\n\t * ground cut off from home (a plateau with no ramp, an island) is left out: the walk to it is asked of the ground\n\t * the player knows each time, nearest first, so the answer is the picture's alone\n\t */\n\tfreeMine(): Vec2 | undefined {\n\t\tconst { view } = this.ai\n\t\tconst home = view.home()\n\t\tif (!home) return undefined\n\t\tconst money = this.money\n\t\t// anyone's hall that takes the money, in sight or remembered\n\t\tconst halls = view.all.filter((entity) => view.def(entity).kind === 'building' && this.takes(view.def(entity), money))\n\t\tconst reach = HALL_REACH * HALL_REACH\n\t\tconst most = EXPAND_REACH * EXPAND_REACH\n\t\tconst free = [...view.mines()]\n\t\t\t.map((mine) => ({ mine, d: distSq(mine, home) }))\n\t\t\t.filter(({ mine, d }) => d < most && !halls.some((hall) => distSq(hall, mine) < reach))\n\t\t\t.sort((a, b) => a.d - b.d || a.mine.id - b.mine.id)\n\t\t// from the hall's side towards each mine: the ground under the hall itself has no route out\n\t\tconst out = (view.def(home).radius ?? 2) + 1.5\n\t\tfor (const { mine } of free) if (this.walkable(towards(home, mine, out), mine)) return { x: mine.x, z: mine.z }\n\t\treturn undefined\n\t}\n\n\t/** Whether a worker walks from one place to a mine: the route over the ground known to its side (the mine itself is in the way) ends by it */\n\tprivate walkable(from: Vec2, mine: Vec2): boolean {\n\t\tconst route = this.ai.view.findPath(from, towards(mine, from, MINE_SIDE))\n\t\tconst end = route?.[route.length - 1]\n\t\treturn !!end && distSq(end, mine) <= MINE_WALK_REACH * MINE_WALK_REACH\n\t}\n\n\t/**\n\t * The think, once a think: a builder to every building half built that nobody works on, workers off a raid and back,\n\t * idle workers to where they are missing, the spare moved where short, the other resource's gatherers, what the\n\t * money is gathered at, workers trained, the next hall wanted. A second call in the same think does nothing\n\t */\n\tthink(): void {\n\t\tconst { ai } = this\n\t\tif (this.thoughtAt === ai.tick) return\n\t\tthis.thoughtAt = ai.tick\n\t\tthis.trained = 0\n\t\tthis.prune()\n\t\tconst options = this.options\n\t\tthis.sites()\n\t\tif (options.workersFlee ?? true) this.flee()\n\t\tthis.back()\n\t\tthis.blocked()\n\t\tthis.assign()\n\t\tthis.rebalance()\n\t\tthis.toMaterial()\n\t\tthis.lumberjacks()\n\t\tthis.toppers()\n\t\tif (options.trainWorkers ?? true) this.train()\n\t\tthis.expand()\n\t}\n\n\t/**\n\t * Whether the other resource holds it up (lumber, where gold is the money): under `SHORT_UNDER` of it with `PILED` of\n\t * the money or more, what it has as the snapshot says. One more worker on it at home each `BLOCKED` seconds it is so,\n\t * at most `MORE_AT_MOST`; one fewer each twice that once it is not\n\t */\n\tprivate blocked(): void {\n\t\tconst { ai } = this\n\t\tconst { material } = this\n\t\tif (material === undefined) return\n\t\tconst tick = ai.tick\n\t\tconst period = BLOCKED * ai.session.tickRate\n\t\tconst kept = this.memory.material\n\t\tconst have = ai.view.me.resources\n\t\tif ((have[material] ?? 0) < SHORT_UNDER && (have[this.money] ?? 0) >= PILED) {\n\t\t\tconst state = (this.memory.material ??= { more: 0 })\n\t\t\tdelete state.easy\n\t\t\tstate.since ??= tick\n\t\t\tif (tick - state.since < period || state.more >= MORE_AT_MOST) return\n\t\t\tstate.more++\n\t\t\tstate.since = tick\n\t\t\tai.decide(`puts ${state.more} more on ${material} at home: ${this.money} piles up while ${material} runs short`, { kind: 'economy' })\n\t\t\treturn\n\t\t}\n\t\tif (!kept) return\n\t\tdelete kept.since\n\t\tif (kept.more <= 0) {\n\t\t\tdelete this.memory.material\n\t\t\treturn\n\t\t}\n\t\tkept.easy ??= tick\n\t\tif (tick - kept.easy < period * 2) return\n\t\tkept.more--\n\t\tkept.easy = tick\n\t}\n\n\t/**\n\t * Home short on the other resource while more are put on it (`blocked`), and nobody idle to send: a worker of the\n\t * money at home, carrying nothing, goes to the trees by home. One a think\n\t */\n\tprivate toMaterial(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst { material, money, worker } = this\n\t\tif (material === undefined || !(this.memory.material?.more ?? 0) || !worker || !gathers(worker, material)) return\n\t\tconst home = this.bases()[0]\n\t\tif (!home || (home.wants[material] ?? 0) - (home.working[material]?.length ?? 0) <= 0) return\n\t\tconst tree = nearestOf(home.deposits[material] ?? [], home.base.at)\n\t\tif (!tree) return\n\t\t// those sent this way a little while ago are on their way still, counted on what they carried last\n\t\tconst state = this.memory.material!\n\t\tconst moved = (state.moved ??= {})\n\t\tfor (const id in moved) {\n\t\t\tconst unit = view.byId(Number(id))\n\t\t\t// there once it gathers it, or no longer at it; a minute at the most\n\t\t\tif (!unit || unit.own?.order !== 'harvest' || snapshotOf(unit, gathering)?.kind === material || ai.tick - moved[id] >= 60 * ai.session.tickRate)\n\t\t\t\tdelete moved[id]\n\t\t}\n\t\tconst missing = (home.wants[material] ?? 0) - (home.working[material]?.length ?? 0) - Object.keys(moved).length\n\t\tif (missing <= 0) return\n\t\tconst from = (home.working[money] ?? [])\n\t\t\t.map((id) => view.byId(id)!)\n\t\t\t.filter((unit) => unit && moved[unit.id] === undefined && !unit.own?.hidden && !snapshotOf(unit, gathering)?.carrying && !this.busy(unit))\n\t\t\t.sort((a, b) => distSq(a, tree) - distSq(b, tree) || a.id - b.id)[0]\n\t\tif (!from) return\n\t\tai.send({ type: 'order', entities: [from.id], order: { type: 'harvest', target: tree.id } })\n\t\tmoved[from.id] = ai.tick\n\t\tai.decide(`moves a worker from ${money} to ${material} at home`, { kind: 'economy' })\n\t}\n\n\t/** Whether it has run at all: by the module, or the melee player's turn */\n\tget running(): boolean {\n\t\treturn this.enabled || this.thoughtAt >= 0\n\t}\n\n\t/** Marks the think's economy done another way (a brain's own turn that ran it itself): `think` does nothing more this think */\n\tdone(): void {\n\t\tthis.thoughtAt = this.ai.tick\n\t}\n\n\t/** What is remembered of the dead, or of what is no longer its own, let go of */\n\tprivate prune(): void {\n\t\tconst { view, goals } = this.ai\n\t\tfor (const id in this.memory.fled) if (!view.mine.has(Number(id))) delete this.memory.fled[id]\n\t\t// what it holds and no longer remembers as fled (a save of before, a unit given away) is let go of\n\t\tconst held = goals.held(FLED)\n\t\tif (held) {\n\t\t\tconst away = held.units.filter((id) => this.memory.fled[id] === undefined)\n\t\t\tif (away.length) goals.drop(FLED, away)\n\t\t}\n\t}\n\n\t/** Its workers, as of the think */\n\tprivate workers(): UnitSet {\n\t\tconst { worker } = this\n\t\tconst { view } = this.ai\n\t\treturn worker ? view.mine.ofType(worker.id) : view.mine.where(() => false)\n\t}\n\n\t/** A builder to every building of its own going up by builders that nobody works on: the nearest free worker */\n\tprivate sites(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst workers = this.workers()\n\t\tfor (const site of view.mine) {\n\t\t\t// what goes up on its own needs nobody\n\t\t\tif (builtSoFar(site) === undefined || constructionOf(view.def(site)) !== 'builder') continue\n\t\t\tconst busy = workers.some(\n\t\t\t\t(worker) => (worker.own?.order === 'build' || worker.own?.order === 'construct') && distSq(worker, site) < AT_SITE * AT_SITE\n\t\t\t)\n\t\t\t// one sent to it lately is on its way, whatever a picture a few ticks old says (a think sliced by its budget)\n\t\t\tconst sent = `construct:${site.id}:`\n\t\t\tif (busy || workers.some((worker) => ai.sentTo(worker.id)?.key === sent)) continue\n\t\t\tconst helper = workers.where((worker) => !worker.own?.hidden && worker.own?.order !== 'build' && !this.busy(worker)).nearest(site)\n\t\t\tif (helper) ai.send({ type: 'order', entities: [helper.id], order: { type: 'construct', target: site.id } })\n\t\t}\n\t}\n\n\t/**\n\t * Workers a raid is on, at a base its fighters do not hold: off to the nearest base no enemy is at. A worker with no\n\t * such base stays at work: there is nowhere better to be\n\t */\n\tprivate flee(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst foes = view.hostile\n\t\t\t.alive()\n\t\t\t.units()\n\t\t\t.where((entity, def) => !entity.asleep && !!def.attacks?.length)\n\t\tif (!foes.length) return\n\t\tconst bases = view.bases()\n\t\tconst safe = bases.filter((base) => !foes.near(base.at, AT_BASE).length)\n\t\tif (!safe.length) return\n\t\tconst fled: EntityState[] = []\n\t\tfor (const unit of this.workers()) {\n\t\t\tif (unit.own?.hidden || this.busy(unit) || unit.own?.order === 'build') continue\n\t\t\tconst on = foes.near(unit, ENGAGED)\n\t\t\tif (!on.length) continue\n\t\t\t// held, where the base's fighters near it stand a fair chance against what is on it\n\t\t\tconst guards = view.mine.fighters().near(unit, ENGAGED * 2)\n\t\t\tif (guards.length && view.strength.odds(guards, on) >= FLEE_UNDER) continue\n\t\t\tconst from = bases.reduce((best, base) => (distSq(base.at, unit) < distSq(best.at, unit) ? base : best), bases[0])\n\t\t\tconst to = safe\n\t\t\t\t.filter((base) => base !== from)\n\t\t\t\t.reduce<Base | undefined>((best, base) => (!best || distSq(base.at, unit) < distSq(best.at, unit) ? base : best), undefined)\n\t\t\tif (!to) continue\n\t\t\tthis.memory.fled[unit.id] = { from: point(from.at), to: point(to.at), since: ai.tick }\n\t\t\tfled.push(unit)\n\t\t}\n\t\tif (!fled.length) return\n\t\t// by where they go: one order for those going the same way\n\t\tconst byDestination = new Map<string, { to: Vec2; ids: number[] }>()\n\t\tfor (const unit of fled) {\n\t\t\tconst to = this.memory.fled[unit.id].to\n\t\t\tconst key = `${to.x},${to.z}`\n\t\t\tconst entry = byDestination.get(key) ?? byDestination.set(key, { to, ids: [] }).get(key)!\n\t\t\tentry.ids.push(unit.id)\n\t\t}\n\t\t// held while away, so that nothing else sends them off (a scout wanted: the pool's workers are a goal's to take)\n\t\tai.goals.take(\n\t\t\tfled.map((unit) => unit.id),\n\t\t\t'told',\n\t\t\t{ id: FLED, seconds: Infinity }\n\t\t)\n\t\tfor (const { to, ids } of byDestination.values()) {\n\t\t\tai.send({ type: 'order', entities: ids, order: { type: 'move', point: to } })\n\t\t\tai.decide(`${ids.length === 1 ? '1 worker flees' : `${ids.length} workers flee`} a raid to the base at ${where(to)}`, { kind: 'economy' })\n\t\t}\n\t}\n\n\t/** Those that fled, back to work at their own base once it has stood clear long enough */\n\tprivate back(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst foes = view.hostile\n\t\t\t.alive()\n\t\t\t.units()\n\t\t\t.where((entity, def) => !entity.asleep && !!def.attacks?.length)\n\t\tconst back: number[] = []\n\t\tfor (const id in this.memory.fled) {\n\t\t\tconst fled = this.memory.fled[id]\n\t\t\tif (foes.near(fled.from, AT_BASE).length) {\n\t\t\t\tdelete fled.clear\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfled.clear ??= ai.tick\n\t\t\tif (ai.tick - fled.clear < CLEAR_FOR * ai.session.tickRate) continue\n\t\t\tback.push(Number(id))\n\t\t\tdelete this.memory.fled[id]\n\t\t}\n\t\tif (!back.length) return\n\t\tai.goals.drop(FLED, back)\n\t\t// to the deposit of the money nearest each: to work where they were\n\t\tconst bases = this.bases()\n\t\tconst byDeposit = new Map<number, number[]>()\n\t\tfor (const id of back) {\n\t\t\tconst unit = view.byId(id)!\n\t\t\tconst deposit = bases\n\t\t\t\t.flatMap((each) => each.deposits[this.money] ?? [])\n\t\t\t\t.reduce<EntityState | undefined>((best, each) => (!best || distSq(each, unit) < distSq(best, unit) ? each : best), undefined)\n\t\t\tif (deposit) (byDeposit.get(deposit.id) ?? byDeposit.set(deposit.id, []).get(deposit.id)!).push(id)\n\t\t}\n\t\tfor (const [target, entities] of byDeposit) ai.send({ type: 'order', entities, order: { type: 'harvest', target } })\n\t\tai.decide(`${back.length === 1 ? '1 worker goes' : `${back.length} workers go`} back to work: the raid is over`, { kind: 'economy' })\n\t}\n\n\t/**\n\t * The idle workers, each to the base and resource where the most are missing (the nearest base among equals); with\n\t * nothing missing anywhere, to the money at the nearest base that has some, rather than stand about\n\t */\n\tprivate assign(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst home = view.home()\n\t\tconst idle = this.workers().where((unit) => !!unit.own && !unit.own.order && !unit.own.hidden && !this.busy(unit))\n\t\tif (!idle.length || !home) return\n\t\tconst bases = this.bases()\n\t\tconst { money } = this\n\t\t// how many each base is short on each resource, as it stands, less what this think sends\n\t\tconst short = bases.map((each) => {\n\t\t\tconst missing: Partial<Record<ResourceId, number>> = {}\n\t\t\tfor (const kind in each.wants) missing[kind] = each.wants[kind]! - (each.working[kind]?.length ?? 0)\n\t\t\treturn missing\n\t\t})\n\t\tconst orders = new Map<number, number[]>()\n\t\tfor (const unit of idle) {\n\t\t\tlet best: { at: number; kind: ResourceId; missing: number; distance: number } | undefined\n\t\t\tbases.forEach((each, at) => {\n\t\t\t\tfor (const kind in short[at]) {\n\t\t\t\t\tconst missing = short[at][kind]!\n\t\t\t\t\tif (missing <= 0 || !each.deposits[kind]?.length) continue\n\t\t\t\t\tconst distance = distSq(each.base.at, unit)\n\t\t\t\t\tif (!best || missing > best.missing || (missing === best.missing && distance < best.distance)) best = { at, kind, missing, distance }\n\t\t\t\t}\n\t\t\t})\n\t\t\tlet deposit: EntityState | undefined\n\t\t\tif (best) {\n\t\t\t\tshort[best.at][best.kind]! -= 1\n\t\t\t\tconst base = bases[best.at]\n\t\t\t\t// the money: the deposit of the base nearest the worker; the other: the deposit nearest the base's middle, where\n\t\t\t\t// the walk to the hall is shortest\n\t\t\t\tdeposit = best.kind === money ? nearestOf(base.deposits[money]!, unit) : nearestOf(base.deposits[best.kind]!, base.base.at)\n\t\t\t} else {\n\t\t\t\t// nothing missing anywhere: on the money nearest it all the same; with no hall by any mine, the mine nearest home\n\t\t\t\tconst served = bases.flatMap((each) => each.deposits[money] ?? [])\n\t\t\t\tdeposit = served.length ? nearestOf(served, unit) : this.topper ? undefined : view.resources.ofResource(money).alive().nearest(home)\n\t\t\t}\n\t\t\tif (deposit) (orders.get(deposit.id) ?? orders.set(deposit.id, []).get(deposit.id)!).push(unit.id)\n\t\t}\n\t\tfor (const [target, entities] of orders) ai.send({ type: 'order', entities, order: { type: 'harvest', target } })\n\t}\n\n\t/**\n\t * A base with more on the money than its deposits serve (or with none left) gives its spare to a base that is short,\n\t * a few a think: those not carrying anything, so that nothing gathered is lost on the way\n\t */\n\tprivate rebalance(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst { money } = this\n\t\tconst bases = this.bases()\n\t\tif (bases.length < 2) return\n\t\tlet moved = 0\n\t\tfor (const from of bases) {\n\t\t\tconst working = from.working[money] ?? []\n\t\t\tconst spare = working.length - (from.wants[money] ?? 0)\n\t\t\tif (spare <= 0) continue\n\t\t\tconst to = bases\n\t\t\t\t.filter((each) => each !== from && (each.wants[money] ?? 0) - (each.working[money]?.length ?? 0) > 0 && each.deposits[money]?.length)\n\t\t\t\t.sort((a, b) => distSq(a.base.at, from.base.at) - distSq(b.base.at, from.base.at))[0]\n\t\t\tif (!to) continue\n\t\t\tconst missing = (to.wants[money] ?? 0) - (to.working[money]?.length ?? 0)\n\t\t\tconst ids = working\n\t\t\t\t.map((id) => view.byId(id)!)\n\t\t\t\t.filter((unit) => !unit.own?.hidden && !snapshotOf(unit, gathering)?.carrying && !this.busy(unit))\n\t\t\t\t.slice(0, Math.min(spare, missing, MOVE_AT_ONCE - moved))\n\t\t\t\t.map((unit) => unit.id)\n\t\t\tif (!ids.length) continue\n\t\t\tconst deposit = nearestOf(to.deposits[money]!, from.base.at)!\n\t\t\tai.send({ type: 'order', entities: ids, order: { type: 'harvest', target: deposit.id } })\n\t\t\tai.decide(\n\t\t\t\t`moves ${ids.length === 1 ? '1 worker' : `${ids.length} workers`} from the base at ${where(from.base.at)} to the one at ${where(to.base.at)}: ${(from.wants[money] ?? 0) === 0 ? 'its mine is gone' : 'it has more than it serves'}`,\n\t\t\t\t{ kind: 'economy' }\n\t\t\t)\n\t\t\tmoved += ids.length\n\t\t\tif (moved >= MOVE_AT_ONCE) return\n\t\t}\n\t}\n\n\t/**\n\t * Where the worker does not gather the other resource: so many of what does (`lumberjack`, a ghoul) sent to the trees\n\t * by home, those at home first, as many as home wants on it (the seat's `lumberjacks`). They are trained as soldiers are\n\t */\n\tprivate lumberjacks(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst { lumberjack, worker, material } = this\n\t\tconst home = view.home()\n\t\tif (!lumberjack || lumberjack === worker || material === undefined || !home) return\n\t\tconst homeBase = view.bases()[0]\n\t\tconst wanted = homeBase ? this.asked(material, homeBase, 0) : 0\n\t\tconst all = view.mine.ofType(lumberjack.id).where((unit) => !unit.own?.hidden && !this.busy(unit))\n\t\tconst chopping = all.filter((unit) => unit.own?.order === 'harvest').length\n\t\tif (chopping >= wanted) return\n\t\tconst tree = view.resources.ofResource(material).nearest(home)\n\t\tif (!tree) return\n\t\tconst free = all.filter((unit) => unit.own?.order !== 'harvest' && distSq(unit, home) < HALL_REACH * HALL_REACH * 4)\n\t\tfree.sort((a, b) => distSq(a, home) - distSq(b, home))\n\t\tconst sent = free.slice(0, wanted - chopping)\n\t\tif (sent.length) ai.send({ type: 'order', entities: sent.map((unit) => unit.id), order: { type: 'harvest', target: tree.id } })\n\t}\n\n\t/**\n\t * Where mines are gathered from at what stands on them (`topper`): one put up on each mine by a hall of its own that\n\t * has none, a mine at a time, through the build plan. With none at all and none on its way, everything else waits\n\t * (`waiting`)\n\t */\n\tprivate toppers(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst { topper } = this\n\t\tthis.waiting = false\n\t\tif (!topper || view.mine.some((entity) => entity.own?.build === topper.id && entity.own.order === 'build')) return\n\t\tconst hall = view.typesOf('hall')[0]\n\t\tconst halls = hall ? view.mine.ofType(hall.id).finished() : view.mine.where(() => false)\n\t\tfor (const at of halls) if (ai.plans.build.build(topper, { near: { x: at.x, z: at.z }, by: 'economy' })) return\n\t\tthis.waiting = view.mine.ofType(topper.id).length === 0\n\t}\n\n\t/** How many workers the bases want together: what the halls train up to, with `builders` more */\n\twanted(): number {\n\t\tlet sum = 0\n\t\tfor (const each of this.bases()) for (const kind in each.wants) sum += each.wants[kind] ?? 0\n\t\treturn sum\n\t}\n\n\t/** Workers trained at every hall with nothing in its queue, while it has fewer (those queued counted) than its bases want */\n\tprivate train(): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst { worker } = this\n\t\tif (!worker) return\n\t\tconst halls = view.mine\n\t\t\t.buildings()\n\t\t\t.finished()\n\t\t\t.where((_, def) => (def.trains ?? []).includes(worker.id))\n\t\tlet have = this.workers().length + this.queued(worker.id)\n\t\tconst want = this.wanted() + (this.options.builders ?? 1)\n\t\t// those at a base that is short train first\n\t\tconst bases = this.bases()\n\t\tconst shortAt = (at: Vec2) => {\n\t\t\tconst base = bases.find((each) => each.base.buildings.some((building) => building.x === at.x && building.z === at.z))\n\t\t\tif (!base) return 0\n\t\t\tlet missing = 0\n\t\t\tfor (const kind in base.wants) missing += (base.wants[kind] ?? 0) - (base.working[kind]?.length ?? 0)\n\t\t\treturn missing\n\t\t}\n\t\tconst ready = halls.filter((each) => !queueOf(each).length)\n\t\tready.sort((a, b) => shortAt(b) - shortAt(a))\n\t\tfor (const at of ready) {\n\t\t\tif (have >= want) return\n\t\t\tif (!ai.plans.production.train(at, worker)) return\n\t\t\thave++\n\t\t\tthis.trained++\n\t\t}\n\t}\n\n\t/** Another hall by a free mine, as many as it is to have, once the condition holds: a standing want of the build plan */\n\tprivate expand(): void {\n\t\tconst { ai } = this\n\t\tconst hall = ai.view.typesOf('hall')[0]\n\t\tconst expansions = this.options.expansions ?? 0\n\t\tif (!hall || expansions <= 0) {\n\t\t\tai.plans.build.drop(EXPAND_WANT)\n\t\t\treturn\n\t\t}\n\t\tconst when = this.options.expandWhen ?? DEFAULT_EXPAND_WHEN\n\t\tai.plans.build.want({\n\t\t\tid: EXPAND_WANT,\n\t\t\ttype: hall.id,\n\t\t\tcount: 1 + expansions,\n\t\t\tpriority: 40,\n\t\t\tkeep: true,\n\t\t\tby: 'economy',\n\t\t\t// by the mine, not just within sight of it: the first ground seen on the way there would be as far as a hall\n\t\t\t// reaches. Where nobody has looked, the plan sends a worker first\n\t\t\twithin: HALL_REACH - 1,\n\t\t\tnear: () => this.freeMine(),\n\t\t\twhen: (brain) => evaluate(when, brain) && !!this.freeMine()\n\t\t})\n\t}\n\n\t/** The economy as the report shows it */\n\treport(): EconomyReport {\n\t\tconst { ai } = this\n\t\tconst { worker } = this\n\t\tconst running = this.running\n\t\tconst bases = running ? this.bases() : []\n\t\treturn {\n\t\t\tbases: bases.map((each) => {\n\t\t\t\tconst workers: EconomyReport['bases'][number]['workers'] = {}\n\t\t\t\tfor (const kind of new Set([...Object.keys(each.wants), ...Object.keys(each.working)]))\n\t\t\t\t\tworkers[kind] = [each.working[kind]?.length ?? 0, each.wants[kind] ?? 0, each.serves[kind] ?? 0]\n\t\t\t\treturn { at: pair(each.base.at), hall: each.base.centre.id, workers }\n\t\t\t}),\n\t\t\tfled: Object.entries(this.memory.fled).map(([unit, fled]) => ({ unit: Number(unit), from: pair(fled.from), since: fled.since })),\n\t\t\tworkers: [worker ? this.workers().length + this.queued(worker.id) : 0, running ? this.wanted() + (this.options.builders ?? 1) : 0],\n\t\t\t...(ai.plans.build.get(EXPAND_WANT) && { expansion: ai.plans.build.status(EXPAND_WANT) ?? 'new' })\n\t\t}\n\t}\n\n\t/** What it remembers, for a save: a copy */\n\t/** Whether it has anything to remember now: one that does not is left out of a save */\n\tremembers(): boolean {\n\t\treturn Object.keys(this.memory.fled).length > 0 || this.memory.material !== undefined\n\t}\n\n\t/** Its part of the brain's report */\n\treportTo(report: AiReport): void {\n\t\treport.economy = { ...report.economy, ...this.report() }\n\t}\n\n\t/** Gives a copy of the economy's memory, for a save of the brain */\n\tsave(): EconomyMemory {\n\t\treturn structuredClone(this.memory)\n\t}\n\n\t/** Takes back what `save` gave: whether it was read */\n\trestore(memory: unknown): boolean {\n\t\tconst given = memory as EconomyMemory | undefined\n\t\tif (!given || typeof given !== 'object' || given.v !== 1) return false\n\t\tthis.memory = {\n\t\t\tv: 1,\n\t\t\tfled: structuredClone(given.fled ?? {}),\n\t\t\t...(given.material && typeof given.material.more === 'number' && { material: { ...given.material } })\n\t\t}\n\t\treturn true\n\t}\n}\n\n/** When it expands, where nothing says: four minutes in, with a building that trains soldiers */\nconst DEFAULT_EXPAND_WHEN: AiCondition = { all: [{ time: { after: 240 } }, { units: { role: 'barracks' } }] }\n\n/** Of some entities, the one nearest a place */\nfunction nearestOf(entities: readonly EntityState[], to: Vec2): EntityState | undefined {\n\tlet best: EntityState | undefined\n\tlet bestDistance = Infinity\n\tfor (const each of entities) {\n\t\tconst d = distSq(each, to)\n\t\tif (d < bestDistance) {\n\t\t\tbestDistance = d\n\t\t\tbest = each\n\t\t}\n\t}\n\treturn best\n}\n\n/**\n * The economy module: the workers base by base each think (`ai.economy.think`): builders to sites, workers off a raid and\n * back, the idle where they are missing, the spare moved, the other resource's gatherers, what the money is gathered at,\n * workers trained, another hall wanted. With how it runs where the brain's definition and the seat's options say nothing\n * (`EconomyOptions`)\n *\n * @beta\n */\nexport const economy = (options: EconomyOptions = {}): AiModuleDef =>\n\tdefineModule({ id: 'economy', make: (ai: Brain): AiModule => {\n\t\tai.area(Economy).configure(options)\n\t\treturn {\n\t\t\tid: 'economy',\n\t\t\tphase: 'plan',\n\t\t\tthink: () => ai.area(Economy).think()\n\t\t}\n\t} })\n\ndeclare module './area' {\n\tinterface AreaMemories {\n\t\teconomy?: EconomyMemory\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;AAqDA,SAAS,QAAQ,MAAY,IAAU,UAAwB;CAC9D,MAAM,SAAS,KAAK,KAAK,OAAO,MAAM,EAAE,CAAC;CACzC,IAAI,UAAU,UAAU,OAAO;EAAE,GAAG,GAAG;EAAG,GAAG,GAAG;CAAE;CAClD,OAAO;EAAE,GAAG,KAAK,KAAM,GAAG,IAAI,KAAK,KAAK,SAAU;EAAU,GAAG,KAAK,KAAM,GAAG,IAAI,KAAK,KAAK,SAAU;CAAS;AAC/G;;AAGA,IAAM,YAAY;;AAIlB,IAAM,UAAU;;AAEhB,IAAM,QAAQ;;AAEd,IAAM,aAAa;;AAEnB,IAAM,YAAY;;AAIlB,IAAM,eAAe;;AAErB,IAAM,UAAU;;AAEhB,IAAM,cAAc;AACpB,IAAM,QAAQ;;AAEd,IAAM,eAAe;;AAErB,IAAM,OAAO;;;;;;AAyGb,IAAa,cAAc;;;;;;;;AAS3B,IAAa,UAAb,MAAa,QAA0B;CA2B5B;;CAzBV,OAAgB,KAAK;;CAErB,OAAO,KAAK,IAAoB;EAC/B,OAAO,IAAI,QAAQ,EAAE;CACtB;;CAEA,KAAc;;CAEd,SAAkB;;CAGlB,UAAU;;;;;CAKV,UAAU;CACV,SAAgC;EAAE,GAAG;EAAG,MAAM,CAAC;CAAE;CACjD,gBAAwC,CAAC;CACzC,YAAoB;CACpB;CACA,UAAkB;CAElB,YAEC,IACC;EADQ,KAAA,KAAA;CACP;;CAGH,UAAU,SAA+B;EACxC,KAAK,gBAAgB;EACrB,KAAK,UAAU;CAChB;;CAGA,IAAI,UAA0B;EAC7B,OAAO,KAAK,GAAG,MAAM,0BAA0B;GAAE,GAAG,KAAK;GAAe,GAAG,KAAK,GAAG,SAAS;EAAQ,EAAE;CACvG;;CAGA,OAAe,MAAsB;EACpC,IAAI,QAAQ;EACZ,KAAK,MAAM,UAAU,KAAK,GAAG,KAAK,MAAM,KAAK,MAAM,QAAQ,QAAQ,MAAM,GAAG,IAAI,KAAK,SAAS,UAAU,KAAK,OAAO,MAAM;EAC1H,OAAO;CACR;;CAGA,MAAc,MAAkB,MAAY,OAAuB;EAClE,MAAM,UAAU,KAAK;EAErB,MAAM,SADM,OAAO,QAAQ,eAAe,aAAa,QAAQ,WAAW,KAAK,IAAI,MAAM,KAAK,IAAK,QAAQ,cAAc,CAAC,EAAA,CACxG,UAAU,SAAS,KAAK,QAAS,QAAQ,WAAW,IAAK,UAAU,IAAK,QAAQ,eAAe,IAAK;EAEtH,OAAO,SAAS,KAAK,YAAY,UAAU,IAAI,SAAS,KAAK,OAAO,UAAU,QAAQ,KAAK;CAC5F;;CAGA,IAAI,QAAoB;EACvB,MAAM,EAAE,aAAa,KAAK;EAC1B,OAAO,SAAS,YAAY,SAAS,UAAU,EAAE,EAAE,MAAM;CAC1D;;CAGA,IAAI,WAAmC;EACtC,OAAO,KAAK,GAAG,SAAS,UAAU,MAAM,aAAa,SAAS,OAAO,KAAK,KAAK,CAAC,EAAE;CACnF;;CAGA,IAAI,SAAkC;EACrC,OAAO,KAAK,GAAG,KAAK,QAAQ,QAAQ,CAAC,CAAC;CACvC;;CAGA,IAAI,SAAkC;EACrC,OAAO,KAAK,GAAG,KAAK,QAAQ,QAAQ,CAAC,CAAC;CACvC;;;;;CAMA,IAAI,aAAsC;EACzC,MAAM,EAAE,QAAQ,aAAa;EAC7B,IAAI,aAAa,KAAA,KAAa,CAAC,UAAU,QAAQ,QAAQ,QAAQ,GAAG,OAAO;EAC3E,OAAO,KAAK,GAAG,KAAK,QAAQ,UAAU,CAAC,CAAC,MAAM,QAAQ,IAAI,SAAS,UAAU,QAAQ,UAAU,QAAQ,KAAK,QAAQ,CAAC;CACtH;;CAGA,MAAc,KAAkB,MAA2B;EAC1D,OAAO,IAAI,YAAY,QAAS,MAAM,QAAQ,IAAI,OAAO,KAAK,IAAI,QAAQ,SAAS,IAAI;CACxF;;;;;CAMA,QAAuB;EACtB,MAAM,EAAE,OAAO;EACf,IAAI,KAAK,OAAO,SAAS,GAAG,MAAM,OAAO,KAAK,MAAM;EACpD,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,OAAO,UAAU,QAAQ,WAAW;EAC5C,MAAM,WAAW,KAAK,QAAQ,YAAY;EAC1C,MAAM,QAAQ,KAAK,KACjB,UAAU,CAAC,CACX,SAAS,CAAC,CACV,OAAO,GAAG,QAAQ,KAAK,MAAM,KAAK,KAAK,CAAC;EAC1C,MAAM,UAAU,SAAS,KAAK,KAAK,OAAO,OAAO,EAAE,CAAC,CAAC,SAAS,IAAI,KAAA;EAClE,MAAM,QAAQ,KAAK,UAAU,WAAW,KAAK,CAAC,CAAC,MAAM;EACrD,MAAM,QAAA;EACN,MAAM,QAAuB,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,UAAU;GAC9D,MAAM,WAAoC,CAAC;GAC3C,MAAM,SAAgC,CAAC;GAGvC,MAAM,SAAS,MAAM,QAAQ,SAC5B,UACG,QAAQ,MAAM,QAAQ,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK,UAAU,IAAI,IAAI,EAAE,CAAC,IACxF,MAAM,MAAM,SAAS,OAAO,MAAM,IAAI,IAAI,SAAS,KAAK,UAAU,IAAI,KAAK,EAAE,CAAC,CAClF;GACA,SAAS,SAAS;GAClB,OAAO,SAAS,OAAO,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,IAAI,GAAG,CAAC;GAC9E,IAAI,aAAa,KAAA,GAAW;IAC3B,IAAI,QAAQ,KAAK,cAAc,IAAI,CAAC,CAAC,WAAW,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;IAElE,IAAI,CAAC,MAAM,UAAU,UAAU,GAAG;KACjC,MAAM,UAAU,KAAK,UAAU,WAAW,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,KAAK,EAAE;KAC3E,IAAI,SAAS,QAAQ,KAAK,cAAc,SAAS,KAAK,CAAC,CAAC,WAAW,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;IACtF;IACA,SAAS,YAAY;IACrB,OAAO,YAAY,MAAM,QAAQ,KAAK,SAAS,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,SAAS,IAAI,CAAC;GAC9F;GACA,MAAM,QAA8B,CAAC;GACrC,KAAK,MAAM,QAAQ,CAAC,OAAO,GAAI,aAAa,KAAA,IAAY,CAAC,QAAQ,IAAI,CAAC,CAAE,GAAG;IAE1E,IAAI,CAAC,UAAU,CAAC,QAAQ,QAAQ,IAAI,GAAG;IACvC,MAAM,OAAO,KAAK,MAAM,MAAM,MAAM,KAAK;IACzC,MAAM,QAAQ,WAAW,KAAK,IAAI,MAAM,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,KAAK,IAAI,OAAO;GAC/F;GACA,OAAO;IAAE;IAAM;IAAU;IAAQ;IAAO,SAAS,CAAC;GAAE;EACrD,CAAC;EAID,IAAI,QACH,KAAK,MAAM,QAAQ,KAAK,KAAK,OAAO,OAAO,EAAE,GAAG;GAC/C,IAAI,KAAK,KAAK,UAAU,WAAW;GACnC,MAAM,OAAO,WAAW,MAAM,SAAS,CAAC,EAAE,QAAQ,KAAK,SAAS,KAAK,IAAI,QAAQ,IAAI;GACrF,MAAM,KAAK,KAAK,IAAI,QAAQ;GAC5B,IAAI;GACJ,IAAI,eAAe;GACnB,KAAK,MAAM,QAAQ,OAAO;IACzB,MAAM,IAAI,OAAO,KAAK,KAAK,IAAI,EAAE;IACjC,IAAI,IAAI,cAAc;KACrB,eAAe;KACf,OAAO;IACR;GACD;GACA,IAAI,MAAM,CAAC,KAAK,QAAQ,UAAU,CAAC,EAAA,CAAG,KAAK,KAAK,EAAE;EACnD;EAED,KAAK,QAAQ;GAAE,MAAM,GAAG;GAAM;EAAM;EACpC,OAAO;CACR;;CAGA,SAAiB,IAAsB;EACtC,MAAM,OAAO,KAAK,GAAG,KAAK,UAAU,QAAQ,EAAE;EAC9C,OAAO,QAAQ,OAAO,MAAM,EAAE,IAAI,KAAS,KAAK,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,MAAM,KAAK,QAAS,KAAK;CACtG;;;;;;CAOA,QAAQ,SAAsB,MAAoB;EACjD,MAAM,EAAE,MAAM,aAAa,KAAK;EAChC,MAAM,MAAM,KAAK,IAAI,OAAO;EAC5B,MAAM,WAAW,IAAI;EACrB,MAAM,EAAE,QAAQ,WAAW;EAC3B,IAAI,QAAQ,YAAY,UAAU,MAAM,QAAQ,OAAO,OAAO,aAAa;EAC3E,IAAI,CAAC,UAAU,WAAW,CAAC,QAAQ,OAAO,UAAU,SAAS;EAC7D,MAAM,OAAO,KAAK,UAAU,OAAO,GAAG,SAAS,KAAK,MAAM,MAAM,SAAS,EAAE,CAAC,CAAC,CAAC,QAAQ,OAAO;EAC7F,IAAI,CAAC,MAAM,OAAO,SAAS;EAE3B,MAAM,QAAQ,UAAuB,KAAK,QAAQ,UAAU,MAAM,QAAQ,CAAC,CAAC,SAAS,MAAM;EAC3F,MAAM,QAAQ,UAAU,QAAQ,QAAQ,CAAC,CAAC,aAAa;EACvD,MAAM,MAAM,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,MAAM,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC;EAC3F,MAAM,SAAS,SAAS,cAAc,OAAO,WAAW,cAAc;EACtE,MAAM,OAAO,QAAQ,IAAK,IAAI,MAAO,QAAQ;EAC7C,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,SAAS,MAAM,IAAI,OAAO,KAAK,IAAI,IAAK,MAAM,EAAE,CAAC;CACzF;;CAGA,KAAa,MAA4B;EACxC,MAAM,EAAE,OAAO;EACf,OAAO,GAAG,OAAO,QAAQ,IAAI,MAAM,KAAA,KAAa,GAAG,MAAM,MAAM,KAAK,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,KAAA;CAC1G;;;;;;;CAQA,WAA6B;EAC5B,MAAM,EAAE,SAAS,KAAK;EACtB,MAAM,OAAO,KAAK,KAAK;EACvB,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,MAAM,QAAQ,KAAK;EAEnB,MAAM,QAAQ,KAAK,IAAI,QAAQ,WAAW,KAAK,IAAI,MAAM,CAAC,CAAC,SAAS,cAAc,KAAK,MAAM,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC;EACrH,MAAM,QAAA;EACN,MAAM,OAAO;EACb,MAAM,OAAO,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAC5B,KAAK,UAAU;GAAE;GAAM,GAAG,OAAO,MAAM,IAAI;EAAE,EAAE,CAAC,CAChD,QAAQ,EAAE,MAAM,QAAQ,IAAI,QAAQ,CAAC,MAAM,MAAM,SAAS,OAAO,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC,CACtF,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE;EAEnD,MAAM,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK;EAC3C,KAAK,MAAM,EAAE,UAAU,MAAM,IAAI,KAAK,SAAS,QAAQ,MAAM,MAAM,GAAG,GAAG,IAAI,GAAG,OAAO;GAAE,GAAG,KAAK;GAAG,GAAG,KAAK;EAAE;CAE/G;;CAGA,SAAiB,MAAY,MAAqB;EACjD,MAAM,QAAQ,KAAK,GAAG,KAAK,SAAS,MAAM,QAAQ,MAAM,MAAM,SAAS,CAAC;EACxE,MAAM,MAAM,QAAQ,MAAM,SAAS;EACnC,OAAO,CAAC,CAAC,OAAO,OAAO,KAAK,IAAI,KAAK;CACtC;;;;;;CAOA,QAAc;EACb,MAAM,EAAE,OAAO;EACf,IAAI,KAAK,cAAc,GAAG,MAAM;EAChC,KAAK,YAAY,GAAG;EACpB,KAAK,UAAU;EACf,KAAK,MAAM;EACX,MAAM,UAAU,KAAK;EACrB,KAAK,MAAM;EACX,IAAI,QAAQ,eAAe,MAAM,KAAK,KAAK;EAC3C,KAAK,KAAK;EACV,KAAK,QAAQ;EACb,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,WAAW;EAChB,KAAK,YAAY;EACjB,KAAK,QAAQ;EACb,IAAI,QAAQ,gBAAgB,MAAM,KAAK,MAAM;EAC7C,KAAK,OAAO;CACb;;;;;;CAOA,UAAwB;EACvB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,aAAa;EACrB,IAAI,aAAa,KAAA,GAAW;EAC5B,MAAM,OAAO,GAAG;EAChB,MAAM,SAAS,UAAU,GAAG,QAAQ;EACpC,MAAM,OAAO,KAAK,OAAO;EACzB,MAAM,OAAO,GAAG,KAAK,GAAG;EACxB,KAAK,KAAK,aAAa,KAAK,gBAAgB,KAAK,KAAK,UAAU,MAAM,OAAO;GAC5E,MAAM,QAAS,KAAK,OAAO,aAAa,EAAE,MAAM,EAAE;GAClD,OAAO,MAAM;GACb,MAAM,UAAU;GAChB,IAAI,OAAO,MAAM,QAAQ,UAAU,MAAM,QAAQ,cAAc;GAC/D,MAAM;GACN,MAAM,QAAQ;GACd,GAAG,OAAO,QAAQ,MAAM,KAAK,WAAW,SAAS,YAAY,KAAK,MAAM,kBAAkB,SAAS,cAAc,EAAE,MAAM,UAAU,CAAC;GACpI;EACD;EACA,IAAI,CAAC,MAAM;EACX,OAAO,KAAK;EACZ,IAAI,KAAK,QAAQ,GAAG;GACnB,OAAO,KAAK,OAAO;GACnB;EACD;EACA,KAAK,SAAS;EACd,IAAI,OAAO,KAAK,OAAO,SAAS,GAAG;EACnC,KAAK;EACL,KAAK,OAAO;CACb;;;;;CAMA,aAA2B;EAC1B,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,UAAU,OAAO,WAAW;EACpC,IAAI,aAAa,KAAA,KAAa,EAAE,KAAK,OAAO,UAAU,QAAQ,MAAM,CAAC,UAAU,CAAC,QAAQ,QAAQ,QAAQ,GAAG;EAC3G,MAAM,OAAO,KAAK,MAAM,CAAC,CAAC;EAC1B,IAAI,CAAC,SAAS,KAAK,MAAM,aAAa,MAAM,KAAK,QAAQ,SAAS,EAAE,UAAU,MAAM,GAAG;EACvF,MAAM,OAAO,UAAU,KAAK,SAAS,aAAa,CAAC,GAAG,KAAK,KAAK,EAAE;EAClE,IAAI,CAAC,MAAM;EAEX,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,QAAS,MAAM,UAAU,CAAC;EAChC,KAAK,MAAM,MAAM,OAAO;GACvB,MAAM,OAAO,KAAK,KAAK,OAAO,EAAE,CAAC;GAEjC,IAAI,CAAC,QAAQ,KAAK,KAAK,UAAU,aAAa,WAAW,MAAM,SAAS,CAAC,EAAE,SAAS,YAAY,GAAG,OAAO,MAAM,OAAO,KAAK,GAAG,QAAQ,UACtI,OAAO,MAAM;EACf;EAEA,KADiB,KAAK,MAAM,aAAa,MAAM,KAAK,QAAQ,SAAS,EAAE,UAAU,KAAK,OAAO,KAAK,KAAK,CAAC,CAAC,UAC1F,GAAG;EAClB,MAAM,QAAQ,KAAK,QAAQ,UAAU,CAAC,EAAA,CACpC,KAAK,OAAO,KAAK,KAAK,EAAE,CAAE,CAAC,CAC3B,QAAQ,SAAS,QAAQ,MAAM,KAAK,QAAQ,KAAA,KAAa,CAAC,KAAK,KAAK,UAAU,CAAC,WAAW,MAAM,SAAS,CAAC,EAAE,YAAY,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CACzI,MAAM,GAAG,MAAM,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;EACnE,IAAI,CAAC,MAAM;EACX,GAAG,KAAK;GAAE,MAAM;GAAS,UAAU,CAAC,KAAK,EAAE;GAAG,OAAO;IAAE,MAAM;IAAW,QAAQ,KAAK;GAAG;EAAE,CAAC;EAC3F,MAAM,KAAK,MAAM,GAAG;EACpB,GAAG,OAAO,uBAAuB,MAAM,MAAM,SAAS,WAAW,EAAE,MAAM,UAAU,CAAC;CACrF;;CAGA,IAAI,UAAmB;EACtB,OAAO,KAAK,WAAW,KAAK,aAAa;CAC1C;;CAGA,OAAa;EACZ,KAAK,YAAY,KAAK,GAAG;CAC1B;;CAGA,QAAsB;EACrB,MAAM,EAAE,MAAM,UAAU,KAAK;EAC7B,KAAK,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,CAAC,KAAK,KAAK,IAAI,OAAO,EAAE,CAAC,GAAG,OAAO,KAAK,OAAO,KAAK;EAE3F,MAAM,OAAO,MAAM,KAAK,IAAI;EAC5B,IAAI,MAAM;GACT,MAAM,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAA,CAAS;GACzE,IAAI,KAAK,QAAQ,MAAM,KAAK,MAAM,IAAI;EACvC;CACD;;CAGA,UAA2B;EAC1B,MAAM,EAAE,WAAW;EACnB,MAAM,EAAE,SAAS,KAAK;EACtB,OAAO,SAAS,KAAK,KAAK,OAAO,OAAO,EAAE,IAAI,KAAK,KAAK,YAAY,KAAK;CAC1E;;CAGA,QAAsB;EACrB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,UAAU,KAAK,QAAQ;EAC7B,KAAK,MAAM,QAAQ,KAAK,MAAM;GAE7B,IAAI,WAAW,IAAI,MAAM,KAAA,KAAa,eAAe,KAAK,IAAI,IAAI,CAAC,MAAM,WAAW;GACpF,MAAM,OAAO,QAAQ,MACnB,YAAY,OAAO,KAAK,UAAU,WAAW,OAAO,KAAK,UAAU,gBAAgB,OAAO,QAAQ,IAAI,IAAI,GAC5G;GAEA,MAAM,OAAO,aAAa,KAAK,GAAG;GAClC,IAAI,QAAQ,QAAQ,MAAM,WAAW,GAAG,OAAO,OAAO,EAAE,CAAC,EAAE,QAAQ,IAAI,GAAG;GAC1E,MAAM,SAAS,QAAQ,OAAO,WAAW,CAAC,OAAO,KAAK,UAAU,OAAO,KAAK,UAAU,WAAW,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,IAAI;GACjI,IAAI,QAAQ,GAAG,KAAK;IAAE,MAAM;IAAS,UAAU,CAAC,OAAO,EAAE;IAAG,OAAO;KAAE,MAAM;KAAa,QAAQ,KAAK;IAAG;GAAE,CAAC;EAC5G;CACD;;;;;CAMA,OAAqB;EACpB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,OAAO,KAAK,QAChB,MAAM,CAAC,CACP,MAAM,CAAC,CACP,OAAO,QAAQ,QAAQ,CAAC,OAAO,UAAU,CAAC,CAAC,IAAI,SAAS,MAAM;EAChE,IAAI,CAAC,KAAK,QAAQ;EAClB,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,OAAO,MAAM,QAAQ,SAAS,CAAC,KAAK,KAAK,KAAK,IAAI,OAAO,CAAC,CAAC,MAAM;EACvE,IAAI,CAAC,KAAK,QAAQ;EAClB,MAAM,OAAsB,CAAC;EAC7B,KAAK,MAAM,QAAQ,KAAK,QAAQ,GAAG;GAClC,IAAI,KAAK,KAAK,UAAU,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,UAAU,SAAS;GACxE,MAAM,KAAK,KAAK,KAAK,MAAA,CAAa;GAClC,IAAI,CAAC,GAAG,QAAQ;GAEhB,MAAM,SAAS,KAAK,KAAK,SAAS,CAAC,CAAC,KAAK,MAAA,EAAiB;GAC1D,IAAI,OAAO,UAAU,KAAK,SAAS,KAAK,QAAQ,EAAE,KAAK,YAAY;GACnE,MAAM,OAAO,MAAM,QAAQ,MAAM,SAAU,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,MAAO,MAAM,EAAE;GACjH,MAAM,KAAK,KACT,QAAQ,SAAS,SAAS,IAAI,CAAC,CAC/B,QAA0B,MAAM,SAAU,CAAC,QAAQ,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,MAAO,KAAA,CAAS;GAC5H,IAAI,CAAC,IAAI;GACT,KAAK,OAAO,KAAK,KAAK,MAAM;IAAE,MAAM,MAAM,KAAK,EAAE;IAAG,IAAI,MAAM,GAAG,EAAE;IAAG,OAAO,GAAG;GAAK;GACrF,KAAK,KAAK,IAAI;EACf;EACA,IAAI,CAAC,KAAK,QAAQ;EAElB,MAAM,gCAAgB,IAAI,IAAyC;EACnE,KAAK,MAAM,QAAQ,MAAM;GACxB,MAAM,KAAK,KAAK,OAAO,KAAK,KAAK,GAAG,CAAC;GACrC,MAAM,MAAM,GAAG,GAAG,EAAE,GAAG,GAAG;GAE1B,CADc,cAAc,IAAI,GAAG,KAAK,cAAc,IAAI,KAAK;IAAE;IAAI,KAAK,CAAC;GAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAA,CACjF,IAAI,KAAK,KAAK,EAAE;EACvB;EAEA,GAAG,MAAM,KACR,KAAK,KAAK,SAAS,KAAK,EAAE,GAC1B,QACA;GAAE,IAAI;GAAM,SAAS;EAAS,CAC/B;EACA,KAAK,MAAM,EAAE,IAAI,SAAS,cAAc,OAAO,GAAG;GACjD,GAAG,KAAK;IAAE,MAAM;IAAS,UAAU;IAAK,OAAO;KAAE,MAAM;KAAQ,OAAO;IAAG;GAAE,CAAC;GAC5E,GAAG,OAAO,GAAG,IAAI,WAAW,IAAI,mBAAmB,GAAG,IAAI,OAAO,eAAe,yBAAyB,MAAM,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;EAC1I;CACD;;CAGA,OAAqB;EACpB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,OAAO,KAAK,QAChB,MAAM,CAAC,CACP,MAAM,CAAC,CACP,OAAO,QAAQ,QAAQ,CAAC,OAAO,UAAU,CAAC,CAAC,IAAI,SAAS,MAAM;EAChE,MAAM,OAAiB,CAAC;EACxB,KAAK,MAAM,MAAM,KAAK,OAAO,MAAM;GAClC,MAAM,OAAO,KAAK,OAAO,KAAK;GAC9B,IAAI,KAAK,KAAK,KAAK,MAAM,OAAO,CAAC,CAAC,QAAQ;IACzC,OAAO,KAAK;IACZ;GACD;GACA,KAAK,UAAU,GAAG;GAClB,IAAI,GAAG,OAAO,KAAK,QAAQ,YAAY,GAAG,QAAQ,UAAU;GAC5D,KAAK,KAAK,OAAO,EAAE,CAAC;GACpB,OAAO,KAAK,OAAO,KAAK;EACzB;EACA,IAAI,CAAC,KAAK,QAAQ;EAClB,GAAG,MAAM,KAAK,MAAM,IAAI;EAExB,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,4BAAY,IAAI,IAAsB;EAC5C,KAAK,MAAM,MAAM,MAAM;GACtB,MAAM,OAAO,KAAK,KAAK,EAAE;GACzB,MAAM,UAAU,MACd,SAAS,SAAS,KAAK,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAClD,QAAiC,MAAM,SAAU,CAAC,QAAQ,OAAO,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,OAAO,MAAO,KAAA,CAAS;GAC7H,IAAI,SAAS,CAAC,UAAU,IAAI,QAAQ,EAAE,KAAK,UAAU,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE,EAAA,CAAI,KAAK,EAAE;EACnG;EACA,KAAK,MAAM,CAAC,QAAQ,aAAa,WAAW,GAAG,KAAK;GAAE,MAAM;GAAS;GAAU,OAAO;IAAE,MAAM;IAAW;GAAO;EAAE,CAAC;EACnH,GAAG,OAAO,GAAG,KAAK,WAAW,IAAI,kBAAkB,GAAG,KAAK,OAAO,aAAa,kCAAkC,EAAE,MAAM,UAAU,CAAC;CACrI;;;;;CAMA,SAAuB;EACtB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,OAAO,KAAK,QAAQ,CAAC,CAAC,OAAO,SAAS,CAAC,CAAC,KAAK,OAAO,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,IAAI,UAAU,CAAC,KAAK,KAAK,IAAI,CAAC;EACjH,IAAI,CAAC,KAAK,UAAU,CAAC,MAAM;EAC3B,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,EAAE,UAAU;EAElB,MAAM,QAAQ,MAAM,KAAK,SAAS;GACjC,MAAM,UAA+C,CAAC;GACtD,KAAK,MAAM,QAAQ,KAAK,OAAO,QAAQ,QAAQ,KAAK,MAAM,SAAU,KAAK,QAAQ,KAAK,EAAE,UAAU;GAClG,OAAO;EACR,CAAC;EACD,MAAM,yBAAS,IAAI,IAAsB;EACzC,KAAK,MAAM,QAAQ,MAAM;GACxB,IAAI;GACJ,MAAM,SAAS,MAAM,OAAO;IAC3B,KAAK,MAAM,QAAQ,MAAM,KAAK;KAC7B,MAAM,UAAU,MAAM,GAAG,CAAC;KAC1B,IAAI,WAAW,KAAK,CAAC,KAAK,SAAS,KAAK,EAAE,QAAQ;KAClD,MAAM,WAAW,OAAO,KAAK,KAAK,IAAI,IAAI;KAC1C,IAAI,CAAC,QAAQ,UAAU,KAAK,WAAY,YAAY,KAAK,WAAW,WAAW,KAAK,UAAW,OAAO;MAAE;MAAI;MAAM;MAAS;KAAS;IACrI;GACD,CAAC;GACD,IAAI;GACJ,IAAI,MAAM;IACT,MAAM,KAAK,GAAG,CAAC,KAAK,SAAU;IAC9B,MAAM,OAAO,MAAM,KAAK;IAGxB,UAAU,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAS,IAAI,IAAI,UAAU,KAAK,SAAS,KAAK,OAAQ,KAAK,KAAK,EAAE;GAC3H,OAAO;IAEN,MAAM,SAAS,MAAM,SAAS,SAAS,KAAK,SAAS,UAAU,CAAC,CAAC;IACjE,UAAU,OAAO,SAAS,UAAU,QAAQ,IAAI,IAAI,KAAK,SAAS,KAAA,IAAY,KAAK,UAAU,WAAW,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI;GACpI;GACA,IAAI,SAAS,CAAC,OAAO,IAAI,QAAQ,EAAE,KAAK,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE,EAAA,CAAI,KAAK,KAAK,EAAE;EAClG;EACA,KAAK,MAAM,CAAC,QAAQ,aAAa,QAAQ,GAAG,KAAK;GAAE,MAAM;GAAS;GAAU,OAAO;IAAE,MAAM;IAAW;GAAO;EAAE,CAAC;CACjH;;;;;CAMA,YAA0B;EACzB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,UAAU;EAClB,MAAM,QAAQ,KAAK,MAAM;EACzB,IAAI,MAAM,SAAS,GAAG;EACtB,IAAI,QAAQ;EACZ,KAAK,MAAM,QAAQ,OAAO;GACzB,MAAM,UAAU,KAAK,QAAQ,UAAU,CAAC;GACxC,MAAM,QAAQ,QAAQ,UAAU,KAAK,MAAM,UAAU;GACrD,IAAI,SAAS,GAAG;GAChB,MAAM,KAAK,MACT,QAAQ,SAAS,SAAS,SAAS,KAAK,MAAM,UAAU,MAAM,KAAK,QAAQ,MAAM,EAAE,UAAU,KAAK,KAAK,KAAK,SAAS,MAAM,EAAE,MAAM,CAAC,CACpI,MAAM,GAAG,MAAM,OAAO,EAAE,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,OAAO,EAAE,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC;GACpF,IAAI,CAAC,IAAI;GACT,MAAM,WAAW,GAAG,MAAM,UAAU,MAAM,GAAG,QAAQ,MAAM,EAAE,UAAU;GACvE,MAAM,MAAM,QACV,KAAK,OAAO,KAAK,KAAK,EAAE,CAAE,CAAC,CAC3B,QAAQ,SAAS,CAAC,KAAK,KAAK,UAAU,CAAC,WAAW,MAAM,SAAS,CAAC,EAAE,YAAY,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CACjG,MAAM,GAAG,KAAK,IAAI,OAAO,SAAS,eAAe,KAAK,CAAC,CAAC,CACxD,KAAK,SAAS,KAAK,EAAE;GACvB,IAAI,CAAC,IAAI,QAAQ;GACjB,MAAM,UAAU,UAAU,GAAG,SAAS,QAAS,KAAK,KAAK,EAAE;GAC3D,GAAG,KAAK;IAAE,MAAM;IAAS,UAAU;IAAK,OAAO;KAAE,MAAM;KAAW,QAAQ,QAAQ;IAAG;GAAE,CAAC;GACxF,GAAG,OACF,SAAS,IAAI,WAAW,IAAI,aAAa,GAAG,IAAI,OAAO,UAAU,oBAAoB,MAAM,KAAK,KAAK,EAAE,EAAE,iBAAiB,MAAM,GAAG,KAAK,EAAE,EAAE,KAAK,KAAK,MAAM,UAAU,OAAO,IAAI,qBAAqB,gCACtM,EAAE,MAAM,UAAU,CACnB;GACA,SAAS,IAAI;GACb,IAAI,SAAS,cAAc;EAC5B;CACD;;;;;CAMA,cAA4B;EAC3B,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,YAAY,QAAQ,aAAa;EACzC,MAAM,OAAO,KAAK,KAAK;EACvB,IAAI,CAAC,cAAc,eAAe,UAAU,aAAa,KAAA,KAAa,CAAC,MAAM;EAC7E,MAAM,WAAW,KAAK,MAAM,CAAC,CAAC;EAC9B,MAAM,SAAS,WAAW,KAAK,MAAM,UAAU,UAAU,CAAC,IAAI;EAC9D,MAAM,MAAM,KAAK,KAAK,OAAO,WAAW,EAAE,CAAC,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK,KAAK,IAAI,CAAC;EACjG,MAAM,WAAW,IAAI,QAAQ,SAAS,KAAK,KAAK,UAAU,SAAS,CAAC,CAAC;EACrE,IAAI,YAAY,QAAQ;EACxB,MAAM,OAAO,KAAK,UAAU,WAAW,QAAQ,CAAC,CAAC,QAAQ,IAAI;EAC7D,IAAI,CAAC,MAAM;EACX,MAAM,OAAO,IAAI,QAAQ,SAAS,KAAK,KAAK,UAAU,aAAa,OAAO,MAAM,IAAI,IAAA,IAA+B;EACnH,KAAK,MAAM,GAAG,MAAM,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,CAAC;EACrD,MAAM,OAAO,KAAK,MAAM,GAAG,SAAS,QAAQ;EAC5C,IAAI,KAAK,QAAQ,GAAG,KAAK;GAAE,MAAM;GAAS,UAAU,KAAK,KAAK,SAAS,KAAK,EAAE;GAAG,OAAO;IAAE,MAAM;IAAW,QAAQ,KAAK;GAAG;EAAE,CAAC;CAC/H;;;;;;CAOA,UAAwB;EACvB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,WAAW;EACnB,KAAK,UAAU;EACf,IAAI,CAAC,UAAU,KAAK,KAAK,MAAM,WAAW,OAAO,KAAK,UAAU,OAAO,MAAM,OAAO,IAAI,UAAU,OAAO,GAAG;EAC5G,MAAM,OAAO,KAAK,QAAQ,MAAM,CAAC,CAAC;EAClC,MAAM,QAAQ,OAAO,KAAK,KAAK,OAAO,KAAK,EAAE,CAAC,CAAC,SAAS,IAAI,KAAK,KAAK,YAAY,KAAK;EACvF,KAAK,MAAM,MAAM,OAAO,IAAI,GAAG,MAAM,MAAM,MAAM,QAAQ;GAAE,MAAM;IAAE,GAAG,GAAG;IAAG,GAAG,GAAG;GAAE;GAAG,IAAI;EAAU,CAAC,GAAG;EACzG,KAAK,UAAU,KAAK,KAAK,OAAO,OAAO,EAAE,CAAC,CAAC,WAAW;CACvD;;CAGA,SAAiB;EAChB,IAAI,MAAM;EACV,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG,KAAK,MAAM,QAAQ,KAAK,OAAO,OAAO,KAAK,MAAM,SAAS;EAC3F,OAAO;CACR;;CAGA,QAAsB;EACrB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,EAAE,WAAW;EACnB,IAAI,CAAC,QAAQ;EACb,MAAM,QAAQ,KAAK,KACjB,UAAU,CAAC,CACX,SAAS,CAAC,CACV,OAAO,GAAG,SAAS,IAAI,UAAU,CAAC,EAAA,CAAG,SAAS,OAAO,EAAE,CAAC;EAC1D,IAAI,OAAO,KAAK,QAAQ,CAAC,CAAC,SAAS,KAAK,OAAO,OAAO,EAAE;EACxD,MAAM,OAAO,KAAK,OAAO,KAAK,KAAK,QAAQ,YAAY;EAEvD,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,WAAW,OAAa;GAC7B,MAAM,OAAO,MAAM,MAAM,SAAS,KAAK,KAAK,UAAU,MAAM,aAAa,SAAS,MAAM,GAAG,KAAK,SAAS,MAAM,GAAG,CAAC,CAAC;GACpH,IAAI,CAAC,MAAM,OAAO;GAClB,IAAI,UAAU;GACd,KAAK,MAAM,QAAQ,KAAK,OAAO,YAAY,KAAK,MAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,EAAE,UAAU;GACnG,OAAO;EACR;EACA,MAAM,QAAQ,MAAM,QAAQ,SAAS,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM;EAC1D,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC;EAC5C,KAAK,MAAM,MAAM,OAAO;GACvB,IAAI,QAAQ,MAAM;GAClB,IAAI,CAAC,GAAG,MAAM,WAAW,MAAM,IAAI,MAAM,GAAG;GAC5C;GACA,KAAK;EACN;CACD;;CAGA,SAAuB;EACtB,MAAM,EAAE,OAAO;EACf,MAAM,OAAO,GAAG,KAAK,QAAQ,MAAM,CAAC,CAAC;EACrC,MAAM,aAAa,KAAK,QAAQ,cAAc;EAC9C,IAAI,CAAC,QAAQ,cAAc,GAAG;GAC7B,GAAG,MAAM,MAAM,KAAK,WAAW;GAC/B;EACD;EACA,MAAM,OAAO,KAAK,QAAQ,cAAc;EACxC,GAAG,MAAM,MAAM,KAAK;GACnB,IAAI;GACJ,MAAM,KAAK;GACX,OAAO,IAAI;GACX,UAAU;GACV,MAAM;GACN,IAAI;GAGJ,QAAA;GACA,YAAY,KAAK,SAAS;GAC1B,OAAO,UAAU,SAAS,MAAM,KAAK,KAAK,CAAC,CAAC,KAAK,SAAS;EAC3D,CAAC;CACF;;CAGA,SAAwB;EACvB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,WAAW;EACnB,MAAM,UAAU,KAAK;EAErB,OAAO;GACN,QAFa,UAAU,KAAK,MAAM,IAAI,CAAC,EAAA,CAE1B,KAAK,SAAS;IAC1B,MAAM,UAAqD,CAAC;IAC5D,KAAK,MAAM,wBAAQ,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,KAAK,KAAK,GAAG,GAAG,OAAO,KAAK,KAAK,OAAO,CAAC,CAAC,GACpF,QAAQ,QAAQ;KAAC,KAAK,QAAQ,KAAK,EAAE,UAAU;KAAG,KAAK,MAAM,SAAS;KAAG,KAAK,OAAO,SAAS;IAAC;IAChG,OAAO;KAAE,IAAI,KAAK,KAAK,KAAK,EAAE;KAAG,MAAM,KAAK,KAAK,OAAO;KAAI;IAAQ;GACrE,CAAC;GACD,MAAM,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW;IAAE,MAAM,OAAO,IAAI;IAAG,MAAM,KAAK,KAAK,IAAI;IAAG,OAAO,KAAK;GAAM,EAAE;GAC/H,SAAS,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,SAAS,KAAK,OAAO,OAAO,EAAE,IAAI,GAAG,UAAU,KAAK,OAAO,KAAK,KAAK,QAAQ,YAAY,KAAK,CAAC;GACjI,GAAI,GAAG,MAAM,MAAM,IAAA,gBAAe,KAAK,EAAE,WAAW,GAAG,MAAM,MAAM,OAAA,gBAAkB,KAAK,MAAM;EACjG;CACD;;;CAIA,YAAqB;EACpB,OAAO,OAAO,KAAK,KAAK,OAAO,IAAI,CAAC,CAAC,SAAS,KAAK,KAAK,OAAO,aAAa,KAAA;CAC7E;;CAGA,SAAS,QAAwB;EAChC,OAAO,UAAU;GAAE,GAAG,OAAO;GAAS,GAAG,KAAK,OAAO;EAAE;CACxD;;CAGA,OAAsB;EACrB,OAAO,gBAAgB,KAAK,MAAM;CACnC;;CAGA,QAAQ,QAA0B;EACjC,MAAM,QAAQ;EACd,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,MAAM,GAAG,OAAO;EACjE,KAAK,SAAS;GACb,GAAG;GACH,MAAM,gBAAgB,MAAM,QAAQ,CAAC,CAAC;GACtC,GAAI,MAAM,YAAY,OAAO,MAAM,SAAS,SAAS,YAAY,EAAE,UAAU,EAAE,GAAG,MAAM,SAAS,EAAE;EACpG;EACA,OAAO;CACR;AACD;;AAGA,IAAM,sBAAmC,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,WAAW,EAAE,CAAC,EAAE;;AAG5G,SAAS,UAAU,UAAkC,IAAmC;CACvF,IAAI;CACJ,IAAI,eAAe;CACnB,KAAK,MAAM,QAAQ,UAAU;EAC5B,MAAM,IAAI,OAAO,MAAM,EAAE;EACzB,IAAI,IAAI,cAAc;GACrB,eAAe;GACf,OAAO;EACR;CACD;CACA,OAAO;AACR;;;;;;;;;AAUA,IAAa,WAAW,UAA0B,CAAC,MAClD,aAAa;CAAE,IAAI;CAAW,OAAO,OAAwB;EAC5D,GAAG,KAAK,OAAO,CAAC,CAAC,UAAU,OAAO;EAClC,OAAO;GACN,IAAI;GACJ,OAAO;GACP,aAAa,GAAG,KAAK,OAAO,CAAC,CAAC,MAAM;EACrC;CACD;AAAE,CAAC"}

package/dist/ai/geometry.js

@@ -0,0 +1,38 @@
+//#region src/ai/geometry.ts
+/**
+* A point as plain data, for a save or a task's data: `{ x, z }` and nothing else
+*
+* @beta
+*/
+var point = (at) => ({
+	x: at.x,
+	z: at.z
+});
+/**
+* A point as a report has it: `[x, z]`, rounded
+*
+* @beta
+*/
+var pair = (at) => [Math.round(at.x), Math.round(at.z)];
+/**
+* A point as a decision writes it: `(40, 60)`
+*
+* @beta
+*/
+var where = (at) => `(${Math.round(at.x)}, ${Math.round(at.z)})`;
+/**
+* Units counted as a decision writes them: `1 unit`, `3 units`
+*
+* @beta
+*/
+var plural = (n) => n === 1 ? "1 unit" : `${n} units`;
+/**
+* A thing as a decision writes it, with its article: `a farm`, `an altar`
+*
+* @beta
+*/
+var an = (thing) => `${/^[aeiou]/i.test(thing) ? "an" : "a"} ${thing}`;
+//#endregion
+export { an, pair, plural, point, where };
+
+//# sourceMappingURL=geometry.js.map

package/dist/ai/geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.js","names":[],"sources":["../../src/ai/geometry.ts"],"sourcesContent":["/**\n * The small words of the AI kit (design review B13): a point as plain data, as a pair for a report, as a decision\n * writes it, and the counts and articles of a decision's line. One copy, for every module and area\n */\nimport type { Vec2 } from '#engine/math'\n\n/**\n * A point as plain data, for a save or a task's data: `{ x, z }` and nothing else\n *\n * @beta\n */\nexport const point = (at: Vec2): Vec2 => ({ x: at.x, z: at.z })\n\n/**\n * A point as a report has it: `[x, z]`, rounded\n *\n * @beta\n */\nexport const pair = (at: Vec2): [number, number] => [Math.round(at.x), Math.round(at.z)]\n\n/**\n * A point as a decision writes it: `(40, 60)`\n *\n * @beta\n */\nexport const where = (at: Vec2) => `(${Math.round(at.x)}, ${Math.round(at.z)})`\n\n/**\n * Units counted as a decision writes them: `1 unit`, `3 units`\n *\n * @beta\n */\nexport const plural = (n: number) => (n === 1 ? '1 unit' : `${n} units`)\n\n/**\n * A thing as a decision writes it, with its article: `a farm`, `an altar`\n *\n * @beta\n */\nexport const an = (thing: string) => `${/^[aeiou]/i.test(thing) ? 'an' : 'a'} ${thing}`\n"],"mappings":";;;;;;AAWA,IAAa,SAAS,QAAoB;CAAE,GAAG,GAAG;CAAG,GAAG,GAAG;AAAE;;;;;;AAO7D,IAAa,QAAQ,OAA+B,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC;;;;;;AAOvF,IAAa,SAAS,OAAa,IAAI,KAAK,MAAM,GAAG,CAAC,EAAE,IAAI,KAAK,MAAM,GAAG,CAAC,EAAE;;;;;;AAO7E,IAAa,UAAU,MAAe,MAAM,IAAI,WAAW,GAAG,EAAE;;;;;;AAOhE,IAAa,MAAM,UAAkB,GAAG,YAAY,KAAK,KAAK,IAAI,OAAO,IAAI,GAAG"}

package/dist/ai/goals.d.ts

@@ -340,6 +340,7 @@ export declare class Goals implements AiArea {
     /** What is held and on cooldown, for a save */
     /** Whether it has anything to remember now: one that does not is left out of a save */
     remembers(): boolean;
+    /** Gives what the goals remember, the holds and the rest, as plain data for a save of the brain */
     save(): GoalsMemory;
     /** Takes back what `save` gave: whether it was read */
     restore(memory: unknown): boolean;