@v12-engine/engine 0.1.1 → 0.4.0

package/dist/ai/plans/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","names":[],"sources":["../../../src/ai/plans/build.ts"],"sourcesContent":["import { baseStats, type Cost, type UnitTypeDef } from '#engine/defs'\nimport { queueOf, upgradeOf } 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 { type Brain } from '#engine/ai/brain'\nimport { type AiModule, type AiModuleDef, defineModule } from '#engine/ai/module'\nimport { type AiCondition, type AiConditionData, evaluate } from '#engine/ai/rules'\nimport { DEFAULT_PLACEMENT, type PlacementName, placementNamed, type PlacementStrategy, type PlacementTable, type SiteRequest } from './placement'\nimport { makerOf, techPath, type TechPath, type TechStep, techTrouble } from './tech'\nimport { an, where } from '../geometry'\n\n/*\n * The build plan (AI plan, B3): what a computer player builds, and how it gets there. The old melee player had a fixed\n * ladder (hall, farm, barracks, altar, …) and no way to say \"I want gryphons\" and have the computer work out that\n * gryphons need an aviary, which needs a keep and a lumber mill. The plan takes **wants** instead: \"two of this type,\n * near there, when that holds, this important\" (`Want`), from the build order, from the production plan (a unit it\n * wants that nothing of its trains yet), from the economy (another hall, a tower), from goals and from rules. Each\n * think it works out, for every want it has not met, the **steps** to it through the tech tree (`techPath`: what to\n * build, what to turn into what, what to train), takes the wants most important first, and for each acts on the first\n * step it can: finds a spot (`placement.ts`), a builder, pays out of the **purse** (`purse.ts`, the one ledger) and\n * sends the order. What it cannot pay for, it **saves** for: the most important want it cannot afford holds the money\n * in the purse, so that nothing cheaper spends it (as a person saves for a hall and lets the footmen wait). A want\n * with a place where no spot is known (a hall by a mine nobody has looked at) sends a worker to look first: the\n * settler. What is on its way (a builder sent, a site half built, a morph queued) counts as had, so the same want is\n * not acted on twice; a building lost makes a standing want short again, and it is built anew (`rebuild`).\n *\n * The plan is the brain's (`ai.plans.build`): every module adds wants to the same one, and the report shows each want\n * with what it waits for and what it holds. The `build()` module runs it in its place among a brain's modules; the\n * melee player runs it in its own\n */\n\n/**\n * Something a computer player wants built or trained, as plain data (a map's file, a rule's action, a seat's\n * options): a type, how many, under what condition, where, how important. `WantData` is what a save keeps; `Want`\n * is the same with the function forms\n *\n * @beta\n */\nexport interface WantData {\n\t/** Its name: what the memory, the report and `drop` know it by. Made up when left out */\n\tid?: string\n\t/** The unit type wanted: a building, or a unit (whose buildings the plan puts up; the production plan trains it) */\n\ttype: string\n\t/** How many of it to have, those on their way counted: 1 when left out */\n\tcount?: number\n\t/** Only while this holds (`AiConditionData`, as a rule's): a tower after the first attack, a second hall past five minutes */\n\twhen?: AiConditionData\n\t/** Where: a point, or the name of an entity the map or rules named. Home when left out */\n\tnear?: Vec2 | string\n\t/** How far from there at the most: 22 when left out */\n\twithin?: number\n\t/** How its spot is chosen (`PlacementName`): what the type declares, the brain's table, or the role's default when left out */\n\tplacement?: PlacementName\n\t/** Wants are taken most important first, and the most important one that cannot be paid for saves up: 0 when left out */\n\tpriority?: number\n\t/** Money to have left over after paying for it: a luxury that waits for gold to spare. 0 when left out */\n\tspare?: number\n\t/**\n\t * Whether the want stands: kept once met, and short again when what it made is lost, so that it is built anew.\n\t * Wants of a brain's or a seat's options stand; one added as the game goes is dropped once met, unless it says so\n\t */\n\tkeep?: boolean\n\t/** For a standing want: whether a building lost is built again (the plan's `rebuild` when left out) */\n\trebuild?: boolean\n\t/** Seconds without a spot for it before a want that does not stand is given up: the plan's `siteTimeout` when left out */\n\tsiteTimeout?: number\n\t/** Who wants it, for the report: `order`, `production`, `economy`, a goal's or a rule's id */\n\tby?: string\n}\n\n/**\n * A want with the function forms: how many as a function of the brain, a condition as code, a place found each think,\n * a placement strategy of the game's own (`ai.plans.want`, `BuildPlanOptions.wants`)\n *\n * @beta\n */\nexport interface Want extends Omit<WantData, 'count' | 'when' | 'near' | 'placement'> {\n\t/** How many of the type the want asks for, or a function of the brain that gives it; 1 when left out */\n\tcount?: number | ((ai: Brain) => number)\n\t/** A condition the want holds only while true; when it is false the want is not pursued */\n\twhen?: AiCondition\n\t/** Where to build: a point, the name of an entity or region the map gave, or a function of the brain that finds one each think */\n\tnear?: Vec2 | string | ((ai: Brain) => Vec2 | undefined)\n\t/** How the spot is chosen: a strategy by name or a function; the build plan's table or the type's own when left out */\n\tplacement?: PlacementName | PlacementStrategy\n}\n\n/**\n * How the build plan goes about it (`BrainDef.plans.build`, the `build()` module; the data of it in `AiOptions`)\n *\n * @beta\n */\nexport interface BuildPlanOptions {\n\t/** Standing wants: what the brain always has, built anew when lost */\n\twants?: Want[]\n\t/** How each type's spot is chosen, by type id or by role: a name or a function. What a type declares (`UnitTypeDef.ai.placement`) goes over it */\n\tplacement?: PlacementTable\n\t/** Whether a building lost is built again, for standing wants that do not say: yes when left out */\n\trebuild?: boolean\n\t/** Whether a worker is sent to mend a damaged building when no enemy reaches it: yes when left out */\n\trepair?: boolean\n\t/** Seconds without a spot before a want that does not stand is given up: 60 when left out */\n\tsiteTimeout?: number\n\t/** How far from home a building goes at the most, where a want does not say: 22 when left out */\n\twithin?: number\n}\n\n/** What the plan remembers of a want between thinks */\ninterface WantMemory {\n\t/** The tick it was added at */\n\tsince: number\n\t/** Its place among the wants: among equals in priority, the first added goes first. Kept, so a loaded game ranks alike */\n\torder: number\n\t/** How many of its type the plan started for it */\n\tmade: number\n\t/** A standing want met once and not to be built anew */\n\tsatisfied?: true\n\t/** The tick since which no spot was found for it */\n\tnoSite?: number\n\t/** The worker sent to look at the ground where it goes */\n\tsettler?: number\n}\n\n/**\n * What the build plan remembers between thinks, for a save: each want's memory, and the wants added as the game went\n * that are plain data (a rule's), to have them again\n *\n * @beta\n */\nexport interface BuildPlanMemory {\n\t/** The version of the memory's format: 1 so far */\n\tv: 1\n\t/** Each want by id with its memory, and its data where the want is plain data (a rule's) */\n\twants: { id: string; memory: WantMemory; data?: WantData }[]\n\t/** The order the next want added gets: kept, so that a loaded game ranks the wants it adds as the game saved did */\n\tadded?: number\n\t/** The want saving up as of the last think (`savingFor`): what a loaded game reads until it thinks again */\n\tsaving?: string\n}\n\n/**\n * One want as the report shows it: what it is, how far along, what it waits for (`status`), the steps to it, what it\n * holds in the purse\n *\n * @beta\n */\nexport interface WantReport {\n\t/** The want's id, which the plan knows it by */\n\tid: string\n\t/** The id of the unit type the want is for */\n\ttype: string\n\t/** How many of the type it asks for */\n\tcount: number\n\t/** How many of the type the player has now */\n\thave: number\n\t/** How many a worker is on its way to build or the queue is making */\n\tonItsWay: number\n\t/** How important the want is; a higher one is served first and holds its money in the purse first */\n\tpriority: number\n\t/** Who wants it: `order`, `production`, `economy`, a goal's or a rule's id */\n\tby?: string\n\t/** Whether it is a standing want, built anew when lost */\n\tkeep?: true\n\t/** What it waits for or how far it is, in words */\n\tstatus: string\n\t/** The steps to the type that are still to take, in words */\n\tsteps: string[]\n\t/** What the want holds in the purse */\n\tholds?: Cost\n}\n\n/**\n * The build plan as the report shows it: its wants, and which one saves up\n *\n * @beta\n */\nexport interface BuildPlanReport {\n\t/** Every want of the plan */\n\twants: WantReport[]\n\t/** The id of the want that saves up money now, if one does */\n\tsaving?: string\n}\n\n/** A want as the plan keeps it: its definition, its memory, and what the last think made of it */\ninterface Live {\n\tid: string\n\tdef: Want\n\tmemory: WantMemory\n\tcount: number\n\thave: number\n\tonItsWay: number\n\tstatus: string\n\tsteps: string[]\n\tholds?: Cost\n}\n\n/** How far from a mine, towards home, a settler is sent to see where the hall by it would go */\nconst SETTLE_FROM = 10\nconst WITHIN = 22\nconst SITE_TIMEOUT = 60\n/** Under this part of its health a building is mended */\nconst MEND_UNDER = 0.9\n\n/** A step in words, for the report: `build lumbermill`, `townhall → keep`, `train peasant` */\nconst stepWords = (step: Pick<TechStep, 'type' | 'how' | 'from'>) =>\n\tstep.how === 'morph' ? `${step.from} → ${step.type}` : `${step.how} ${step.type}`\n\n/** Whether a want is plain data all through: what a save can keep */\nconst isData = (def: Want): def is Want & WantData =>\n\ttypeof def.count !== 'function' && typeof def.when !== 'function' && typeof def.near !== 'function' && typeof def.placement !== 'function'\n\n/**\n * The brain's build plan (`ai.plans.build`): its wants, the steps to each, the spots, the builders, the purse. Add a\n * want with `want`, read where each stands with `report`, and let `think` act on them once a think\n *\n * @beta\n */\nexport class BuildPlan {\n\tprivate options: BuildPlanOptions = {}\n\tprivate readonly wants = new Map<string, Live>()\n\t/** Memory of wants a save remembers that no module has asked for yet: given to them as they come */\n\tprivate pending: Record<string, WantMemory> = {}\n\tprivate added = 0\n\tprivate thoughtAt = -1\n\tprivate paths = new Map<string, TechPath>()\n\t/** What is on its way, by type, worked out once a think: asked for every want and every step */\n\tprivate onWay = new Map<string, number>()\n\t/** The builders sent this think: not sent twice */\n\tprivate sent = new Set<number>()\n\t/** The want saving up this think, if one is */\n\tprivate saving: string | undefined\n\tprivate warned = new Set<string>()\n\n\tconstructor(\n\t\t/** The brain it plans for */\n\t\treadonly ai: Brain,\n\t\toptions: BuildPlanOptions = {}\n\t) {\n\t\tthis.configure(options)\n\t}\n\n\t/** Takes options in, over what it had: the standing wants added, the table of placements merged, the flags replaced */\n\tconfigure(options: BuildPlanOptions): void {\n\t\tthis.options = {\n\t\t\t...this.options,\n\t\t\t...options,\n\t\t\tplacement: { ...this.options.placement, ...options.placement }\n\t\t}\n\t\tfor (const def of options.wants ?? []) this.want({ ...def, keep: true })\n\t}\n\n\t/** The plan's options as they stand */\n\tget settings(): Readonly<BuildPlanOptions> {\n\t\treturn this.options\n\t}\n\n\t/**\n\t * Adds a want, or replaces one of the same id (its memory kept): what the plan works towards from now. Gives back\n\t * its id. A want with no `keep` is dropped once met\n\t */\n\twant(def: Want): string {\n\t\tif (!def.type) throw new Error('A want needs a type')\n\t\tconst id = def.id ?? `${def.type}#${++this.added}`\n\t\tconst live = this.wants.get(id)\n\t\tif (live) {\n\t\t\tlive.def = { ...def, id }\n\t\t\treturn id\n\t\t}\n\t\tconst memory = this.pending[id] ?? { since: this.ai.tick, order: this.added, made: 0 }\n\t\tdelete this.pending[id]\n\t\t// past every order given: a want remembered by a save comes back with its own, and moves nothing on\n\t\tthis.added = Math.max(this.added, memory.order + 1)\n\t\tthis.wants.set(id, { id, def: { ...def, id }, memory, count: 0, have: 0, onItsWay: 0, status: 'new', steps: [] })\n\t\treturn id\n\t}\n\n\t/** Takes a want out, and what a save remembered of it: whether there was one */\n\tdrop(id: string): boolean {\n\t\tconst remembered = id in this.pending\n\t\tdelete this.pending[id]\n\t\treturn this.wants.delete(id) || remembered\n\t}\n\n\t/** A want by id */\n\tget(id: string): Want | undefined {\n\t\treturn this.wants.get(id)?.def\n\t}\n\n\t/** The wants, in the order added */\n\tlist(): Want[] {\n\t\treturn this.ordered().map((live) => live.def)\n\t}\n\n\t/** Where a want stands, in words, as of the last think: `building a barracks at (40, 60)`, `saving for a town hall` */\n\tstatus(id: string): string | undefined {\n\t\treturn this.wants.get(id)?.status\n\t}\n\n\t/** The want saving up, as of the last think: the most important one it could not pay for */\n\tget savingFor(): string | undefined {\n\t\treturn this.saving\n\t}\n\n\t/** How many of a type the player has, those under construction and those that count as it included */\n\thave(type: string): number {\n\t\treturn this.ai.view.mine.ofType(type).length\n\t}\n\n\t/** How many of a type are on their way beyond those that stand: builders sent to build one, buildings turning into one, units queued */\n\tonItsWay(type: string): number {\n\t\tconst known = this.onWay.get(type)\n\t\tif (known !== undefined) return known\n\t\tlet count = 0\n\t\tfor (const entity of this.ai.view.mine) {\n\t\t\tconst own = entity.own\n\t\t\tif (!own) continue\n\t\t\tif (own.order === 'build' && own.build === type) count++\n\t\t\telse if (upgradeOf(entity)?.to === type) count++\n\t\t\tfor (const item of queueOf(entity)) if ((item.kind === 'morph' || item.kind === 'unit') && item.id === type) count++\n\t\t}\n\t\tthis.onWay.set(type, count)\n\t\treturn count\n\t}\n\n\t/** Whether a type is had or on its way: standing (finished or not), or a builder or a morph on the way to it */\n\tprivate had(type: string): boolean {\n\t\treturn this.ai.view.me.tech.includes(type) || this.have(type) > 0 || this.onItsWay(type) > 0\n\t}\n\n\t/** The steps to being able to make a type (`techPath`), worked out once a think */\n\tpath(type: string): TechPath {\n\t\tlet found = this.paths.get(type)\n\t\tif (!found) this.paths.set(type, (found = techPath(this.ai.view, type, (step) => this.onItsWay(step) > 0)))\n\t\treturn found\n\t}\n\n\t/** The first step towards a type not had yet, the type's own last: none when nothing is to be done, or the path is blocked */\n\tnext(type: string): TechStep | undefined {\n\t\tconst path = this.path(type)\n\t\tif (techTrouble(path)) return undefined\n\t\tfor (const step of path.steps) if (!this.had(step.type)) return step\n\t\tconst maker = makerOf(this.ai.view, type)\n\t\treturn maker && { type, ...maker, for: type }\n\t}\n\n\t/**\n\t * The think, once a think: every want measured against what stands and is on its way (met ones dropped, or kept\n\t * standing), those whose condition holds taken most important first, each advanced by the first step it can take:\n\t * built, turned into, or saved for. Then the mending, where the plan is to\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.paths.clear()\n\t\tthis.onWay.clear()\n\t\tthis.sent.clear()\n\t\tthis.saving = undefined\n\t\t// the game's build order, where there is one: its next item is a want before all others, and the only one\n\t\t// advanced while the order is followed\n\t\tconst following = ai.plans.follow() !== undefined\n\t\tconst active: Live[] = []\n\t\tfor (const [id, live] of this.wants) {\n\t\t\tconst { def } = live\n\t\t\tlive.steps = []\n\t\t\tlive.holds = undefined\n\t\t\tlive.count = typeof def.count === 'function' ? def.count(ai) : (def.count ?? 1)\n\t\t\tlive.have = this.have(def.type)\n\t\t\tlive.onItsWay = this.onItsWay(def.type)\n\t\t\tif (live.have + live.onItsWay >= live.count) {\n\t\t\t\tlive.status = 'met'\n\t\t\t\tif (!def.keep) {\n\t\t\t\t\tthis.wants.delete(id)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif (!(def.rebuild ?? this.options.rebuild ?? true)) live.memory.satisfied = true\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif (live.memory.satisfied) {\n\t\t\t\tlive.status = 'met once, not built anew'\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif (def.when && !evaluate(def.when, ai)) {\n\t\t\t\tlive.status = 'waits for its condition'\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif (following && id !== 'order') {\n\t\t\t\tlive.status = 'waits for the build order'\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tactive.push(live)\n\t\t}\n\t\tactive.sort((a, b) => (b.def.priority ?? 0) - (a.def.priority ?? 0) || a.memory.order - b.memory.order)\n\t\tfor (const live of active) this.advance(live)\n\t\tif (this.options.repair ?? true) this.mend()\n\t}\n\n\t/** One want, one think: the steps to it, and the first one it can take */\n\tprivate advance(live: Live): void {\n\t\tconst { ai } = this\n\t\tconst { def } = live\n\t\tconst path = this.path(def.type)\n\t\tconst trouble = techTrouble(path)\n\t\tif (trouble) {\n\t\t\tlive.status = `blocked: ${trouble}`\n\t\t\tif (!this.warned.has(def.type)) {\n\t\t\t\tthis.warned.add(def.type)\n\t\t\t\tai.log.warn('ai', `the build plan cannot get to ${def.type}: ${trouble}`, { want: live.id })\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t\tconst own = makerOf(ai.view, def.type)\n\t\tconst steps: TechStep[] = [...path.steps, ...(own ? [{ type: def.type, ...own, for: def.type }] : [])]\n\t\tlive.steps = steps.map(stepWords)\n\t\tlet status: string | undefined\n\t\tfor (const step of steps) {\n\t\t\tconst last = step.type === def.type\n\t\t\t// a prerequisite had, or on its way, is waited for by what comes after it\n\t\t\tif (!last && this.had(step.type)) {\n\t\t\t\tif (!ai.view.me.tech.includes(step.type)) status ??= `waits for ${an(step.type)} to finish`\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tconst outcome = this.act(step, live, last)\n\t\t\tstatus ??= outcome\n\t\t\t// the step was taken, or could not be: what depends on it waits either way; what does not may still go\n\t\t}\n\t\tlive.status = status ?? 'nothing to do'\n\t}\n\n\t/** Takes a step for a want, where it can: what came of it, in words, for the status */\n\tprivate act(step: TechStep, live: Live, last: boolean): string {\n\t\tconst { ai } = this\n\t\tconst { view, registry } = ai\n\t\tconst { def } = live\n\t\tconst type = registry.unit(step.type)\n\t\tswitch (step.how) {\n\t\t\tcase 'train':\n\t\t\t\treturn last ? `to be trained` : `needs ${an(step.type)}`\n\t\t\tcase 'morph': {\n\t\t\t\tconst from = view.mine\n\t\t\t\t\t.where((entity) => entity.type === step.from && builtSoFar(entity) === undefined && !upgradeOf(entity)?.to && !queueOf(entity).length)\n\t\t\t\t\t.first()\n\t\t\t\tif (!from) return `waits for ${an(step.from)} with nothing to do, to turn into ${an(step.type)}`\n\t\t\t\tif (!view.has(type.requires)) return `waits for what ${an(step.type)} requires`\n\t\t\t\tif (!this.pay(live, type.cost)) return this.short(live, step.type)\n\t\t\t\tai.send({ type: 'upgradeBuilding', building: from.id, into: step.type })\n\t\t\t\tif (last) live.memory.made++\n\t\t\t\tai.decide(`turns its ${step.from} into ${an(step.type)}${def.by ? `, for ${def.by}` : ''}`, { kind: 'build' })\n\t\t\t\treturn `turning ${an(step.from)} into ${an(step.type)}`\n\t\t\t}\n\t\t\tcase 'build': {\n\t\t\t\tif (!view.has(type.requires)) return `waits for what ${an(step.type)} requires`\n\t\t\t\t// a place nobody has looked at: a worker goes to see it now, money or no money, so that the ground is known\n\t\t\t\t// by the time the money is there (the want still saves meanwhile)\n\t\t\t\tconst place = last ? this.placeOf(live) : undefined\n\t\t\t\tif (place && ai.def.knowledge !== false && !ai.knowledge.map.explored(this.settlePoint(place))) {\n\t\t\t\t\tthis.sendSettler(live, place)\n\t\t\t\t\tthis.canPay(live, type.cost)\n\t\t\t\t\treturn `no ground known at ${where(place)}, a worker sent to look`\n\t\t\t\t}\n\t\t\t\t// the money before the spot: looking for one asks the ground many times, and a step that cannot be paid for need not\n\t\t\t\tif (!this.canPay(live, type.cost)) return this.short(live, step.type)\n\t\t\t\tconst site = this.siteFor(type, last ? live : undefined)\n\t\t\t\tif (!site) {\n\t\t\t\t\tif (last && this.noSite(live)) return `gave up: no spot for ${an(step.type)}`\n\t\t\t\t\treturn `no spot for ${an(step.type)}${last && live.memory.settler ? ', a worker sent to look' : ''}`\n\t\t\t\t}\n\t\t\t\tlive.memory.noSite = undefined\n\t\t\t\tconst builder = this.builderFor(type, site)\n\t\t\t\tif (!builder) return `no builder for ${an(step.type)}`\n\t\t\t\tthis.ai.purse.spend(type.cost, def.priority ?? 0)\n\t\t\t\tthis.sent.add(builder.id)\n\t\t\t\tai.send({ type: 'order', entities: [builder.id], order: { type: 'build', unitType: step.type, point: site } })\n\t\t\t\tif (last) live.memory.made++\n\t\t\t\tai.decide(`builds ${an(step.type)} at ${where(site)}${def.by ? `, for ${def.by}` : ''}${last ? '' : `, on the way to ${def.type}`}`, {\n\t\t\t\t\tkind: 'build'\n\t\t\t\t})\n\t\t\t\treturn `building ${an(step.type)} at ${where(site)}`\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Pays for a step out of the purse, with the want's `spare` left over, as important as the want is (what less\n\t * important wants and modules hold is its to spend); where it cannot, the most important want that could not pay\n\t * holds the money (one at a time), and what is less important waits\n\t */\n\tprivate pay(live: Live, cost: Cost | undefined): boolean {\n\t\tif (!this.canPay(live, cost)) return false\n\t\tthis.ai.purse.spend(cost, live.def.priority ?? 0)\n\t\treturn true\n\t}\n\n\t/** Whether a want can pay for a step now (nothing spent); where it cannot, it may hold the money (`pay`) */\n\tprivate canPay(live: Live, cost: Cost | undefined): boolean {\n\t\tconst { purse } = this.ai\n\t\tconst priority = live.def.priority ?? 0\n\t\tif (purse.affords(cost, live.def.spare ?? 0, priority)) return true\n\t\t// a luxury (one with money to spare asked) never saves: it buys when there is spare, and that is all\n\t\tif (this.saving === undefined && cost && !live.def.spare) {\n\t\t\tthis.saving = live.id\n\t\t\tpurse.reserve(live.id, cost, priority)\n\t\t\tlive.holds = { ...cost }\n\t\t}\n\t\treturn false\n\t}\n\n\t/** A step not paid for, in words: the want holds the money (saving), waits for money to spare (a luxury), or waits for the money */\n\tprivate short(live: Live, type: string): string {\n\t\tif (live.holds) return `saving for ${an(type)}`\n\t\tif (live.def.spare) return `waits for ${live.def.spare} ${this.ai.purse.money} to spare for ${an(type)}`\n\t\treturn `waits for the money for ${an(type)}`\n\t}\n\n\t/** No spot found this think: for a want that does not stand, given up after `siteTimeout` seconds, and said */\n\tprivate noSite(live: Live): boolean {\n\t\tconst { ai } = this\n\t\tlive.memory.noSite ??= ai.tick\n\t\tconst to = this.placeOf(live)\n\t\tif (to) this.sendSettler(live, to)\n\t\tif (live.def.keep) return false\n\t\tconst limit = (live.def.siteTimeout ?? this.options.siteTimeout ?? SITE_TIMEOUT) * ai.session.tickRate\n\t\tif (ai.tick - live.memory.noSite < limit) return false\n\t\tthis.wants.delete(live.id)\n\t\tai.decide(`gives up on ${an(live.def.type)}: no spot for it in ${Math.round(limit / ai.session.tickRate)} s`, { kind: 'build' })\n\t\treturn true\n\t}\n\n\t/** Where a want says it goes, as a point: a point, a named entity it knows of, or what its function gives. Nothing for home */\n\tprivate placeOf(live: Live): Vec2 | undefined {\n\t\tconst { near } = live.def\n\t\tif (near === undefined) return undefined\n\t\tif (typeof near === 'function') return near(this.ai)\n\t\tif (typeof near === 'string') {\n\t\t\tconst named = this.ai.view.named(near)\n\t\t\treturn named ? { x: named.x, z: named.z } : undefined\n\t\t}\n\t\treturn near\n\t}\n\n\t/** A spot for a type: where the want says, no further than it says, by its strategy; near home for a step on the way */\n\tprivate siteFor(type: UnitTypeDef, live: Live | undefined): Vec2 | undefined {\n\t\tconst { view } = this.ai\n\t\tconst near = (live && this.placeOf(live)) ?? view.home() ?? view.mine.where((_, def) => !!def.builds?.includes(type.id)).first()\n\t\tif (!near) return undefined\n\t\treturn this.site(type, { near: { x: near.x, z: near.z }, within: live?.def.within ?? this.options.within ?? WITHIN }, live?.def.placement)\n\t}\n\n\t/**\n\t * A spot for a type near a place, by a strategy: the one given, else what the type declares (`UnitTypeDef.ai.placement`),\n\t * the plan's table by type then by role, the role's default, the rings around the place. What is built on a\n\t * deposit goes on one whatever the name\n\t */\n\tsite(\n\t\ttype: UnitTypeDef,\n\t\trequest: Omit<SiteRequest, 'ordinal'> & { ordinal?: number },\n\t\tplacement?: PlacementName | PlacementStrategy\n\t): Vec2 | undefined {\n\t\tconst strategy = this.strategyFor(type, placement)\n\t\treturn strategy(this.ai, type, { ...request, ordinal: request.ordinal ?? this.have(type.id) + this.onItsWay(type.id) })\n\t}\n\n\tprivate strategyFor(type: UnitTypeDef, placement?: PlacementName | PlacementStrategy): PlacementStrategy {\n\t\tif (typeof placement === 'function') return placement\n\t\tif (type.builtOn !== undefined) return placementNamed('byResource')\n\t\tconst table = this.options.placement ?? {}\n\t\tconst roles = this.ai.view.roles.of(type.id)\n\t\tconst chosen: PlacementName | PlacementStrategy | undefined =\n\t\t\tplacement ??\n\t\t\ttype.ai?.placement ??\n\t\t\ttable[type.id] ??\n\t\t\troles.map((role) => table[role]).find((each) => each !== undefined) ??\n\t\t\troles.map((role) => DEFAULT_PLACEMENT[role]).find((each) => each !== undefined)\n\t\tif (typeof chosen === 'function') return chosen\n\t\treturn placementNamed(chosen ?? 'nearHome')\n\t}\n\n\t/** The workers sent to look at the ground somewhere, by any want: not builders while they go */\n\tprivate settlers(): Set<number> {\n\t\tconst ids = new Set<number>()\n\t\tfor (const live of this.wants.values()) {\n\t\t\tconst settler = this.ai.view.byId(live.memory.settler)\n\t\t\tif (settler?.own?.order === 'move') ids.add(settler.id)\n\t\t}\n\t\treturn ids\n\t}\n\n\t/**\n\t * Who builds a type at a spot: of the player's units that build it, those not hidden, not building, not sent this\n\t * think, not off to look at ground and not in a squad or held by a rule; idle first, then whoever carries the least,\n\t * then the nearest\n\t */\n\tbuilderFor(type: UnitTypeDef, site: Vec2): EntityState | undefined {\n\t\tconst settlers = this.settlers()\n\t\tconst builders = this.ai.view.mine\n\t\t\t.where(\n\t\t\t\t(entity, def) =>\n\t\t\t\t\t!!def.builds?.includes(type.id) &&\n\t\t\t\t\t!!entity.own &&\n\t\t\t\t\t!entity.own.hidden &&\n\t\t\t\t\tentity.own.order !== 'build' &&\n\t\t\t\t\tentity.own.order !== 'repair' &&\n\t\t\t\t\t!this.sent.has(entity.id) &&\n\t\t\t\t\t!settlers.has(entity.id) &&\n\t\t\t\t\t// a unit a squad or a rule has is theirs to move (B1's one order of who may move a unit), not the plan's\n\t\t\t\t\t!this.ai.goals.ruled(entity.id) &&\n\t\t\t\t\t!this.ai.squads.squadOf(entity)\n\t\t\t)\n\t\t\t.items.slice()\n\t\tbuilders.sort(\n\t\t\t(a, b) =>\n\t\t\t\tNumber(!!a.own?.order) - Number(!!b.own?.order) ||\n\t\t\t\t(snapshotOf(a, gathering)?.carrying ?? 0) - (snapshotOf(b, gathering)?.carrying ?? 0) ||\n\t\t\t\tdistSq(a, site) - distSq(b, site) ||\n\t\t\t\ta.id - b.id\n\t\t)\n\t\treturn builders[0]\n\t}\n\n\t/** Where a settler stands to see a place: on its near side, towards home, so that it sees where the building would stand and not the mine alone */\n\tprivate settlePoint(to: Vec2): Vec2 {\n\t\tconst home = this.ai.view.home()\n\t\tconst away = home ? Math.sqrt(distSq(home, to)) : 0\n\t\treturn home && away > SETTLE_FROM\n\t\t\t? { x: to.x + ((home.x - to.x) / away) * SETTLE_FROM, z: to.z + ((home.z - to.z) / away) * SETTLE_FROM }\n\t\t\t: { x: to.x, z: to.z }\n\t}\n\n\t/**\n\t * A worker sent to where a want goes, to see the ground: one at a time for the want, sent again if it was taken off\n\t * it. To the near side of the place, towards home (`settlePoint`)\n\t */\n\tprivate sendSettler(live: Live, to: Vec2): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst settling = view.byId(live.memory.settler)\n\t\tif (settling?.owner === ai.playerId && settling.own?.order === 'move') return\n\t\tconst type = ai.registry.unit(live.def.type)\n\t\tconst workers = view.mine.where(\n\t\t\t(entity, def) => !!def.builds?.includes(type.id) && !!entity.own && !entity.own.hidden && !snapshotOf(entity, gathering)?.carrying\n\t\t)\n\t\tconst settler = workers.nearest(to)\n\t\tif (!settler) return\n\t\tlive.memory.settler = settler.id\n\t\tai.send({ type: 'order', entities: [settler.id], order: { type: 'move', point: this.settlePoint(to) } })\n\t\tai.decide(`sends a worker to see the ground at ${where(to)}, for ${an(live.def.type)}`, { kind: 'build' })\n\t}\n\n\t/**\n\t * Builds a type now, outside any want: a spot near a place (home when left out), a builder, the purse. What a\n\t * module does for a one-off (the melee player's building on a mine). Whether it was sent\n\t */\n\tbuild(\n\t\ttype: UnitTypeDef | string,\n\t\toptions: { near?: Vec2; within?: number; placement?: PlacementName | PlacementStrategy; spare?: number; by?: string } = {}\n\t): boolean {\n\t\tconst { ai } = this\n\t\tconst { view, purse } = ai\n\t\tconst def = typeof type === 'string' ? ai.registry.unit(type) : type\n\t\tif (!view.has(def.requires) || !purse.affords(def.cost, options.spare ?? 0)) return false\n\t\tconst near = options.near ?? view.home() ?? view.mine.where((_, each) => !!each.builds?.includes(def.id)).first()\n\t\tif (!near) return false\n\t\tconst site = this.site(def, { near: { x: near.x, z: near.z }, within: options.within ?? this.options.within ?? WITHIN }, options.placement)\n\t\tif (!site) return false\n\t\tconst builder = this.builderFor(def, site)\n\t\tif (!builder || !purse.spend(def.cost)) return false\n\t\tthis.sent.add(builder.id)\n\t\tai.send({ type: 'order', entities: [builder.id], order: { type: 'build', unitType: def.id, point: site } })\n\t\tai.decide(`builds ${an(def.id)} at ${where(site)}${options.by ? `, for ${options.by}` : ''}`, { kind: 'build' })\n\t\treturn true\n\t}\n\n\t/**\n\t * Mends: a worker sent to a damaged building of the player's that no enemy strength reaches, one a think, when\n\t * the purse has what the mending will cost (`RuleSettings.economy.repairCost` of what is missing). Not one being mended already\n\t */\n\tprivate mend(): void {\n\t\tconst { ai } = this\n\t\tconst { view, purse, registry } = ai\n\t\tconst share = registry.settings.economy.repairCost\n\t\tfor (const building of view.mine.buildings().finished()) {\n\t\t\tconst def = view.def(building)\n\t\t\tconst maxHp = building.maxHealth ?? baseStats(def, registry).health\n\t\t\tif (!(building.health < maxHp * MEND_UNDER) || !def.cost) continue\n\t\t\tif (ai.threat.at(building).enemy > 0) continue\n\t\t\tconst menders = view.mine.where((entity, each) => !!each.builds?.length && entity.own?.order === 'repair' && distSq(entity, building) < 36)\n\t\t\tif (menders.length) continue\n\t\t\tconst missing = 1 - building.health / maxHp\n\t\t\tconst price: Cost = {}\n\t\t\tfor (const kind in def.cost) price[kind] = Math.ceil(def.cost[kind] * share * missing)\n\t\t\tif (!purse.affords(price)) continue\n\t\t\tconst worker = this.builderFor(def, building)\n\t\t\tif (!worker || !worker.own || worker.own.order === 'build') continue\n\t\t\tpurse.spend(price)\n\t\t\tthis.sent.add(worker.id)\n\t\t\tai.send({ type: 'order', entities: [worker.id], order: { type: 'repair', target: building.id } })\n\t\t\tai.decide(`mends its ${def.id} at ${where(building)}: ${Math.round(missing * 100)}% gone, nobody near it`, { kind: 'build' })\n\t\t\treturn\n\t\t}\n\t}\n\n\t/** The wants in the order they were added: what the report and a save list them in, the same in a loaded game */\n\tprivate ordered(): Live[] {\n\t\treturn [...this.wants.values()].sort((a, b) => a.memory.order - b.memory.order)\n\t}\n\n\t/** Every want as the last think left it, in the order added, the one saving up named */\n\treport(): BuildPlanReport {\n\t\tconst wants = this.ordered().map((live): WantReport => ({\n\t\t\tid: live.id,\n\t\t\ttype: live.def.type,\n\t\t\tcount: live.count,\n\t\t\thave: live.have,\n\t\t\tonItsWay: live.onItsWay,\n\t\t\tpriority: live.def.priority ?? 0,\n\t\t\t...(live.def.by !== undefined && { by: live.def.by }),\n\t\t\t...(live.def.keep && { keep: true as const }),\n\t\t\tstatus: live.status,\n\t\t\tsteps: [...live.steps],\n\t\t\t...(live.holds && { holds: { ...live.holds } })\n\t\t}))\n\t\treturn { wants, ...(this.saving !== undefined && { saving: this.saving }) }\n\t}\n\n\t/**\n\t * What it remembers, for a save: each standing want's memory (its code gives the want again), and the wants added\n\t * as the game went that are plain data, whole. A want that does not stand and has code in it is not kept: the\n\t * game loaded from the save would not know when the game saved from would have dropped it\n\t */\n\tsave(): BuildPlanMemory {\n\t\tconst wants: BuildPlanMemory['wants'] = []\n\t\tfor (const live of this.ordered()) {\n\t\t\tif (live.def.keep) wants.push({ id: live.id, memory: { ...live.memory } })\n\t\t\telse if (isData(live.def)) wants.push({ id: live.id, memory: { ...live.memory }, data: structuredClone(live.def) as WantData })\n\t\t}\n\t\tfor (const id in this.pending) wants.push({ id, memory: { ...this.pending[id] } })\n\t\twants.sort((a, b) => a.memory.order - b.memory.order)\n\t\treturn { v: 1, wants, added: this.added, ...(this.saving !== undefined && { saving: this.saving }) }\n\t}\n\n\t/** Takes back what `save` gave: whether it was read. The data wants are had again; memory waits for the wants code adds */\n\trestore(memory: unknown): boolean {\n\t\tconst given = memory as BuildPlanMemory | undefined\n\t\tif (!given || typeof given !== 'object' || given.v !== 1 || !Array.isArray(given.wants)) return false\n\t\tthis.pending = {}\n\t\tif (typeof given.added === 'number') this.added = Math.max(this.added, given.added)\n\t\tthis.saving = typeof given.saving === 'string' ? given.saving : undefined\n\t\tfor (const entry of given.wants) {\n\t\t\tif (!entry || typeof entry.id !== 'string') continue\n\t\t\tconst live = this.wants.get(entry.id)\n\t\t\tif (live) live.memory = { ...entry.memory }\n\t\t\telse this.pending[entry.id] = { ...entry.memory }\n\t\t\tif (entry.data && !live) this.want({ ...entry.data, id: entry.id })\n\t\t}\n\t\treturn true\n\t}\n}\n\n/**\n * The build module: runs the brain's build plan (`ai.plans.build.think()`) in its place among a brain's modules, after\n * what adds wants (rules, goals) and before what gives idle workers something else to do. With options for the plan\n *\n * @beta\n */\nexport const build = (options: BuildPlanOptions = {}): AiModuleDef =>\n\tdefineModule({ id: 'build', make: (ai: Brain): AiModule => {\n\t\tai.plans.build.configure(options)\n\t\treturn {\n\t\t\tid: 'build',\n\t\t\tphase: 'plan',\n\t\t\tthink: () => ai.plans.build.think()\n\t\t}\n\t} })\n"],"mappings":";;;;;;;;;;;;;AAwMA,IAAM,cAAc;AACpB,IAAM,SAAS;AACf,IAAM,eAAe;;AAErB,IAAM,aAAa;;AAGnB,IAAM,aAAa,SAClB,KAAK,QAAQ,UAAU,GAAG,KAAK,KAAK,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK;;AAG5E,IAAM,UAAU,QACf,OAAO,IAAI,UAAU,cAAc,OAAO,IAAI,SAAS,cAAc,OAAO,IAAI,SAAS,cAAc,OAAO,IAAI,cAAc;;;;;;;AAQjI,IAAa,YAAb,MAAuB;CAkBZ;CAjBV,UAAoC,CAAC;CACrC,wBAAyB,IAAI,IAAkB;;CAE/C,UAA8C,CAAC;CAC/C,QAAgB;CAChB,YAAoB;CACpB,wBAAgB,IAAI,IAAsB;;CAE1C,wBAAgB,IAAI,IAAoB;;CAExC,uBAAe,IAAI,IAAY;;CAE/B;CACA,yBAAiB,IAAI,IAAY;CAEjC,YAEC,IACA,UAA4B,CAAC,GAC5B;EAFQ,KAAA,KAAA;EAGT,KAAK,UAAU,OAAO;CACvB;;CAGA,UAAU,SAAiC;EAC1C,KAAK,UAAU;GACd,GAAG,KAAK;GACR,GAAG;GACH,WAAW;IAAE,GAAG,KAAK,QAAQ;IAAW,GAAG,QAAQ;GAAU;EAC9D;EACA,KAAK,MAAM,OAAO,QAAQ,SAAS,CAAC,GAAG,KAAK,KAAK;GAAE,GAAG;GAAK,MAAM;EAAK,CAAC;CACxE;;CAGA,IAAI,WAAuC;EAC1C,OAAO,KAAK;CACb;;;;;CAMA,KAAK,KAAmB;EACvB,IAAI,CAAC,IAAI,MAAM,MAAM,IAAI,MAAM,qBAAqB;EACpD,MAAM,KAAK,IAAI,MAAM,GAAG,IAAI,KAAK,GAAG,EAAE,KAAK;EAC3C,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;EAC9B,IAAI,MAAM;GACT,KAAK,MAAM;IAAE,GAAG;IAAK;GAAG;GACxB,OAAO;EACR;EACA,MAAM,SAAS,KAAK,QAAQ,OAAO;GAAE,OAAO,KAAK,GAAG;GAAM,OAAO,KAAK;GAAO,MAAM;EAAE;EACrF,OAAO,KAAK,QAAQ;EAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,OAAO,OAAO,QAAQ,CAAC;EAClD,KAAK,MAAM,IAAI,IAAI;GAAE;GAAI,KAAK;IAAE,GAAG;IAAK;GAAG;GAAG;GAAQ,OAAO;GAAG,MAAM;GAAG,UAAU;GAAG,QAAQ;GAAO,OAAO,CAAC;EAAE,CAAC;EAChH,OAAO;CACR;;CAGA,KAAK,IAAqB;EACzB,MAAM,aAAa,MAAM,KAAK;EAC9B,OAAO,KAAK,QAAQ;EACpB,OAAO,KAAK,MAAM,OAAO,EAAE,KAAK;CACjC;;CAGA,IAAI,IAA8B;EACjC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE;CAC5B;;CAGA,OAAe;EACd,OAAO,KAAK,QAAQ,CAAC,CAAC,KAAK,SAAS,KAAK,GAAG;CAC7C;;CAGA,OAAO,IAAgC;EACtC,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE;CAC5B;;CAGA,IAAI,YAAgC;EACnC,OAAO,KAAK;CACb;;CAGA,KAAK,MAAsB;EAC1B,OAAO,KAAK,GAAG,KAAK,KAAK,OAAO,IAAI,CAAC,CAAC;CACvC;;CAGA,SAAS,MAAsB;EAC9B,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI;EACjC,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,IAAI,QAAQ;EACZ,KAAK,MAAM,UAAU,KAAK,GAAG,KAAK,MAAM;GACvC,MAAM,MAAM,OAAO;GACnB,IAAI,CAAC,KAAK;GACV,IAAI,IAAI,UAAU,WAAW,IAAI,UAAU,MAAM;QAC5C,IAAI,UAAU,MAAM,CAAC,EAAE,OAAO,MAAM;GACzC,KAAK,MAAM,QAAQ,QAAQ,MAAM,GAAG,KAAK,KAAK,SAAS,WAAW,KAAK,SAAS,WAAW,KAAK,OAAO,MAAM;EAC9G;EACA,KAAK,MAAM,IAAI,MAAM,KAAK;EAC1B,OAAO;CACR;;CAGA,IAAY,MAAuB;EAClC,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,SAAS,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI;CAC5F;;CAGA,KAAK,MAAwB;EAC5B,IAAI,QAAQ,KAAK,MAAM,IAAI,IAAI;EAC/B,IAAI,CAAC,OAAO,KAAK,MAAM,IAAI,MAAO,QAAQ,SAAS,KAAK,GAAG,MAAM,OAAO,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,CAAE;EAC1G,OAAO;CACR;;CAGA,KAAK,MAAoC;EACxC,MAAM,OAAO,KAAK,KAAK,IAAI;EAC3B,IAAI,YAAY,IAAI,GAAG,OAAO,KAAA;EAC9B,KAAK,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,OAAO;EAChE,MAAM,QAAQ,QAAQ,KAAK,GAAG,MAAM,IAAI;EACxC,OAAO,SAAS;GAAE;GAAM,GAAG;GAAO,KAAK;EAAK;CAC7C;;;;;;CAOA,QAAc;EACb,MAAM,EAAE,OAAO;EACf,IAAI,KAAK,cAAc,GAAG,MAAM;EAChC,KAAK,YAAY,GAAG;EACpB,KAAK,MAAM,MAAM;EACjB,KAAK,MAAM,MAAM;EACjB,KAAK,KAAK,MAAM;EAChB,KAAK,SAAS,KAAA;EAGd,MAAM,YAAY,GAAG,MAAM,OAAO,MAAM,KAAA;EACxC,MAAM,SAAiB,CAAC;EACxB,KAAK,MAAM,CAAC,IAAI,SAAS,KAAK,OAAO;GACpC,MAAM,EAAE,QAAQ;GAChB,KAAK,QAAQ,CAAC;GACd,KAAK,QAAQ,KAAA;GACb,KAAK,QAAQ,OAAO,IAAI,UAAU,aAAa,IAAI,MAAM,EAAE,IAAK,IAAI,SAAS;GAC7E,KAAK,OAAO,KAAK,KAAK,IAAI,IAAI;GAC9B,KAAK,WAAW,KAAK,SAAS,IAAI,IAAI;GACtC,IAAI,KAAK,OAAO,KAAK,YAAY,KAAK,OAAO;IAC5C,KAAK,SAAS;IACd,IAAI,CAAC,IAAI,MAAM;KACd,KAAK,MAAM,OAAO,EAAE;KACpB;IACD;IACA,IAAI,EAAE,IAAI,WAAW,KAAK,QAAQ,WAAW,OAAO,KAAK,OAAO,YAAY;IAC5E;GACD;GACA,IAAI,KAAK,OAAO,WAAW;IAC1B,KAAK,SAAS;IACd;GACD;GACA,IAAI,IAAI,QAAQ,CAAC,SAAS,IAAI,MAAM,EAAE,GAAG;IACxC,KAAK,SAAS;IACd;GACD;GACA,IAAI,aAAa,OAAO,SAAS;IAChC,KAAK,SAAS;IACd;GACD;GACA,OAAO,KAAK,IAAI;EACjB;EACA,OAAO,MAAM,GAAG,OAAO,EAAE,IAAI,YAAY,MAAM,EAAE,IAAI,YAAY,MAAM,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAK;EACtG,KAAK,MAAM,QAAQ,QAAQ,KAAK,QAAQ,IAAI;EAC5C,IAAI,KAAK,QAAQ,UAAU,MAAM,KAAK,KAAK;CAC5C;;CAGA,QAAgB,MAAkB;EACjC,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,QAAQ;EAChB,MAAM,OAAO,KAAK,KAAK,IAAI,IAAI;EAC/B,MAAM,UAAU,YAAY,IAAI;EAChC,IAAI,SAAS;GACZ,KAAK,SAAS,YAAY;GAC1B,IAAI,CAAC,KAAK,OAAO,IAAI,IAAI,IAAI,GAAG;IAC/B,KAAK,OAAO,IAAI,IAAI,IAAI;IACxB,GAAG,IAAI,KAAK,MAAM,gCAAgC,IAAI,KAAK,IAAI,WAAW,EAAE,MAAM,KAAK,GAAG,CAAC;GAC5F;GACA;EACD;EACA,MAAM,MAAM,QAAQ,GAAG,MAAM,IAAI,IAAI;EACrC,MAAM,QAAoB,CAAC,GAAG,KAAK,OAAO,GAAI,MAAM,CAAC;GAAE,MAAM,IAAI;GAAM,GAAG;GAAK,KAAK,IAAI;EAAK,CAAC,IAAI,CAAC,CAAE;EACrG,KAAK,QAAQ,MAAM,IAAI,SAAS;EAChC,IAAI;EACJ,KAAK,MAAM,QAAQ,OAAO;GACzB,MAAM,OAAO,KAAK,SAAS,IAAI;GAE/B,IAAI,CAAC,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG;IACjC,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,SAAS,KAAK,IAAI,GAAG,WAAW,aAAa,GAAG,KAAK,IAAI,EAAE;IAChF;GACD;GACA,MAAM,UAAU,KAAK,IAAI,MAAM,MAAM,IAAI;GACzC,WAAW;EAEZ;EACA,KAAK,SAAS,UAAU;CACzB;;CAGA,IAAY,MAAgB,MAAY,MAAuB;EAC9D,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,EAAE,QAAQ;EAChB,MAAM,OAAO,SAAS,KAAK,KAAK,IAAI;EACpC,QAAQ,KAAK,KAAb;GACC,KAAK,SACJ,OAAO,OAAO,kBAAkB,SAAS,GAAG,KAAK,IAAI;GACtD,KAAK,SAAS;IACb,MAAM,OAAO,KAAK,KAChB,OAAO,WAAW,OAAO,SAAS,KAAK,QAAQ,WAAW,MAAM,MAAM,KAAA,KAAa,CAAC,UAAU,MAAM,CAAC,EAAE,MAAM,CAAC,QAAQ,MAAM,CAAC,CAAC,MAAM,CAAC,CACrI,MAAM;IACR,IAAI,CAAC,MAAM,OAAO,aAAa,GAAG,KAAK,IAAI,EAAE,oCAAoC,GAAG,KAAK,IAAI;IAC7F,IAAI,CAAC,KAAK,IAAI,KAAK,QAAQ,GAAG,OAAO,kBAAkB,GAAG,KAAK,IAAI,EAAE;IACrE,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK,IAAI,GAAG,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI;IACjE,GAAG,KAAK;KAAE,MAAM;KAAmB,UAAU,KAAK;KAAI,MAAM,KAAK;IAAK,CAAC;IACvE,IAAI,MAAM,KAAK,OAAO;IACtB,GAAG,OAAO,aAAa,KAAK,KAAK,QAAQ,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,MAAM,EAAE,MAAM,QAAQ,CAAC;IAC7G,OAAO,WAAW,GAAG,KAAK,IAAI,EAAE,QAAQ,GAAG,KAAK,IAAI;GACrD;GACA,KAAK,SAAS;IACb,IAAI,CAAC,KAAK,IAAI,KAAK,QAAQ,GAAG,OAAO,kBAAkB,GAAG,KAAK,IAAI,EAAE;IAGrE,MAAM,QAAQ,OAAO,KAAK,QAAQ,IAAI,IAAI,KAAA;IAC1C,IAAI,SAAS,GAAG,IAAI,cAAc,SAAS,CAAC,GAAG,UAAU,IAAI,SAAS,KAAK,YAAY,KAAK,CAAC,GAAG;KAC/F,KAAK,YAAY,MAAM,KAAK;KAC5B,KAAK,OAAO,MAAM,KAAK,IAAI;KAC3B,OAAO,sBAAsB,MAAM,KAAK,EAAE;IAC3C;IAEA,IAAI,CAAC,KAAK,OAAO,MAAM,KAAK,IAAI,GAAG,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI;IACpE,MAAM,OAAO,KAAK,QAAQ,MAAM,OAAO,OAAO,KAAA,CAAS;IACvD,IAAI,CAAC,MAAM;KACV,IAAI,QAAQ,KAAK,OAAO,IAAI,GAAG,OAAO,wBAAwB,GAAG,KAAK,IAAI;KAC1E,OAAO,eAAe,GAAG,KAAK,IAAI,IAAI,QAAQ,KAAK,OAAO,UAAU,4BAA4B;IACjG;IACA,KAAK,OAAO,SAAS,KAAA;IACrB,MAAM,UAAU,KAAK,WAAW,MAAM,IAAI;IAC1C,IAAI,CAAC,SAAS,OAAO,kBAAkB,GAAG,KAAK,IAAI;IACnD,KAAK,GAAG,MAAM,MAAM,KAAK,MAAM,IAAI,YAAY,CAAC;IAChD,KAAK,KAAK,IAAI,QAAQ,EAAE;IACxB,GAAG,KAAK;KAAE,MAAM;KAAS,UAAU,CAAC,QAAQ,EAAE;KAAG,OAAO;MAAE,MAAM;MAAS,UAAU,KAAK;MAAM,OAAO;KAAK;IAAE,CAAC;IAC7G,IAAI,MAAM,KAAK,OAAO;IACtB,GAAG,OAAO,UAAU,GAAG,KAAK,IAAI,EAAE,MAAM,MAAM,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,OAAO,KAAK,mBAAmB,IAAI,UAAU,EACpI,MAAM,QACP,CAAC;IACD,OAAO,YAAY,GAAG,KAAK,IAAI,EAAE,MAAM,MAAM,IAAI;GAClD;EACD;CACD;;;;;;CAOA,IAAY,MAAY,MAAiC;EACxD,IAAI,CAAC,KAAK,OAAO,MAAM,IAAI,GAAG,OAAO;EACrC,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,IAAI,YAAY,CAAC;EAChD,OAAO;CACR;;CAGA,OAAe,MAAY,MAAiC;EAC3D,MAAM,EAAE,UAAU,KAAK;EACvB,MAAM,WAAW,KAAK,IAAI,YAAY;EACtC,IAAI,MAAM,QAAQ,MAAM,KAAK,IAAI,SAAS,GAAG,QAAQ,GAAG,OAAO;EAE/D,IAAI,KAAK,WAAW,KAAA,KAAa,QAAQ,CAAC,KAAK,IAAI,OAAO;GACzD,KAAK,SAAS,KAAK;GACnB,MAAM,QAAQ,KAAK,IAAI,MAAM,QAAQ;GACrC,KAAK,QAAQ,EAAE,GAAG,KAAK;EACxB;EACA,OAAO;CACR;;CAGA,MAAc,MAAY,MAAsB;EAC/C,IAAI,KAAK,OAAO,OAAO,cAAc,GAAG,IAAI;EAC5C,IAAI,KAAK,IAAI,OAAO,OAAO,aAAa,KAAK,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM,MAAM,gBAAgB,GAAG,IAAI;EACrG,OAAO,2BAA2B,GAAG,IAAI;CAC1C;;CAGA,OAAe,MAAqB;EACnC,MAAM,EAAE,OAAO;EACf,KAAK,OAAO,WAAW,GAAG;EAC1B,MAAM,KAAK,KAAK,QAAQ,IAAI;EAC5B,IAAI,IAAI,KAAK,YAAY,MAAM,EAAE;EACjC,IAAI,KAAK,IAAI,MAAM,OAAO;EAC1B,MAAM,SAAS,KAAK,IAAI,eAAe,KAAK,QAAQ,eAAe,gBAAgB,GAAG,QAAQ;EAC9F,IAAI,GAAG,OAAO,KAAK,OAAO,SAAS,OAAO,OAAO;EACjD,KAAK,MAAM,OAAO,KAAK,EAAE;EACzB,GAAG,OAAO,eAAe,GAAG,KAAK,IAAI,IAAI,EAAE,sBAAsB,KAAK,MAAM,QAAQ,GAAG,QAAQ,QAAQ,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAC;EAC/H,OAAO;CACR;;CAGA,QAAgB,MAA8B;EAC7C,MAAM,EAAE,SAAS,KAAK;EACtB,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;EAC/B,IAAI,OAAO,SAAS,YAAY,OAAO,KAAK,KAAK,EAAE;EACnD,IAAI,OAAO,SAAS,UAAU;GAC7B,MAAM,QAAQ,KAAK,GAAG,KAAK,MAAM,IAAI;GACrC,OAAO,QAAQ;IAAE,GAAG,MAAM;IAAG,GAAG,MAAM;GAAE,IAAI,KAAA;EAC7C;EACA,OAAO;CACR;;CAGA,QAAgB,MAAmB,MAA0C;EAC5E,MAAM,EAAE,SAAS,KAAK;EACtB,MAAM,QAAQ,QAAQ,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,OAAO,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM;EAC/H,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,OAAO,KAAK,KAAK,MAAM;GAAE,MAAM;IAAE,GAAG,KAAK;IAAG,GAAG,KAAK;GAAE;GAAG,QAAQ,MAAM,IAAI,UAAU,KAAK,QAAQ,UAAU;EAAO,GAAG,MAAM,IAAI,SAAS;CAC1I;;;;;;CAOA,KACC,MACA,SACA,WACmB;EAEnB,OADiB,KAAK,YAAY,MAAM,SACjC,CAAA,CAAS,KAAK,IAAI,MAAM;GAAE,GAAG;GAAS,SAAS,QAAQ,WAAW,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE;EAAE,CAAC;CACvH;CAEA,YAAoB,MAAmB,WAAkE;EACxG,IAAI,OAAO,cAAc,YAAY,OAAO;EAC5C,IAAI,KAAK,YAAY,KAAA,GAAW,OAAO,eAAe,YAAY;EAClE,MAAM,QAAQ,KAAK,QAAQ,aAAa,CAAC;EACzC,MAAM,QAAQ,KAAK,GAAG,KAAK,MAAM,GAAG,KAAK,EAAE;EAC3C,MAAM,SACL,aACA,KAAK,IAAI,aACT,MAAM,KAAK,OACX,MAAM,KAAK,SAAS,MAAM,KAAK,CAAC,CAAC,MAAM,SAAS,SAAS,KAAA,CAAS,KAClE,MAAM,KAAK,SAAS,kBAAkB,KAAK,CAAC,CAAC,MAAM,SAAS,SAAS,KAAA,CAAS;EAC/E,IAAI,OAAO,WAAW,YAAY,OAAO;EACzC,OAAO,eAAe,UAAU,UAAU;CAC3C;;CAGA,WAAgC;EAC/B,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GAAG;GACvC,MAAM,UAAU,KAAK,GAAG,KAAK,KAAK,KAAK,OAAO,OAAO;GACrD,IAAI,SAAS,KAAK,UAAU,QAAQ,IAAI,IAAI,QAAQ,EAAE;EACvD;EACA,OAAO;CACR;;;;;;CAOA,WAAW,MAAmB,MAAqC;EAClE,MAAM,WAAW,KAAK,SAAS;EAC/B,MAAM,WAAW,KAAK,GAAG,KAAK,KAC5B,OACC,QAAQ,QACR,CAAC,CAAC,IAAI,QAAQ,SAAS,KAAK,EAAE,KAC9B,CAAC,CAAC,OAAO,OACT,CAAC,OAAO,IAAI,UACZ,OAAO,IAAI,UAAU,WACrB,OAAO,IAAI,UAAU,YACrB,CAAC,KAAK,KAAK,IAAI,OAAO,EAAE,KACxB,CAAC,SAAS,IAAI,OAAO,EAAE,KAEvB,CAAC,KAAK,GAAG,MAAM,MAAM,OAAO,EAAE,KAC9B,CAAC,KAAK,GAAG,OAAO,QAAQ,MAAM,CAChC,CAAC,CACA,MAAM,MAAM;EACd,SAAS,MACP,GAAG,MACH,OAAO,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,KAAK,MAC7C,WAAW,GAAG,SAAS,CAAC,EAAE,YAAY,MAAM,WAAW,GAAG,SAAS,CAAC,EAAE,YAAY,MACnF,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,KAChC,EAAE,KAAK,EAAE,EACX;EACA,OAAO,SAAS;CACjB;;CAGA,YAAoB,IAAgB;EACnC,MAAM,OAAO,KAAK,GAAG,KAAK,KAAK;EAC/B,MAAM,OAAO,OAAO,KAAK,KAAK,OAAO,MAAM,EAAE,CAAC,IAAI;EAClD,OAAO,QAAQ,OAAO,cACnB;GAAE,GAAG,GAAG,KAAM,KAAK,IAAI,GAAG,KAAK,OAAQ;GAAa,GAAG,GAAG,KAAM,KAAK,IAAI,GAAG,KAAK,OAAQ;EAAY,IACrG;GAAE,GAAG,GAAG;GAAG,GAAG,GAAG;EAAE;CACvB;;;;;CAMA,YAAoB,MAAY,IAAgB;EAC/C,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,WAAW,KAAK,KAAK,KAAK,OAAO,OAAO;EAC9C,IAAI,UAAU,UAAU,GAAG,YAAY,SAAS,KAAK,UAAU,QAAQ;EACvE,MAAM,OAAO,GAAG,SAAS,KAAK,KAAK,IAAI,IAAI;EAI3C,MAAM,UAHU,KAAK,KAAK,OACxB,QAAQ,QAAQ,CAAC,CAAC,IAAI,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,OAAO,CAAC,OAAO,IAAI,UAAU,CAAC,WAAW,QAAQ,SAAS,CAAC,EAAE,QAE3G,CAAA,CAAQ,QAAQ,EAAE;EAClC,IAAI,CAAC,SAAS;EACd,KAAK,OAAO,UAAU,QAAQ;EAC9B,GAAG,KAAK;GAAE,MAAM;GAAS,UAAU,CAAC,QAAQ,EAAE;GAAG,OAAO;IAAE,MAAM;IAAQ,OAAO,KAAK,YAAY,EAAE;GAAE;EAAE,CAAC;EACvG,GAAG,OAAO,uCAAuC,MAAM,EAAE,EAAE,QAAQ,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,MAAM,QAAQ,CAAC;CAC1G;;;;;CAMA,MACC,MACA,UAAwH,CAAC,GAC/G;EACV,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,MAAM,UAAU;EACxB,MAAM,MAAM,OAAO,SAAS,WAAW,GAAG,SAAS,KAAK,IAAI,IAAI;EAChE,IAAI,CAAC,KAAK,IAAI,IAAI,QAAQ,KAAK,CAAC,MAAM,QAAQ,IAAI,MAAM,QAAQ,SAAS,CAAC,GAAG,OAAO;EACpF,MAAM,OAAO,QAAQ,QAAQ,KAAK,KAAK,KAAK,KAAK,KAAK,OAAO,GAAG,SAAS,CAAC,CAAC,KAAK,QAAQ,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM;EAChH,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,OAAO,KAAK,KAAK,KAAK;GAAE,MAAM;IAAE,GAAG,KAAK;IAAG,GAAG,KAAK;GAAE;GAAG,QAAQ,QAAQ,UAAU,KAAK,QAAQ,UAAU;EAAO,GAAG,QAAQ,SAAS;EAC1I,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,UAAU,KAAK,WAAW,KAAK,IAAI;EACzC,IAAI,CAAC,WAAW,CAAC,MAAM,MAAM,IAAI,IAAI,GAAG,OAAO;EAC/C,KAAK,KAAK,IAAI,QAAQ,EAAE;EACxB,GAAG,KAAK;GAAE,MAAM;GAAS,UAAU,CAAC,QAAQ,EAAE;GAAG,OAAO;IAAE,MAAM;IAAS,UAAU,IAAI;IAAI,OAAO;GAAK;EAAE,CAAC;EAC1G,GAAG,OAAO,UAAU,GAAG,IAAI,EAAE,EAAE,MAAM,MAAM,IAAI,IAAI,QAAQ,KAAK,SAAS,QAAQ,OAAO,MAAM,EAAE,MAAM,QAAQ,CAAC;EAC/G,OAAO;CACR;;;;;CAMA,OAAqB;EACpB,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,MAAM,OAAO,aAAa;EAClC,MAAM,QAAQ,SAAS,SAAS,QAAQ;EACxC,KAAK,MAAM,YAAY,KAAK,KAAK,UAAU,CAAC,CAAC,SAAS,GAAG;GACxD,MAAM,MAAM,KAAK,IAAI,QAAQ;GAC7B,MAAM,QAAQ,SAAS,aAAa,UAAU,KAAK,QAAQ,CAAC,CAAC;GAC7D,IAAI,EAAE,SAAS,SAAS,QAAQ,eAAe,CAAC,IAAI,MAAM;GAC1D,IAAI,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC,QAAQ,GAAG;GAEtC,IADgB,KAAK,KAAK,OAAO,QAAQ,SAAS,CAAC,CAAC,KAAK,QAAQ,UAAU,OAAO,KAAK,UAAU,YAAY,OAAO,QAAQ,QAAQ,IAAI,EACpI,CAAA,CAAQ,QAAQ;GACpB,MAAM,UAAU,IAAI,SAAS,SAAS;GACtC,MAAM,QAAc,CAAC;GACrB,KAAK,MAAM,QAAQ,IAAI,MAAM,MAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,QAAQ,QAAQ,OAAO;GACrF,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;GAC3B,MAAM,SAAS,KAAK,WAAW,KAAK,QAAQ;GAC5C,IAAI,CAAC,UAAU,CAAC,OAAO,OAAO,OAAO,IAAI,UAAU,SAAS;GAC5D,MAAM,MAAM,KAAK;GACjB,KAAK,KAAK,IAAI,OAAO,EAAE;GACvB,GAAG,KAAK;IAAE,MAAM;IAAS,UAAU,CAAC,OAAO,EAAE;IAAG,OAAO;KAAE,MAAM;KAAU,QAAQ,SAAS;IAAG;GAAE,CAAC;GAChG,GAAG,OAAO,aAAa,IAAI,GAAG,MAAM,MAAM,QAAQ,EAAE,IAAI,KAAK,MAAM,UAAU,GAAG,EAAE,yBAAyB,EAAE,MAAM,QAAQ,CAAC;GAC5H;EACD;CACD;;CAGA,UAA0B;EACzB,OAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAK;CAC/E;;CAGA,SAA0B;EAczB,OAAO;GAAE,OAbK,KAAK,QAAQ,CAAC,CAAC,KAAK,UAAsB;IACvD,IAAI,KAAK;IACT,MAAM,KAAK,IAAI;IACf,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,UAAU,KAAK;IACf,UAAU,KAAK,IAAI,YAAY;IAC/B,GAAI,KAAK,IAAI,OAAO,KAAA,KAAa,EAAE,IAAI,KAAK,IAAI,GAAG;IACnD,GAAI,KAAK,IAAI,QAAQ,EAAE,MAAM,KAAc;IAC3C,QAAQ,KAAK;IACb,OAAO,CAAC,GAAG,KAAK,KAAK;IACrB,GAAI,KAAK,SAAS,EAAE,OAAO,EAAE,GAAG,KAAK,MAAM,EAAE;GAC9C,EACS;GAAO,GAAI,KAAK,WAAW,KAAA,KAAa,EAAE,QAAQ,KAAK,OAAO;EAAG;CAC3E;;;;;;CAOA,OAAwB;EACvB,MAAM,QAAkC,CAAC;EACzC,KAAK,MAAM,QAAQ,KAAK,QAAQ,GAC/B,IAAI,KAAK,IAAI,MAAM,MAAM,KAAK;GAAE,IAAI,KAAK;GAAI,QAAQ,EAAE,GAAG,KAAK,OAAO;EAAE,CAAC;OACpE,IAAI,OAAO,KAAK,GAAG,GAAG,MAAM,KAAK;GAAE,IAAI,KAAK;GAAI,QAAQ,EAAE,GAAG,KAAK,OAAO;GAAG,MAAM,gBAAgB,KAAK,GAAG;EAAc,CAAC;EAE/H,KAAK,MAAM,MAAM,KAAK,SAAS,MAAM,KAAK;GAAE;GAAI,QAAQ,EAAE,GAAG,KAAK,QAAQ,IAAI;EAAE,CAAC;EACjF,MAAM,MAAM,GAAG,MAAM,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAK;EACpD,OAAO;GAAE,GAAG;GAAG;GAAO,OAAO,KAAK;GAAO,GAAI,KAAK,WAAW,KAAA,KAAa,EAAE,QAAQ,KAAK,OAAO;EAAG;CACpG;;CAGA,QAAQ,QAA0B;EACjC,MAAM,QAAQ;EACd,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,MAAM,KAAK,CAAC,MAAM,QAAQ,MAAM,KAAK,GAAG,OAAO;EAChG,KAAK,UAAU,CAAC;EAChB,IAAI,OAAO,MAAM,UAAU,UAAU,KAAK,QAAQ,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK;EAClF,KAAK,SAAS,OAAO,MAAM,WAAW,WAAW,MAAM,SAAS,KAAA;EAChE,KAAK,MAAM,SAAS,MAAM,OAAO;GAChC,IAAI,CAAC,SAAS,OAAO,MAAM,OAAO,UAAU;GAC5C,MAAM,OAAO,KAAK,MAAM,IAAI,MAAM,EAAE;GACpC,IAAI,MAAM,KAAK,SAAS,EAAE,GAAG,MAAM,OAAO;QACrC,KAAK,QAAQ,MAAM,MAAM,EAAE,GAAG,MAAM,OAAO;GAChD,IAAI,MAAM,QAAQ,CAAC,MAAM,KAAK,KAAK;IAAE,GAAG,MAAM;IAAM,IAAI,MAAM;GAAG,CAAC;EACnE;EACA,OAAO;CACR;AACD;;;;;;;AAQA,IAAa,SAAS,UAA4B,CAAC,MAClD,aAAa;CAAE,IAAI;CAAS,OAAO,OAAwB;EAC1D,GAAG,MAAM,MAAM,UAAU,OAAO;EAChC,OAAO;GACN,IAAI;GACJ,OAAO;GACP,aAAa,GAAG,MAAM,MAAM,MAAM;EACnC;CACD;AAAE,CAAC"}

package/dist/ai/plans/placement.d.ts

@@ -8,8 +8,11 @@ import type { Brain } from '#engine/ai/brain';
  * @beta
  */
 export interface SiteRequest {
+    /** The place the building is wanted near */
     near: Vec2;
+    /** The furthest from `near`, in cells, the spot may be */
     within: number;
+    /** Which of its kind this one is, so that two of the type do not try the same corner first */
     ordinal: number;
 }
 /**
@@ -39,7 +42,7 @@ export type PlacementTable = Record<string, PlacementName | PlacementStrategy>;
 /**
  * The rings around a place, walked out from `from` to `within` (then in from `from` to the nearest ring where `inward`),
  * each at so many angles; the first point that stands clear and that `accept` likes. Deterministic, but not the same
- * corner for every building: the angles start where `ordinal` says
+ * corner for every building: the angles start where `ordinal` says. Nothing a worker cannot walk to
  *
  * @beta
  */

package/dist/ai/plans/placement.js

@@ -0,0 +1,295 @@
+import { cos, sin } from "../../exactMath.js";
+import { distSq } from "../../math.js";
+import { footprintOf } from "../../defs.js";
+import { footprintCell } from "../../grid.js";
+import "../reach.js";
+//#region src/ai/plans/placement.ts
+/** The angle, as a cosine, within which a spot is "towards" the enemy (45°) or "away" from them (over 107°) */
+var TOWARDS = .7;
+var AWAY = -.3;
+/** Whether a point lies within a distance of the segment from `a` to `b`: the way between a hall and its mine */
+function nearSegment(point, a, b, distance) {
+	const dx = b.x - a.x;
+	const dz = b.z - a.z;
+	const length = dx * dx + dz * dz;
+	const t = length > 0 ? Math.min(Math.max(((point.x - a.x) * dx + (point.z - a.z) * dz) / length, 0), 1) : 0;
+	return distSq(point, {
+		x: a.x + dx * t,
+		z: a.z + dz * t
+	}) < distance * distance;
+}
+/** The footprint's longer side: how much room a type takes */
+var sizeOf = (type) => Math.max(type.footprint?.w ?? 2, type.footprint?.d ?? 2);
+/** Whether a type can stand at a point with a little room around it: for the units that will walk past */
+function clear(ai, type, point) {
+	const { view } = ai;
+	const gap = 1;
+	return view.canPlace(type.id, point) && view.canPlace(type.id, {
+		x: point.x + gap,
+		z: point.z
+	}) && view.canPlace(type.id, {
+		x: point.x - gap,
+		z: point.z
+	}) && view.canPlace(type.id, {
+		x: point.x,
+		z: point.z + gap
+	}) && view.canPlace(type.id, {
+		x: point.x,
+		z: point.z - gap
+	});
+}
+/** How far past its footprint's edge a worker's way may end and it still gets to work: a little over a builder's reach and radius */
+var WORK_REACH = 1.5;
+/**
+* Whether a worker walks to a point: the way from the worker of the player's nearest to it ends at the footprint. Free
+* ground can be over a cliff or inside a wood: the rings know how far, not how to get there. Asked only of a spot that
+* stands clear, so about once a spot; a player with no worker out to ask has nobody to send anyway, and is not told no
+*/
+function walkable(ai, type, point) {
+	const { view } = ai;
+	const builder = view.mine.where((entity, def) => !!def.builds?.includes(type.id) && !entity.own?.hidden && !def.flying).nearest(point);
+	if (!builder) return true;
+	const way = view.findPath({
+		x: builder.x,
+		z: builder.z
+	}, point);
+	if (!way) return true;
+	const reach = sizeOf(type) / 2 + WORK_REACH;
+	return distSq(way[way.length - 1], point) <= reach * reach;
+}
+/**
+* The rings around a place, walked out from `from` to `within` (then in from `from` to the nearest ring where `inward`),
+* each at so many angles; the first point that stands clear and that `accept` likes. Deterministic, but not the same
+* corner for every building: the angles start where `ordinal` says. Nothing a worker cannot walk to
+*
+* @beta
+*/
+function rings(ai, type, centre, options) {
+	const least = 4 + sizeOf(type);
+	const from = Math.max(least, options.from ?? least);
+	const radii = [];
+	for (let radius = from; radius <= options.within; radius += 1.5) radii.push(radius);
+	if (options.inward) for (let radius = from - 1.5; radius >= least; radius -= 1.5) radii.push(radius);
+	for (const radius of radii) {
+		const steps = Math.round(radius * 1.5);
+		for (let i = 0; i < steps; i++) {
+			const angle = (i + (options.ordinal ?? 0) * 3) / steps * Math.PI * 2;
+			const point = {
+				x: Math.round(centre.x + sin(angle) * radius),
+				z: Math.round(centre.z + cos(angle) * radius)
+			};
+			if (options.accept && !options.accept(point)) continue;
+			if (clear(ai, type, point) && walkable(ai, type, point)) return point;
+		}
+	}
+}
+/**
+* The way from a place to its mine, to keep clear: the nearest deposit of the money within a hall's reach of it, or
+* the place itself where none is known there (home is the mine itself, for a hall by one not seen yet)
+*/
+function mineOf(ai, near) {
+	const { view } = ai;
+	const known = view.resources.ofResource(ai.purse.money).nearest(near);
+	return known && distSq(known, near) < 256 ? known : near;
+}
+/**
+* Which way the enemy is from a place, as a unit vector: towards the nearest of their bases it knows of, else the
+* nearest base the seat was told of (`AiOptions.enemyBases`), else towards the strongest enemy reaching its own
+* (`threat.hot`). Nothing where it has no idea
+*
+* @beta
+*/
+function enemyDirection(ai, from) {
+	let target;
+	let best = Infinity;
+	const consider = (point) => {
+		if (!point) return;
+		const d = distSq(point, from);
+		if (d < best && d > 1) {
+			best = d;
+			target = point;
+		}
+	};
+	if (ai.def.knowledge !== false) {
+		for (const base of ai.knowledge.enemy.bases()) if (!base.gone) consider(base.at);
+	}
+	if (!target) for (const base of ai.options.enemyBases ?? []) consider(base);
+	if (!target) {
+		const hot = ai.threat.hot()[0];
+		if (hot && hot.enemy > 0) consider(hot.at);
+	}
+	if (!target) return void 0;
+	const length = Math.sqrt(best);
+	return {
+		x: (target.x - from.x) / length,
+		z: (target.z - from.z) / length
+	};
+}
+/** How far the base around a place reaches: its furthest building from there, at least a few rings out */
+function edgeOf(ai, near) {
+	let furthest = 0;
+	for (const building of ai.view.mine.buildings()) furthest = Math.max(furthest, distSq(building, near));
+	return Math.max(8, Math.sqrt(furthest));
+}
+var dot = (a, b) => a.x * b.x + a.z * b.z;
+/** The side of a place a point is on, against a direction: the cosine of the angle between them */
+function side(point, near, direction) {
+	const dx = point.x - near.x;
+	const dz = point.z - near.z;
+	const length = Math.sqrt(dx * dx + dz * dz);
+	return length > 0 ? dot({
+		x: dx / length,
+		z: dz / length
+	}, direction) : 0;
+}
+/** Rings around the place, the way to the mine kept clear: what the melee player always did */
+var nearHome = (ai, type, site) => {
+	const mine = mineOf(ai, site.near);
+	const keep = sizeOf(type) / 2 + 3;
+	return rings(ai, type, site.near, {
+		within: site.within,
+		ordinal: site.ordinal,
+		accept: (point) => !nearSegment(point, site.near, mine, keep)
+	});
+};
+/** On the nearest deposit of what it is built on (a cursed mine on a gold mine), within reach of the place */
+var byResource = (ai, type, site) => {
+	if (type.builtOn === void 0) return nearHome(ai, type, site);
+	const sources = [...ai.view.resources.ofResource(type.builtOn)].sort((a, b) => distSq(a, site.near) - distSq(b, site.near));
+	const reach = Math.max(site.within, 16);
+	const source = sources.find((each) => distSq(each, site.near) < reach * reach && ai.view.canPlace(type.id, each));
+	return source && {
+		x: source.x,
+		z: source.z
+	};
+};
+/** At the edge of the base, on the side the enemy comes from: a tower. Rings around home where the enemy is not known */
+var atEdge = (ai, type, site) => {
+	const towards = enemyDirection(ai, site.near);
+	if (!towards) return nearHome(ai, type, site);
+	const mine = mineOf(ai, site.near);
+	const keep = sizeOf(type) / 2 + 3;
+	const edge = edgeOf(ai, site.near);
+	return rings(ai, type, site.near, {
+		from: edge,
+		within: Math.max(site.within, edge + 3),
+		ordinal: site.ordinal,
+		inward: true,
+		accept: (point) => side(point, site.near, towards) >= TOWARDS && !nearSegment(point, site.near, mine, keep)
+	}) ?? nearHome(ai, type, site);
+};
+/** Away from the enemy, behind the hall: supply, where a raid reaches it last. Rings around home where the enemy is not known */
+var behind = (ai, type, site) => {
+	const towards = enemyDirection(ai, site.near);
+	if (!towards) return nearHome(ai, type, site);
+	const mine = mineOf(ai, site.near);
+	const keep = sizeOf(type) / 2 + 3;
+	return rings(ai, type, site.near, {
+		within: site.within,
+		ordinal: site.ordinal,
+		accept: (point) => side(point, site.near, towards) <= AWAY && !nearSegment(point, site.near, mine, keep)
+	}) ?? nearHome(ai, type, site);
+};
+/** Beside another of a type (its own when none is named): barracks by barracks. Rings around home where there is none yet */
+var cluster = (type) => (ai, def, site) => {
+	const with_ = ai.view.mine.ofType(type ?? def.id).finished().nearest(site.near);
+	if (!with_ || distSq(with_, site.near) > site.within * site.within * 4) return nearHome(ai, def, site);
+	const mine = mineOf(ai, site.near);
+	const keep = sizeOf(def) / 2 + 3;
+	return rings(ai, def, with_, {
+		from: sizeOf(def) + 2,
+		within: 10 + sizeOf(def),
+		ordinal: site.ordinal,
+		accept: (point) => !nearSegment(point, site.near, mine, keep)
+	}) ?? nearHome(ai, def, site);
+};
+/** How many of a layer's painted cells nearest the place are tried when the rings find nothing on it */
+var PAINTED_TRIED = 256;
+/** Whether the whole footprint of a type at a point is on a layer: its middle and its four corners, a little inset */
+function onLayerAt(ai, layer, type, point) {
+	const { w, d } = footprintOf(type);
+	const cell = footprintCell(point.x, point.z, w, d);
+	const inset = .5;
+	const x0 = cell.x + inset;
+	const x1 = cell.x + w - inset;
+	const z0 = cell.z + inset;
+	const z1 = cell.z + d - inset;
+	const { view } = ai;
+	return view.cellAt(layer, cell.x + w / 2, cell.z + d / 2) > 0 && view.cellAt(layer, x0, z0) > 0 && view.cellAt(layer, x1, z0) > 0 && view.cellAt(layer, x0, z1) > 0 && view.cellAt(layer, x1, z1) > 0;
+}
+/**
+* On a layer of cells, the whole footprint (`onLayer:<layer>`): the rings around the place, the way to the mine kept
+* clear, then the layer's painted cells nearest the place where the rings find none (a scan of the layer, only then).
+* Nothing where the layer is painted nowhere near
+*/
+var onLayer = (layer) => (ai, type, site) => {
+	const mine = mineOf(ai, site.near);
+	const keep = sizeOf(type) / 2 + 3;
+	const found = rings(ai, type, site.near, {
+		within: site.within,
+		ordinal: site.ordinal,
+		accept: (point) => onLayerAt(ai, layer, type, point) && !nearSegment(point, site.near, mine, keep)
+	});
+	if (found) return found;
+	const cells = ai.view.cells(layer);
+	if (!cells) return void 0;
+	const width = ai.session.terrain.width;
+	const painted = [];
+	for (let i = 0; i < cells.length; i++) {
+		if (cells[i] === 0) continue;
+		const point = {
+			x: i % width,
+			z: Math.floor(i / width)
+		};
+		painted.push({
+			point,
+			d: distSq(point, site.near)
+		});
+	}
+	painted.sort((a, b) => a.d - b.d || a.point.z - b.point.z || a.point.x - b.point.x);
+	for (const { point } of painted.slice(0, PAINTED_TRIED)) if (onLayerAt(ai, layer, type, point) && !nearSegment(point, site.near, mine, keep) && clear(ai, type, point) && walkable(ai, type, point)) return point;
+};
+/**
+* The kit's placement strategies, by name (`PlacementName`), for a game that wants to call or wrap one
+*
+* @beta
+*/
+var placements = {
+	nearHome,
+	byResource,
+	atEdge,
+	behind,
+	cluster,
+	onLayer
+};
+/**
+* A strategy by name: `cluster:<type>` clusters with another type, `onLayer:<layer>` keeps to a layer of cells; a name
+* the kit does not know is `nearHome`
+*
+* @internal
+*/
+function placementNamed(name) {
+	if (name.startsWith("cluster:")) return cluster(name.slice(8));
+	if (name.startsWith("onLayer:")) return onLayer(name.slice(8));
+	switch (name) {
+		case "byResource": return byResource;
+		case "atEdge": return atEdge;
+		case "behind": return behind;
+		case "cluster": return cluster();
+		default: return nearHome;
+	}
+}
+/**
+* The strategy a role goes by where nothing else says: a tower at the edge, supply behind, what is built on a deposit by it
+*
+* @internal
+*/
+var DEFAULT_PLACEMENT = {
+	tower: "atEdge",
+	supply: "behind",
+	topper: "byResource"
+};
+//#endregion
+export { DEFAULT_PLACEMENT, enemyDirection, placementNamed, placements, rings };
+
+//# sourceMappingURL=placement.js.map

package/dist/ai/plans/placement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"placement.js","names":[],"sources":["../../../src/ai/plans/placement.ts"],"sourcesContent":["import { footprintOf, type UnitTypeDef } from '#engine/defs'\nimport { cos, sin } from '#engine/exactMath'\nimport { distSq, type Vec2 } from '#engine/math'\nimport { footprintCell } from '#engine/grid'\nimport type { Brain } from '#engine/ai/brain'\nimport { HALL_REACH } from '../reach'\n\n/*\n * Where a building goes (AI plan, B3). The old melee player put everything in rings around home; a tower in the rings\n * is as likely to face the woods as the enemy. A placement strategy is a function that finds a spot for a type near a\n * place: the kit's are named (`nearHome`, `byResource`, `atEdge`, `behind`, `cluster`, `onLayer`), so that a seat's options, a\n * type's declaration (`UnitTypeDef.ai.placement`) and a want can name one as data, and a game writes its own as a\n * function. All of them ask the session whether the spot is free (`view.canPlace`), which says no on ground the\n * player has not explored: a hall by a mine nobody has looked at needs a worker sent to look first (the settler, in\n * the build plan). Every strategy walks the same rings, deterministically, so two thinks of one picture pick alike\n */\n\n/**\n * Where a type is wanted: near a place, no further than `within`, and which of its kind this is (`ordinal`, so that\n * two farms do not try the same corner first)\n *\n * @beta\n */\nexport interface SiteRequest {\n\t/** The place the building is wanted near */\n\tnear: Vec2\n\t/** The furthest from `near`, in cells, the spot may be */\n\twithin: number\n\t/** Which of its kind this one is, so that two of the type do not try the same corner first */\n\tordinal: number\n}\n\n/**\n * A way of finding a spot for a building: the kit's by name, or a function of the game's own. Nothing (`undefined`)\n * when there is no spot it likes\n *\n * @beta\n */\nexport type PlacementStrategy = (ai: Brain, type: UnitTypeDef, site: SiteRequest) => Vec2 | undefined\n\n/**\n * The kit's placement strategies, by name: `nearHome` (rings around the place, keeping the way to the mine clear),\n * `byResource` (on the nearest deposit it is built on: a mine), `atEdge` (at the edge of the base towards the enemy,\n * for a tower), `behind` (away from the enemy, for supply), `cluster` (beside another of its type, barracks by\n * barracks; `cluster:<type>` beside another type), `onLayer:<layer>` (where the whole footprint is on a layer of cells\n * the game paints: `onLayer:blight` for a race that builds on blight)\n *\n * @beta\n */\nexport type PlacementName = 'nearHome' | 'byResource' | 'atEdge' | 'behind' | 'cluster' | `cluster:${string}` | `onLayer:${string}`\n\n/**\n * Which strategy a type goes by (`AiOptions.placement`, `BuildPlanOptions.placement`): by type id or by role, a name\n * or a function\n *\n * @beta\n */\nexport type PlacementTable = Record<string, PlacementName | PlacementStrategy>\n\n/** The angle, as a cosine, within which a spot is \"towards\" the enemy (45°) or \"away\" from them (over 107°) */\nconst TOWARDS = 0.7\nconst AWAY = -0.3\n\n/** Whether a point lies within a distance of the segment from `a` to `b`: the way between a hall and its mine */\nfunction nearSegment(point: Vec2, a: Vec2, b: Vec2, distance: number): boolean {\n\tconst dx = b.x - a.x\n\tconst dz = b.z - a.z\n\tconst length = dx * dx + dz * dz\n\tconst t = length > 0 ? Math.min(Math.max(((point.x - a.x) * dx + (point.z - a.z) * dz) / length, 0), 1) : 0\n\treturn distSq(point, { x: a.x + dx * t, z: a.z + dz * t }) < distance * distance\n}\n\n/** The footprint's longer side: how much room a type takes */\nconst sizeOf = (type: UnitTypeDef) => Math.max(type.footprint?.w ?? 2, type.footprint?.d ?? 2)\n\n/** Whether a type can stand at a point with a little room around it: for the units that will walk past */\nfunction clear(ai: Brain, type: UnitTypeDef, point: Vec2): boolean {\n\tconst { view } = ai\n\tconst gap = 1\n\treturn (\n\t\tview.canPlace(type.id, point) &&\n\t\tview.canPlace(type.id, { x: point.x + gap, z: point.z }) &&\n\t\tview.canPlace(type.id, { x: point.x - gap, z: point.z }) &&\n\t\tview.canPlace(type.id, { x: point.x, z: point.z + gap }) &&\n\t\tview.canPlace(type.id, { x: point.x, z: point.z - gap })\n\t)\n}\n\n/** How far past its footprint's edge a worker's way may end and it still gets to work: a little over a builder's reach and radius */\nconst WORK_REACH = 1.5\n\n/**\n * Whether a worker walks to a point: the way from the worker of the player's nearest to it ends at the footprint. Free\n * ground can be over a cliff or inside a wood: the rings know how far, not how to get there. Asked only of a spot that\n * stands clear, so about once a spot; a player with no worker out to ask has nobody to send anyway, and is not told no\n */\nfunction walkable(ai: Brain, type: UnitTypeDef, point: Vec2): boolean {\n\tconst { view } = ai\n\tconst builder = view.mine.where((entity, def) => !!def.builds?.includes(type.id) && !entity.own?.hidden && !def.flying).nearest(point)\n\tif (!builder) return true\n\tconst way = view.findPath({ x: builder.x, z: builder.z }, point)\n\t// no way at all is the search having nothing to go on, a builder's own order finds out: over a cliff the way ends short\n\tif (!way) return true\n\tconst reach = sizeOf(type) / 2 + WORK_REACH\n\treturn distSq(way[way.length - 1], point) <= reach * reach\n}\n\n/**\n * The rings around a place, walked out from `from` to `within` (then in from `from` to the nearest ring where `inward`),\n * each at so many angles; the first point that stands clear and that `accept` likes. Deterministic, but not the same\n * corner for every building: the angles start where `ordinal` says. Nothing a worker cannot walk to\n *\n * @beta\n */\nexport function rings(\n\tai: Brain,\n\ttype: UnitTypeDef,\n\tcentre: Vec2,\n\toptions: { from?: number; within: number; ordinal?: number; inward?: boolean; accept?: (point: Vec2) => boolean }\n): Vec2 | undefined {\n\tconst size = sizeOf(type)\n\tconst least = 4 + size\n\tconst from = Math.max(least, options.from ?? least)\n\tconst radii: number[] = []\n\tfor (let radius = from; radius <= options.within; radius += 1.5) radii.push(radius)\n\tif (options.inward) for (let radius = from - 1.5; radius >= least; radius -= 1.5) radii.push(radius)\n\tfor (const radius of radii) {\n\t\tconst steps = Math.round(radius * 1.5)\n\t\tfor (let i = 0; i < steps; i++) {\n\t\t\tconst angle = ((i + (options.ordinal ?? 0) * 3) / steps) * Math.PI * 2\n\t\t\tconst point = { x: Math.round(centre.x + sin(angle) * radius), z: Math.round(centre.z + cos(angle) * radius) }\n\t\t\tif (options.accept && !options.accept(point)) continue\n\t\t\tif (clear(ai, type, point) && walkable(ai, type, point)) return point\n\t\t}\n\t}\n\treturn undefined\n}\n\n/**\n * The way from a place to its mine, to keep clear: the nearest deposit of the money within a hall's reach of it, or\n * the place itself where none is known there (home is the mine itself, for a hall by one not seen yet)\n */\nfunction mineOf(ai: Brain, near: Vec2): Vec2 {\n\tconst { view } = ai\n\tconst known = view.resources.ofResource(ai.purse.money).nearest(near)\n\treturn known && distSq(known, near) < HALL_REACH * HALL_REACH ? known : near\n}\n\n/**\n * Which way the enemy is from a place, as a unit vector: towards the nearest of their bases it knows of, else the\n * nearest base the seat was told of (`AiOptions.enemyBases`), else towards the strongest enemy reaching its own\n * (`threat.hot`). Nothing where it has no idea\n *\n * @beta\n */\nexport function enemyDirection(ai: Brain, from: Vec2): Vec2 | undefined {\n\tlet target: Vec2 | undefined\n\tlet best = Infinity\n\tconst consider = (point: Vec2 | undefined) => {\n\t\tif (!point) return\n\t\tconst d = distSq(point, from)\n\t\tif (d < best && d > 1) {\n\t\t\tbest = d\n\t\t\ttarget = point\n\t\t}\n\t}\n\tif (ai.def.knowledge !== false) for (const base of ai.knowledge.enemy.bases()) if (!base.gone) consider(base.at)\n\tif (!target) for (const base of ai.options.enemyBases ?? []) consider(base)\n\tif (!target) {\n\t\tconst hot = ai.threat.hot()[0]\n\t\tif (hot && hot.enemy > 0) consider(hot.at)\n\t}\n\tif (!target) return undefined\n\tconst length = Math.sqrt(best)\n\treturn { x: (target.x - from.x) / length, z: (target.z - from.z) / length }\n}\n\n/** How far the base around a place reaches: its furthest building from there, at least a few rings out */\nfunction edgeOf(ai: Brain, near: Vec2): number {\n\tlet furthest = 0\n\tfor (const building of ai.view.mine.buildings()) furthest = Math.max(furthest, distSq(building, near))\n\treturn Math.max(8, Math.sqrt(furthest))\n}\n\nconst dot = (a: Vec2, b: Vec2) => a.x * b.x + a.z * b.z\n\n/** The side of a place a point is on, against a direction: the cosine of the angle between them */\nfunction side(point: Vec2, near: Vec2, direction: Vec2): number {\n\tconst dx = point.x - near.x\n\tconst dz = point.z - near.z\n\tconst length = Math.sqrt(dx * dx + dz * dz)\n\treturn length > 0 ? dot({ x: dx / length, z: dz / length }, direction) : 0\n}\n\n/** Rings around the place, the way to the mine kept clear: what the melee player always did */\nconst nearHome: PlacementStrategy = (ai, type, site) => {\n\tconst mine = mineOf(ai, site.near)\n\tconst keep = sizeOf(type) / 2 + 3\n\treturn rings(ai, type, site.near, { within: site.within, ordinal: site.ordinal, accept: (point) => !nearSegment(point, site.near, mine, keep) })\n}\n\n/** On the nearest deposit of what it is built on (a cursed mine on a gold mine), within reach of the place */\nconst byResource: PlacementStrategy = (ai, type, site) => {\n\tif (type.builtOn === undefined) return nearHome(ai, type, site)\n\tconst sources = [...ai.view.resources.ofResource(type.builtOn)].sort((a, b) => distSq(a, site.near) - distSq(b, site.near))\n\tconst reach = Math.max(site.within, HALL_REACH)\n\tconst source = sources.find((each) => distSq(each, site.near) < reach * reach && ai.view.canPlace(type.id, each))\n\treturn source && { x: source.x, z: source.z }\n}\n\n/** At the edge of the base, on the side the enemy comes from: a tower. Rings around home where the enemy is not known */\nconst atEdge: PlacementStrategy = (ai, type, site) => {\n\tconst towards = enemyDirection(ai, site.near)\n\tif (!towards) return nearHome(ai, type, site)\n\tconst mine = mineOf(ai, site.near)\n\tconst keep = sizeOf(type) / 2 + 3\n\tconst edge = edgeOf(ai, site.near)\n\treturn (\n\t\trings(ai, type, site.near, {\n\t\t\tfrom: edge,\n\t\t\twithin: Math.max(site.within, edge + 3),\n\t\t\tordinal: site.ordinal,\n\t\t\tinward: true,\n\t\t\taccept: (point) => side(point, site.near, towards) >= TOWARDS && !nearSegment(point, site.near, mine, keep)\n\t\t}) ?? nearHome(ai, type, site)\n\t)\n}\n\n/** Away from the enemy, behind the hall: supply, where a raid reaches it last. Rings around home where the enemy is not known */\nconst behind: PlacementStrategy = (ai, type, site) => {\n\tconst towards = enemyDirection(ai, site.near)\n\tif (!towards) return nearHome(ai, type, site)\n\tconst mine = mineOf(ai, site.near)\n\tconst keep = sizeOf(type) / 2 + 3\n\treturn (\n\t\trings(ai, type, site.near, {\n\t\t\twithin: site.within,\n\t\t\tordinal: site.ordinal,\n\t\t\taccept: (point) => side(point, site.near, towards) <= AWAY && !nearSegment(point, site.near, mine, keep)\n\t\t}) ?? nearHome(ai, type, site)\n\t)\n}\n\n/** Beside another of a type (its own when none is named): barracks by barracks. Rings around home where there is none yet */\nconst cluster =\n\t(type?: string): PlacementStrategy =>\n\t(ai, def, site) => {\n\t\tconst with_ = ai.view.mine\n\t\t\t.ofType(type ?? def.id)\n\t\t\t.finished()\n\t\t\t.nearest(site.near)\n\t\tif (!with_ || distSq(with_, site.near) > site.within * site.within * 4) return nearHome(ai, def, site)\n\t\tconst mine = mineOf(ai, site.near)\n\t\tconst keep = sizeOf(def) / 2 + 3\n\t\treturn (\n\t\t\trings(ai, def, with_, {\n\t\t\t\tfrom: sizeOf(def) + 2,\n\t\t\t\twithin: 10 + sizeOf(def),\n\t\t\t\tordinal: site.ordinal,\n\t\t\t\taccept: (point) => !nearSegment(point, site.near, mine, keep)\n\t\t\t}) ?? nearHome(ai, def, site)\n\t\t)\n\t}\n\n/** How many of a layer's painted cells nearest the place are tried when the rings find nothing on it */\nconst PAINTED_TRIED = 256\n\n/** Whether the whole footprint of a type at a point is on a layer: its middle and its four corners, a little inset */\nfunction onLayerAt(ai: Brain, layer: string, type: UnitTypeDef, point: Vec2): boolean {\n\tconst { w, d } = footprintOf(type)\n\tconst cell = footprintCell(point.x, point.z, w, d)\n\tconst inset = 0.5\n\tconst x0 = cell.x + inset\n\tconst x1 = cell.x + w - inset\n\tconst z0 = cell.z + inset\n\tconst z1 = cell.z + d - inset\n\tconst { view } = ai\n\treturn (\n\t\tview.cellAt(layer, cell.x + w / 2, cell.z + d / 2) > 0 &&\n\t\tview.cellAt(layer, x0, z0) > 0 &&\n\t\tview.cellAt(layer, x1, z0) > 0 &&\n\t\tview.cellAt(layer, x0, z1) > 0 &&\n\t\tview.cellAt(layer, x1, z1) > 0\n\t)\n}\n\n/**\n * On a layer of cells, the whole footprint (`onLayer:<layer>`): the rings around the place, the way to the mine kept\n * clear, then the layer's painted cells nearest the place where the rings find none (a scan of the layer, only then).\n * Nothing where the layer is painted nowhere near\n */\nconst onLayer =\n\t(layer: string): PlacementStrategy =>\n\t(ai, type, site) => {\n\t\tconst mine = mineOf(ai, site.near)\n\t\tconst keep = sizeOf(type) / 2 + 3\n\t\tconst found = rings(ai, type, site.near, {\n\t\t\twithin: site.within,\n\t\t\tordinal: site.ordinal,\n\t\t\taccept: (point) => onLayerAt(ai, layer, type, point) && !nearSegment(point, site.near, mine, keep)\n\t\t})\n\t\tif (found) return found\n\t\tconst cells = ai.view.cells(layer)\n\t\tif (!cells) return undefined\n\t\tconst width = ai.session.terrain.width\n\t\tconst painted: { point: Vec2; d: number }[] = []\n\t\tfor (let i = 0; i < cells.length; i++) {\n\t\t\tif (cells[i] === 0) continue\n\t\t\tconst point = { x: i % width, z: Math.floor(i / width) }\n\t\t\tpainted.push({ point, d: distSq(point, site.near) })\n\t\t}\n\t\tpainted.sort((a, b) => a.d - b.d || a.point.z - b.point.z || a.point.x - b.point.x)\n\t\tfor (const { point } of painted.slice(0, PAINTED_TRIED)) {\n\t\t\tif (onLayerAt(ai, layer, type, point) && !nearSegment(point, site.near, mine, keep) && clear(ai, type, point) && walkable(ai, type, point)) return point\n\t\t}\n\t\treturn undefined\n\t}\n\n/**\n * The kit's placement strategies, by name (`PlacementName`), for a game that wants to call or wrap one\n *\n * @beta\n */\nexport const placements = { nearHome, byResource, atEdge, behind, cluster, onLayer } as const\n\n/**\n * A strategy by name: `cluster:<type>` clusters with another type, `onLayer:<layer>` keeps to a layer of cells; a name\n * the kit does not know is `nearHome`\n *\n * @internal\n */\nexport function placementNamed(name: PlacementName | string): PlacementStrategy {\n\tif (name.startsWith('cluster:')) return cluster(name.slice('cluster:'.length))\n\tif (name.startsWith('onLayer:')) return onLayer(name.slice('onLayer:'.length))\n\tswitch (name) {\n\t\tcase 'byResource':\n\t\t\treturn byResource\n\t\tcase 'atEdge':\n\t\t\treturn atEdge\n\t\tcase 'behind':\n\t\t\treturn behind\n\t\tcase 'cluster':\n\t\t\treturn cluster()\n\t\tdefault:\n\t\t\treturn nearHome\n\t}\n}\n\n/**\n * The strategy a role goes by where nothing else says: a tower at the edge, supply behind, what is built on a deposit by it\n *\n * @internal\n */\nexport const DEFAULT_PLACEMENT: Readonly<Record<string, PlacementName>> = { tower: 'atEdge', supply: 'behind', topper: 'byResource' }\n"],"mappings":";;;;;;;AA4DA,IAAM,UAAU;AAChB,IAAM,OAAO;;AAGb,SAAS,YAAY,OAAa,GAAS,GAAS,UAA2B;CAC9E,MAAM,KAAK,EAAE,IAAI,EAAE;CACnB,MAAM,KAAK,EAAE,IAAI,EAAE;CACnB,MAAM,SAAS,KAAK,KAAK,KAAK;CAC9B,MAAM,IAAI,SAAS,IAAI,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI,EAAE,KAAK,MAAM,MAAM,IAAI,EAAE,KAAK,MAAM,QAAQ,CAAC,GAAG,CAAC,IAAI;CAC1G,OAAO,OAAO,OAAO;EAAE,GAAG,EAAE,IAAI,KAAK;EAAG,GAAG,EAAE,IAAI,KAAK;CAAE,CAAC,IAAI,WAAW;AACzE;;AAGA,IAAM,UAAU,SAAsB,KAAK,IAAI,KAAK,WAAW,KAAK,GAAG,KAAK,WAAW,KAAK,CAAC;;AAG7F,SAAS,MAAM,IAAW,MAAmB,OAAsB;CAClE,MAAM,EAAE,SAAS;CACjB,MAAM,MAAM;CACZ,OACC,KAAK,SAAS,KAAK,IAAI,KAAK,KAC5B,KAAK,SAAS,KAAK,IAAI;EAAE,GAAG,MAAM,IAAI;EAAK,GAAG,MAAM;CAAE,CAAC,KACvD,KAAK,SAAS,KAAK,IAAI;EAAE,GAAG,MAAM,IAAI;EAAK,GAAG,MAAM;CAAE,CAAC,KACvD,KAAK,SAAS,KAAK,IAAI;EAAE,GAAG,MAAM;EAAG,GAAG,MAAM,IAAI;CAAI,CAAC,KACvD,KAAK,SAAS,KAAK,IAAI;EAAE,GAAG,MAAM;EAAG,GAAG,MAAM,IAAI;CAAI,CAAC;AAEzD;;AAGA,IAAM,aAAa;;;;;;AAOnB,SAAS,SAAS,IAAW,MAAmB,OAAsB;CACrE,MAAM,EAAE,SAAS;CACjB,MAAM,UAAU,KAAK,KAAK,OAAO,QAAQ,QAAQ,CAAC,CAAC,IAAI,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,OAAO,KAAK,UAAU,CAAC,IAAI,MAAM,CAAC,CAAC,QAAQ,KAAK;CACrI,IAAI,CAAC,SAAS,OAAO;CACrB,MAAM,MAAM,KAAK,SAAS;EAAE,GAAG,QAAQ;EAAG,GAAG,QAAQ;CAAE,GAAG,KAAK;CAE/D,IAAI,CAAC,KAAK,OAAO;CACjB,MAAM,QAAQ,OAAO,IAAI,IAAI,IAAI;CACjC,OAAO,OAAO,IAAI,IAAI,SAAS,IAAI,KAAK,KAAK,QAAQ;AACtD;;;;;;;;AASA,SAAgB,MACf,IACA,MACA,QACA,SACmB;CAEnB,MAAM,QAAQ,IADD,OAAO,IACF;CAClB,MAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,QAAQ,KAAK;CAClD,MAAM,QAAkB,CAAC;CACzB,KAAK,IAAI,SAAS,MAAM,UAAU,QAAQ,QAAQ,UAAU,KAAK,MAAM,KAAK,MAAM;CAClF,IAAI,QAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,KAAK,UAAU,OAAO,UAAU,KAAK,MAAM,KAAK,MAAM;CACnG,KAAK,MAAM,UAAU,OAAO;EAC3B,MAAM,QAAQ,KAAK,MAAM,SAAS,GAAG;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC/B,MAAM,SAAU,KAAK,QAAQ,WAAW,KAAK,KAAK,QAAS,KAAK,KAAK;GACrE,MAAM,QAAQ;IAAE,GAAG,KAAK,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI,MAAM;IAAG,GAAG,KAAK,MAAM,OAAO,IAAI,IAAI,KAAK,IAAI,MAAM;GAAE;GAC7G,IAAI,QAAQ,UAAU,CAAC,QAAQ,OAAO,KAAK,GAAG;GAC9C,IAAI,MAAM,IAAI,MAAM,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,GAAG,OAAO;EACjE;CACD;AAED;;;;;AAMA,SAAS,OAAO,IAAW,MAAkB;CAC5C,MAAM,EAAE,SAAS;CACjB,MAAM,QAAQ,KAAK,UAAU,WAAW,GAAG,MAAM,KAAK,CAAC,CAAC,QAAQ,IAAI;CACpE,OAAO,SAAS,OAAO,OAAO,IAAI,IAAA,MAA8B,QAAQ;AACzE;;;;;;;;AASA,SAAgB,eAAe,IAAW,MAA8B;CACvE,IAAI;CACJ,IAAI,OAAO;CACX,MAAM,YAAY,UAA4B;EAC7C,IAAI,CAAC,OAAO;EACZ,MAAM,IAAI,OAAO,OAAO,IAAI;EAC5B,IAAI,IAAI,QAAQ,IAAI,GAAG;GACtB,OAAO;GACP,SAAS;EACV;CACD;CACA,IAAI,GAAG,IAAI,cAAc,OAAY;OAAA,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,MAAM,SAAS,KAAK,EAAE;CAAA;CAC/G,IAAI,CAAC,QAAQ,KAAK,MAAM,QAAQ,GAAG,QAAQ,cAAc,CAAC,GAAG,SAAS,IAAI;CAC1E,IAAI,CAAC,QAAQ;EACZ,MAAM,MAAM,GAAG,OAAO,IAAI,CAAC,CAAC;EAC5B,IAAI,OAAO,IAAI,QAAQ,GAAG,SAAS,IAAI,EAAE;CAC1C;CACA,IAAI,CAAC,QAAQ,OAAO,KAAA;CACpB,MAAM,SAAS,KAAK,KAAK,IAAI;CAC7B,OAAO;EAAE,IAAI,OAAO,IAAI,KAAK,KAAK;EAAQ,IAAI,OAAO,IAAI,KAAK,KAAK;CAAO;AAC3E;;AAGA,SAAS,OAAO,IAAW,MAAoB;CAC9C,IAAI,WAAW;CACf,KAAK,MAAM,YAAY,GAAG,KAAK,KAAK,UAAU,GAAG,WAAW,KAAK,IAAI,UAAU,OAAO,UAAU,IAAI,CAAC;CACrG,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,CAAC;AACvC;AAEA,IAAM,OAAO,GAAS,MAAY,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;;AAGtD,SAAS,KAAK,OAAa,MAAY,WAAyB;CAC/D,MAAM,KAAK,MAAM,IAAI,KAAK;CAC1B,MAAM,KAAK,MAAM,IAAI,KAAK;CAC1B,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;CAC1C,OAAO,SAAS,IAAI,IAAI;EAAE,GAAG,KAAK;EAAQ,GAAG,KAAK;CAAO,GAAG,SAAS,IAAI;AAC1E;;AAGA,IAAM,YAA+B,IAAI,MAAM,SAAS;CACvD,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,MAAM,OAAO,OAAO,IAAI,IAAI,IAAI;CAChC,OAAO,MAAM,IAAI,MAAM,KAAK,MAAM;EAAE,QAAQ,KAAK;EAAQ,SAAS,KAAK;EAAS,SAAS,UAAU,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI;CAAE,CAAC;AAChJ;;AAGA,IAAM,cAAiC,IAAI,MAAM,SAAS;CACzD,IAAI,KAAK,YAAY,KAAA,GAAW,OAAO,SAAS,IAAI,MAAM,IAAI;CAC9D,MAAM,UAAU,CAAC,GAAG,GAAG,KAAK,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,OAAO,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,IAAI,CAAC;CAC1H,MAAM,QAAQ,KAAK,IAAI,KAAK,QAAA,EAAkB;CAC9C,MAAM,SAAS,QAAQ,MAAM,SAAS,OAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,SAAS,KAAK,IAAI,IAAI,CAAC;CAChH,OAAO,UAAU;EAAE,GAAG,OAAO;EAAG,GAAG,OAAO;CAAE;AAC7C;;AAGA,IAAM,UAA6B,IAAI,MAAM,SAAS;CACrD,MAAM,UAAU,eAAe,IAAI,KAAK,IAAI;CAC5C,IAAI,CAAC,SAAS,OAAO,SAAS,IAAI,MAAM,IAAI;CAC5C,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,MAAM,OAAO,OAAO,IAAI,IAAI,IAAI;CAChC,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,OACC,MAAM,IAAI,MAAM,KAAK,MAAM;EAC1B,MAAM;EACN,QAAQ,KAAK,IAAI,KAAK,QAAQ,OAAO,CAAC;EACtC,SAAS,KAAK;EACd,QAAQ;EACR,SAAS,UAAU,KAAK,OAAO,KAAK,MAAM,OAAO,KAAK,WAAW,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI;CAC3G,CAAC,KAAK,SAAS,IAAI,MAAM,IAAI;AAE/B;;AAGA,IAAM,UAA6B,IAAI,MAAM,SAAS;CACrD,MAAM,UAAU,eAAe,IAAI,KAAK,IAAI;CAC5C,IAAI,CAAC,SAAS,OAAO,SAAS,IAAI,MAAM,IAAI;CAC5C,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,MAAM,OAAO,OAAO,IAAI,IAAI,IAAI;CAChC,OACC,MAAM,IAAI,MAAM,KAAK,MAAM;EAC1B,QAAQ,KAAK;EACb,SAAS,KAAK;EACd,SAAS,UAAU,KAAK,OAAO,KAAK,MAAM,OAAO,KAAK,QAAQ,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI;CACxG,CAAC,KAAK,SAAS,IAAI,MAAM,IAAI;AAE/B;;AAGA,IAAM,WACJ,UACA,IAAI,KAAK,SAAS;CAClB,MAAM,QAAQ,GAAG,KAAK,KACpB,OAAO,QAAQ,IAAI,EAAE,CAAC,CACtB,SAAS,CAAC,CACV,QAAQ,KAAK,IAAI;CACnB,IAAI,CAAC,SAAS,OAAO,OAAO,KAAK,IAAI,IAAI,KAAK,SAAS,KAAK,SAAS,GAAG,OAAO,SAAS,IAAI,KAAK,IAAI;CACrG,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,MAAM,OAAO,OAAO,GAAG,IAAI,IAAI;CAC/B,OACC,MAAM,IAAI,KAAK,OAAO;EACrB,MAAM,OAAO,GAAG,IAAI;EACpB,QAAQ,KAAK,OAAO,GAAG;EACvB,SAAS,KAAK;EACd,SAAS,UAAU,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI;CAC7D,CAAC,KAAK,SAAS,IAAI,KAAK,IAAI;AAE9B;;AAGD,IAAM,gBAAgB;;AAGtB,SAAS,UAAU,IAAW,OAAe,MAAmB,OAAsB;CACrF,MAAM,EAAE,GAAG,MAAM,YAAY,IAAI;CACjC,MAAM,OAAO,cAAc,MAAM,GAAG,MAAM,GAAG,GAAG,CAAC;CACjD,MAAM,QAAQ;CACd,MAAM,KAAK,KAAK,IAAI;CACpB,MAAM,KAAK,KAAK,IAAI,IAAI;CACxB,MAAM,KAAK,KAAK,IAAI;CACpB,MAAM,KAAK,KAAK,IAAI,IAAI;CACxB,MAAM,EAAE,SAAS;CACjB,OACC,KAAK,OAAO,OAAO,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,IAAI,KACrD,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI,KAC7B,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI,KAC7B,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI,KAC7B,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI;AAE/B;;;;;;AAOA,IAAM,WACJ,WACA,IAAI,MAAM,SAAS;CACnB,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI;CACjC,MAAM,OAAO,OAAO,IAAI,IAAI,IAAI;CAChC,MAAM,QAAQ,MAAM,IAAI,MAAM,KAAK,MAAM;EACxC,QAAQ,KAAK;EACb,SAAS,KAAK;EACd,SAAS,UAAU,UAAU,IAAI,OAAO,MAAM,KAAK,KAAK,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI;CAClG,CAAC;CACD,IAAI,OAAO,OAAO;CAClB,MAAM,QAAQ,GAAG,KAAK,MAAM,KAAK;CACjC,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,QAAQ,GAAG,QAAQ,QAAQ;CACjC,MAAM,UAAwC,CAAC;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACtC,IAAI,MAAM,OAAO,GAAG;EACpB,MAAM,QAAQ;GAAE,GAAG,IAAI;GAAO,GAAG,KAAK,MAAM,IAAI,KAAK;EAAE;EACvD,QAAQ,KAAK;GAAE;GAAO,GAAG,OAAO,OAAO,KAAK,IAAI;EAAE,CAAC;CACpD;CACA,QAAQ,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,IAAI,EAAE,MAAM,CAAC;CAClF,KAAK,MAAM,EAAE,WAAW,QAAQ,MAAM,GAAG,aAAa,GACrD,IAAI,UAAU,IAAI,OAAO,MAAM,KAAK,KAAK,CAAC,YAAY,OAAO,KAAK,MAAM,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,GAAG,OAAO;AAGrJ;;;;;;AAOD,IAAa,aAAa;CAAE;CAAU;CAAY;CAAQ;CAAQ;CAAS;AAAQ;;;;;;;AAQnF,SAAgB,eAAe,MAAiD;CAC/E,IAAI,KAAK,WAAW,UAAU,GAAG,OAAO,QAAQ,KAAK,MAAM,CAAiB,CAAC;CAC7E,IAAI,KAAK,WAAW,UAAU,GAAG,OAAO,QAAQ,KAAK,MAAM,CAAiB,CAAC;CAC7E,QAAQ,MAAR;EACC,KAAK,cACJ,OAAO;EACR,KAAK,UACJ,OAAO;EACR,KAAK,UACJ,OAAO;EACR,KAAK,WACJ,OAAO,QAAQ;EAChB,SACC,OAAO;CACT;AACD;;;;;;AAOA,IAAa,oBAA6D;CAAE,OAAO;CAAU,QAAQ;CAAU,QAAQ;AAAa"}

package/dist/ai/plans/plans.d.ts

@@ -18,7 +18,9 @@ export type BuildOrderItem = string | {
  * @beta
  */
 export interface PlansOptions {
+    /** Options of the build plan */
     build?: BuildPlanOptions;
+    /** Options of the production plan */
     production?: ProductionPlanOptions;
     /**
      * What to have first, in order (`BuildOrderItem`): each item waits for the one before, and nothing else the
@@ -33,8 +35,11 @@ export interface PlansOptions {
  * @beta
  */
 export interface PlansMemory {
+    /** The version of the memory's format: 1 so far */
     v: 1;
+    /** The build plan's memory */
     build?: BuildPlanMemory;
+    /** The production plan's memory */
     production?: ProductionPlanMemory;
 }
 /**
@@ -43,8 +48,11 @@ export interface PlansMemory {
  * @beta
  */
 export interface PlansReport {
+    /** The purse: what is free, promised and held */
     purse: PurseReport;
+    /** The build plan's wants and which one saves up */
     build: BuildPlanReport;
+    /** The production plan's composition and what it trained */
     production: ProductionPlanReport;
     /** The build order's next item, while it is being followed */
     order?: {
@@ -94,6 +102,7 @@ export declare class Plans implements AiArea {
     /** What the plans remember, for a save */
     /** Whether it has anything to remember now: one that does not is left out of a save */
     remembers(): boolean;
+    /** Gives a copy of the plans' memory, for a save of the brain */
     save(): PlansMemory;
     /** Takes back what `save` gave: whether it was read */
     restore(memory: unknown): boolean;

package/dist/ai/plans/plans.js

@@ -0,0 +1,110 @@
+import { BuildPlan } from "./build.js";
+import { ProductionPlan } from "./production.js";
+//#region src/ai/plans/plans.ts
+/**
+* A brain's plans (`ai.plans`): `build` for what is to be built, `production` for what is to be trained and
+* researched, the game's build `order` over both. `want` is the one door: a want of a building goes to the build
+* plan; one of a unit goes to the build plan for its buildings, and the production plan trains it
+*
+* @beta
+*/
+var Plans = class {
+	ai;
+	/** Its id among the brain's areas: what its memory and its report are kept under */
+	id = "plans";
+	/** What the log says where a save's memory of it is of a shape it does not read */
+	afresh = "the save remembers what the computer player planned in a shape this brain does not read: it plans afresh";
+	/** What to build, and the steps to it */
+	build;
+	/** What to train and research */
+	production;
+	order;
+	followedAt = -1;
+	next;
+	constructor(ai, options = {}) {
+		this.ai = ai;
+		this.build = new BuildPlan(ai, options.build);
+		this.production = new ProductionPlan(ai, options.production);
+		this.order = options.order ?? [];
+	}
+	/** Adds a want: what the brain works towards from now (`BuildPlan.want`). Gives back its id */
+	want(def) {
+		return this.build.want(def);
+	}
+	/**
+	* Works on the game's build order, once a think: the first item not had (what stands, is on its way or is queued
+	* counted; counts of a type adding up along the order) is a want before all others (`order`, priority 1000), and
+	* `following` is true. Called by the build plan as it thinks; a module may call it sooner
+	*/
+	follow() {
+		const { ai, build } = this;
+		if (this.followedAt === ai.tick) return this.next;
+		this.followedAt = ai.tick;
+		let next;
+		const wanted = /* @__PURE__ */ new Map();
+		for (let i = 0; i < this.order.length && !next; i++) {
+			const item = this.order[i];
+			const { type, count = 1 } = typeof item === "string" ? { type: item } : item;
+			const need = (wanted.get(type) ?? 0) + count;
+			wanted.set(type, need);
+			if (build.have(type) + build.onItsWay(type) < need) next = {
+				type,
+				count: need,
+				item: i
+			};
+		}
+		this.next = next;
+		if (next) build.want({
+			id: "order",
+			type: next.type,
+			count: next.count,
+			priority: 1e3,
+			by: "the build order"
+		});
+		else build.drop("order");
+		return next;
+	}
+	/** Whether the game's build order is still being followed: what the computer would make of itself waits */
+	get following() {
+		return this.follow() !== void 0;
+	}
+	/** Takes a want out, by id */
+	drop(id) {
+		return this.build.drop(id);
+	}
+	/** The purse and each plan's part, for the report */
+	report() {
+		return {
+			purse: this.ai.purse.inspect(),
+			build: this.build.report(),
+			production: this.production.report(),
+			...this.next && { order: { ...this.next } }
+		};
+	}
+	/** What the plans remember, for a save */
+	/** Whether it has anything to remember now: one that does not is left out of a save */
+	remembers() {
+		return true;
+	}
+	/** Gives a copy of the plans' memory, for a save of the brain */
+	save() {
+		const production = this.production.save();
+		return {
+			v: 1,
+			build: this.build.save(),
+			...production && { production }
+		};
+	}
+	/** Takes back what `save` gave: whether it was read */
+	restore(memory) {
+		const given = memory;
+		if (!given || typeof given !== "object" || given.v !== 1) return false;
+		if (given.build !== void 0) this.build.restore(given.build);
+		this.production.restore(given.production);
+		return true;
+	}
+};
+//#endregion
+export { Plans };
+
+//# sourceMappingURL=plans.js.map