@v12-engine/engine 0.1.0 → 0.4.0

package/dist/ai/defence.js

@@ -0,0 +1,430 @@
+import { distSq } from "../math.js";
+import { defineModule } from "./module.js";
+import { consider, curve, defineGoal } from "./goals.js";
+import { pair, point, where } from "./geometry.js";
+//#region src/ai/defence.ts
+/** The share of the army's strength a raid scores the whole point at: one as strong as the army is everything */
+var SCORE_FROM = .6;
+/**
+* The id of the defence's goal: what a game weighs it by (`AiOptions.weigh`)
+*
+* @beta
+*/
+var DEFEND = "defend";
+/** The name of the squad that answers the strongest raid; the others are `defence 2`, `defence 3` */
+var SQUAD = "defence";
+var squadName = (i) => i === 0 ? SQUAD : `${SQUAD} ${i + 1}`;
+/**
+* A brain's defence (`ai.defence`): the raids on its bases and the answer to each, through its goal (`defend`), and the
+* towers a raided base wants. Run by the `defence()` module each think; asked by whoever wants to know (`intruders`,
+* `raids`). Kept in the brain's memory (`BrainMemory.defence`)
+*
+* @internal
+*/
+var Defence = class Defence {
+	ai;
+	/** What finds it on a brain (`ai.area(Defence)`): made the first time a module asks for it */
+	static id = "defence";
+	/** Makes the defence of a brain; what `ai.area(Defence)` calls the first time a module asks for it */
+	static make(ai) {
+		return new Defence(ai);
+	}
+	/** Its id among the brain's areas: what its memory and its report are kept under */
+	id = "defence";
+	/** What the log says where a save's memory of it is of a shape it does not read */
+	afresh = "the save remembers the raids on the computer player in a shape this brain does not read: it starts afresh";
+	/** Whether a `defence()` module is in the brain: without one, nothing here runs, and the goal is not the brain's */
+	enabled = false;
+	memory = {
+		v: 1,
+		raids: {}
+	};
+	moduleOptions = {};
+	thoughtAt = -1;
+	/** The goal it answers raids through: added to the brain's picker by the module */
+	goal;
+	constructor(ai) {
+		this.ai = ai;
+		this.goal = this.makeGoal();
+	}
+	/** Puts the `defence()` module's options under the brain's settings, and its goal on the picker */
+	configure(options) {
+		this.moduleOptions = options;
+		if (!this.enabled) this.ai.goals.add(this.goal);
+		this.enabled = true;
+	}
+	/** How it defends: the module's options, the brain's settings over them (`ai.settings.defence`) */
+	get options() {
+		return this.ai.cache("defence.options", () => ({
+			...this.moduleOptions,
+			...this.ai.settings.defence
+		}));
+	}
+	/** How near its buildings a rival's unit is an intruder */
+	get radius() {
+		return this.options.radius ?? 16;
+	}
+	/** How much stronger than a raid the defenders sent are: from the odds asked, by the square law (two in three: √2) */
+	get margin() {
+		const odds = Math.min(.95, Math.max(.05, this.options.odds ?? 2 / 3));
+		return Math.sqrt(odds / (1 - odds));
+	}
+	/** The rivals' units at its buildings, once a think: not creeps that camp near (they are for creeping) */
+	intruders() {
+		const { ai } = this;
+		return ai.cache("defence.intruders", () => {
+			const { view } = ai;
+			const buildings = view.mine.buildings();
+			const reach = this.radius * this.radius;
+			return view.enemies.units().alive().where((enemy) => buildings.some((building) => distSq(building, enemy) < reach));
+		});
+	}
+	/** The intruders base by base (each at the base whose buildings it is nearest), strongest first, once a think */
+	raids() {
+		const { ai } = this;
+		return ai.cache("defence.raids", () => {
+			const { view } = ai;
+			const intruders = this.intruders();
+			if (!intruders.length) return [];
+			const bases = view.bases();
+			const by = /* @__PURE__ */ new Map();
+			for (const enemy of intruders) {
+				let best;
+				let bestDistance = Infinity;
+				for (const base of bases) for (const building of base.buildings) {
+					const d = distSq(building, enemy);
+					if (d < bestDistance) {
+						bestDistance = d;
+						best = base;
+					}
+				}
+				if (best) (by.get(best) ?? by.set(best, []).get(best)).push(enemy);
+			}
+			const raids = [];
+			for (const [base, enemies] of by) {
+				const set = intruders.where((entity) => enemies.includes(entity));
+				raids.push({
+					base,
+					key: String(base.centre.id),
+					intruders: set,
+					strength: set.strength()
+				});
+			}
+			return raids.sort((a, b) => b.strength - a.strength || a.base.centre.id - b.base.centre.id);
+		});
+	}
+	/** Its fighters: what is gathering (a ghoul at the trees) is at work, not in the army */
+	army(units) {
+		return units.fighters().where((entity) => entity.own?.order !== "harvest");
+	}
+	/**
+	* What is at home to meet a raid: the fighters nothing else holds (the pool) and what the defence holds already. What
+	* a raid is weighed against for the army to come home
+	*/
+	atHome() {
+		const { ai } = this;
+		return ai.cache("defence.home", () => {
+			const { goals } = ai;
+			return this.army(ai.view.mine.where((unit) => !goals.holder(unit.id) || goals.holder(unit.id) === "defend")).strength();
+		});
+	}
+	/** Whether the army is to come home: a raid more than what is at home can meet, where it may */
+	recalling() {
+		if (this.options.recall === false) return false;
+		const strongest = this.raids()[0];
+		return !!strongest && strongest.strength * this.margin > this.atHome();
+	}
+	/** The goal: scored on the raids against the army, urgent when the army is to come home, run with a squad a raid */
+	makeGoal() {
+		return defineGoal({
+			id: DEFEND,
+			considerations: [consider("intruders at my buildings", () => this.intruders().length, curve.step(1)), consider("the raid against my army", () => this.intruders().strength() / Math.max(1e-9, this.army(this.ai.view.mine).strength()), curve.custom((x) => SCORE_FROM + .4 * Math.min(1, x)))],
+			urgent: () => this.recalling(),
+			claims: { units: (_ai, available) => this.claim(available) },
+			commitment: 3,
+			run: (_ai, claimed) => this.answer(claimed.units)
+		});
+	}
+	/**
+	* What the goal claims as it is picked: for each raid, strongest first, the fighters nearest it that make it as much
+	* stronger as asked, out of what it may have: those nothing holds first, then (where the army is to come home) whole
+	* squads, the nearest first
+	*/
+	claim(available) {
+		const { ai } = this;
+		const { view } = ai;
+		const chosen = [];
+		const taken = /* @__PURE__ */ new Set();
+		const fighters = this.army(available);
+		for (const raid of this.raids()) {
+			const target = raid.intruders.first();
+			const need = raid.strength * this.margin;
+			let got = 0;
+			const free = fighters.items.filter((unit) => !taken.has(unit.id) && !ai.goals.holder(unit.id));
+			free.sort((a, b) => distSq(a, target) - distSq(b, target) || a.id - b.id);
+			for (const unit of free) {
+				if (got >= need && chosen.length) break;
+				chosen.push(unit);
+				taken.add(unit.id);
+				got += view.strength.of(unit);
+			}
+			if (got >= need) continue;
+			const squads = /* @__PURE__ */ new Map();
+			for (const unit of fighters) {
+				if (taken.has(unit.id) || !ai.goals.holder(unit.id)) continue;
+				const squad = ai.squads.squadOf(unit);
+				(squads.get(squad) ?? squads.set(squad, []).get(squad)).push(unit);
+			}
+			const groups = [...squads.values()].sort((a, b) => distSq(a[0], target) - distSq(b[0], target) || a[0].id - b[0].id);
+			for (const group of groups) {
+				if (got >= need) break;
+				for (const unit of group) {
+					chosen.push(unit);
+					taken.add(unit.id);
+					got += view.strength.of(unit);
+				}
+			}
+		}
+		return chosen;
+	}
+	/**
+	* The goal's run, each think it holds its claim: a squad for each raid, strongest first. A squad keeps answering the
+	* raid at the base it was sent to while that goes on; what it lacks is made up from what the goal holds and no squad
+	* has, then from what nothing holds, the nearest first; and where the army is to come home, from the squads of other
+	* goals, whole
+	*/
+	answer(held) {
+		const { ai } = this;
+		const { view } = ai;
+		const raids = this.raids();
+		const radius = this.radius;
+		const margin = this.margin;
+		const mine = ai.squads.of(DEFEND).squads.filter((squad) => squad.name === SQUAD || squad.name.startsWith(`${SQUAD} `));
+		const matched = /* @__PURE__ */ new Map();
+		for (const squad of mine) {
+			const at = squad.current?.data.at;
+			const raid = at && raids.find((each) => !matched.has(each) && each.base.buildings.some((building) => distSq(building, at) <= radius * radius * 4));
+			if (raid) matched.set(raid, squad);
+		}
+		const inSquads = new Set(mine.filter((squad) => [...matched.values()].includes(squad)).flatMap((squad) => squad.data.units));
+		const spare = this.army(held).where((unit) => !inSquads.has(unit.id));
+		const used = /* @__PURE__ */ new Set();
+		const recall = this.recalling();
+		raids.forEach((raid, i) => {
+			const target = raid.intruders.nearest(matched.get(raid)?.centre() ?? raid.base.at);
+			let squad = matched.get(raid);
+			let got = squad ? squad.strength() : 0;
+			const need = raid.strength * margin;
+			const more = [];
+			const add = (units) => {
+				for (const unit of units) {
+					if (got >= need && (squad?.length || more.length)) return;
+					if (used.has(unit.id) || inSquads.has(unit.id)) continue;
+					used.add(unit.id);
+					more.push(unit.id);
+					got += view.strength.of(unit);
+				}
+			};
+			const byDistance = (units) => [...units].sort((a, b) => distSq(a, target) - distSq(b, target) || a.id - b.id);
+			add(byDistance(spare.items));
+			if (got < need) add(byDistance(this.army(ai.squads.pool()).idle().items));
+			if (got < need && recall) {
+				const others = ai.squads.all().squads.filter((each) => each.owner !== "defend" && ai.goals.get(each.owner) && each.length).sort((a, b) => distSq(a.centre() ?? target, target) - distSq(b.centre() ?? target, target));
+				for (const other of others) {
+					if (got >= need) break;
+					const ids = other.data.units.filter((id) => ai.goals.holder(id) !== "defend" && !used.has(id));
+					if (!ids.length) continue;
+					const before = more.length;
+					add(this.army(view.mine.where((unit) => ids.includes(unit.id))).items);
+					const called = more.slice(before);
+					if (!called.length) continue;
+					ai.goals.take(called, "urgent");
+					ai.decide(`calls ${called.length === ids.length ? other.name : `${called.length} of ${other.name}`} home to meet a raid of ${raid.intruders.length} at ${where(raid.base.at)}`, {
+						kind: "defence",
+						goal: DEFEND
+					});
+				}
+			}
+			if (!squad) {
+				if (!more.length) return;
+				squad = ai.squads.make(squadName(i), more, {
+					retreatAt: false,
+					owner: DEFEND
+				});
+				squad.defend(point(target), radius);
+				ai.decide(`answers a raid of ${raid.intruders.length} at ${where(raid.base.at)} with ${more.length} (strength ${Math.round(got)} to ${Math.round(raid.strength)})`, {
+					kind: "defence",
+					goal: DEFEND
+				});
+				return;
+			}
+			if (more.length) squad.add(more, "sent to meet the raid");
+			const at = squad.current?.data.at;
+			if (!at || squad.done !== void 0 || distSq(at, target) > radius * radius) squad.defend(point(target), radius);
+		});
+		for (const squad of mine) if (![...matched.values()].includes(squad) && squad.alive) ai.squads.disband(squad, "its raid is over");
+	}
+	/**
+	* The think, once a think: the raids counted base by base (one begins as intruders come to a base that stood clear,
+	* and is over once it stood clear `quiet` seconds again), and the towers a base raided often enough wants
+	*/
+	think() {
+		const { ai } = this;
+		if (this.thoughtAt === ai.tick) return;
+		this.thoughtAt = ai.tick;
+		const { view } = ai;
+		const quiet = (this.options.quiet ?? 15) * ai.session.tickRate;
+		const raids = this.raids();
+		const kept = this.memory.raids;
+		for (const raid of raids) {
+			const record = kept[raid.key] ??= {
+				at: point(raid.base.at),
+				count: 0,
+				last: ai.tick,
+				most: 0
+			};
+			if (record.since === void 0) {
+				record.count++;
+				record.since = ai.tick;
+				record.most = 0;
+				ai.decide(`raid ${record.count} on the base at ${where(raid.base.at)}: ${raid.intruders.length} of theirs, strength ${Math.round(raid.strength)}`, { kind: "defence" });
+			}
+			record.last = ai.tick;
+			record.most = Math.max(record.most, raid.strength);
+		}
+		const bases = new Set(view.bases().map((base) => String(base.centre.id)));
+		for (const key in kept) {
+			const record = kept[key];
+			if (record.since !== void 0 && ai.tick - record.last > quiet) delete record.since;
+			if (!bases.has(key)) {
+				delete kept[key];
+				ai.plans.build.drop(`defence.tower:${key}`);
+			}
+		}
+		this.towers();
+	}
+	/** The tower it builds: the one named, or the cheapest of the `tower` role its workers build */
+	towerType() {
+		const { ai } = this;
+		const named = this.options.tower;
+		if (named) return ai.registry.units.has(named) ? named : void 0;
+		const { view, registry } = ai;
+		const builds = new Set(view.typesOf("worker").flatMap((def) => def.builds ?? []));
+		const money = registry.currency ?? registry.resources[0]?.id ?? "";
+		return [...view.typesOf("tower").filter((def) => builds.has(def.id))].sort((a, b) => (a.cost?.[money] ?? 0) - (b.cost?.[money] ?? 0))[0]?.id;
+	}
+	/** The towers a base raided often enough wants: a standing want of the build plan, by the base */
+	towers() {
+		const { ai } = this;
+		const options = this.options;
+		const wanted = options.towers ?? 1;
+		const after = options.towerAfter ?? 2;
+		const type = this.towerType();
+		if (!type || wanted <= 0) return;
+		const { view } = ai;
+		for (const base of view.bases()) {
+			const key = String(base.centre.id);
+			const record = this.memory.raids[key];
+			const id = `defence.tower:${key}`;
+			if (!record || record.count < after) continue;
+			const at = point(base.at);
+			if (!ai.plans.build.get(id)) ai.decide(`wants ${wanted === 1 ? "a tower" : `${wanted} towers`} at the base at ${where(at)}: raided ${record.count} times`, { kind: "defence" });
+			ai.plans.build.want({
+				id,
+				type,
+				count: (brain) => {
+					const all = brain.view.mine.ofType(type);
+					return all.length - all.near(at, 14).length + wanted;
+				},
+				near: at,
+				within: 12,
+				priority: 45,
+				keep: true,
+				by: "defence"
+			});
+		}
+	}
+	/** The defence as the report shows it */
+	report() {
+		const { ai } = this;
+		if (!this.enabled) return {
+			raids: [],
+			bases: [],
+			towers: []
+		};
+		const squads = ai.squads.of(DEFEND).squads;
+		return {
+			raids: this.raids().map((raid) => {
+				const squad = squads.find((each) => {
+					const at = each.current?.data.at;
+					return !!at && raid.base.buildings.some((building) => distSq(building, at) <= this.radius * this.radius * 4);
+				});
+				const record = this.memory.raids[raid.key];
+				return {
+					at: pair(raid.base.at),
+					intruders: raid.intruders.map((unit) => unit.id),
+					strength: Math.round(raid.strength),
+					...squad && { squad: squad.name },
+					defenders: squad?.length ?? 0,
+					since: record?.since ?? ai.tick,
+					count: record?.count ?? 1
+				};
+			}),
+			bases: Object.values(this.memory.raids).map((record) => ({
+				at: pair(record.at),
+				raids: record.count,
+				last: record.last
+			})),
+			towers: ai.plans.build.list().filter((want) => want.id?.startsWith("defence.tower:")).map((want) => ({
+				at: pair(want.near),
+				want: want.id,
+				status: ai.plans.build.status(want.id) ?? "new"
+			}))
+		};
+	}
+	/** What it remembers, for a save: a copy */
+	/** Whether it has anything to remember now: one that does not is left out of a save */
+	remembers() {
+		return this.enabled;
+	}
+	/** Its part of the brain's report */
+	reportTo(report) {
+		report.defence = this.report();
+	}
+	/** Gives a copy of the defence's memory, for a save of the brain */
+	save() {
+		return structuredClone(this.memory);
+	}
+	/** Takes back what `save` gave: whether it was read */
+	restore(memory) {
+		const given = memory;
+		if (!given || typeof given !== "object" || given.v !== 1) return false;
+		this.memory = {
+			v: 1,
+			raids: structuredClone(given.raids ?? {})
+		};
+		return true;
+	}
+};
+/**
+* The defence module: the raids on the bases counted each think, the towers a raided base wants (`ai.defence.think`),
+* and the `defend` goal put on the brain's picker, which answers each raid with a squad of its own. With how it defends
+* where the brain's definition and the seat's options say nothing (`DefenceOptions`)
+*
+* @beta
+*/
+var defence = (options = {}) => defineModule({
+	id: "defence",
+	make: (ai) => {
+		ai.area(Defence).configure(options);
+		return {
+			id: "defence",
+			phase: "sense",
+			think: () => ai.area(Defence).think()
+		};
+	}
+});
+//#endregion
+export { DEFEND, Defence, defence };
+
+//# sourceMappingURL=defence.js.map

package/dist/ai/defence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defence.js","names":[],"sources":["../../src/ai/defence.ts"],"sourcesContent":["import { distSq, type Vec2 } from '#engine/math'\nimport type { AiArea } from './area'\nimport type { AiReport } from './report'\nimport type { EntityState } from '#engine/session/protocol'\nimport { type Brain } from './brain'\nimport { type AiModule, type AiModuleDef, defineModule } from './module'\nimport { consider, curve, defineGoal, type GoalDef } from './goals'\nimport type { Squad } from './squads'\nimport type { Base, UnitSet } from './view'\nimport { pair, point, where } from './geometry'\n\n/*\n * Defence (AI plan, C4): what comes at the bases, and the answer to it. The old melee player sent the fighters\n * nearest any rival unit at its buildings, half again as strong, and nothing kept count: a raid at the mine every\n * minute was met the same way every minute, and the computer never thought of a tower there. This is what a player\n * does when the minimap flashes:\n *\n * - **Intruders** are the rivals' units within `radius` of one of its buildings (creeps are not: they camp, and are\n *   for creeping). They are taken base by base: a **raid** is the intruders at one base, with their strength.\n * - **The answer is sized to the raid.** For each raid, strongest first, the fighters nearest it that make the odds of\n *   the fight (`Strength.odds`, A4: Lanchester's square law, a number of the chance to win) at least `odds` (two in\n *   three): one footman for a peasant that came to look, five for a party of four, not the whole army for a scout.\n *   Each raid gets a squad of its own (`defence`, `defence 2`, …), sent to defend the place, which fights what comes\n *   within the radius and goes back once it is gone. What nothing holds goes first, so that the wave out goes on.\n * - **The army comes home** (`recall`) when a raid is more than what is at home can meet: the goal is urgent then,\n *   and as it scores past the wave (a raid over half the army's strength) it takes the squads out, whole.\n * - **Raids are counted** a base at a time: one is over once the base has stood clear `quiet` seconds. A base raided\n *   `towerAfter` times wants `towers` towers (the build plan builds them by the base, and anew when lost).\n * - **Help** from an ally is C5's (`defendUsers`): the team's requests.\n *\n * The defence is a goal on the brain's picker (`defend`, the `defence()` module adds it), so it competes with the\n * others for units as any goal does, and the one order of who may move a unit holds. What it remembers (the raids of\n * each base) is plain data in the brain's memory (`BrainMemory.defence`).\n */\n\n/** The share of the army's strength a raid scores the whole point at: one as strong as the army is everything */\nconst SCORE_FROM = 0.6\n\n/**\n * How a brain defends its bases (`BrainDef.defence`, the seat's `AiOptions.defence` over it, the `defence()` module's\n * own under both). Data, kept in a save\n *\n * @beta\n */\nexport interface DefenceOptions {\n\t/** How near one of its buildings a rival's unit is an intruder: the seat's `defendRadius`, else 16 */\n\tradius?: number\n\t/**\n\t * The odds of the fight (`Strength.odds`) the defenders sent against a raid are to have: two in three when left out\n\t * (about four tenths stronger than the raid)\n\t */\n\todds?: number\n\t/**\n\t * Whether a raid more than what is at home can meet brings the army home (the goal is urgent: it takes squads out,\n\t * whole, once it scores past what they are on): yes when left out\n\t */\n\trecall?: boolean\n\t/** Towers a base wants once raided `towerAfter` times: 1 when left out. 0 for none */\n\ttowers?: number\n\t/** Raids at one base before it wants towers: 2 when left out */\n\ttowerAfter?: number\n\t/** The tower to build, by type id: the cheapest of the `tower` role its workers build when left out */\n\ttower?: string\n\t/** Seconds a base stands clear before a raid on it is over: 15 when left out */\n\tquiet?: number\n}\n\n/**\n * What the defence remembers between thinks, as a save keeps it: each base's raids\n *\n * @beta\n */\nexport interface DefenceMemory {\n\t/** The version of the memory's format: 1 so far */\n\tv: 1\n\t/** By base (the id of what it is around): where, how many raids, the one on now (since when), when last seen, the strongest */\n\traids: Record<string, { at: Vec2; count: number; since?: number; last: number; most: number }>\n}\n\n/**\n * The intruders at one base, as the defence sees them this think (`ai.defence.raids()`)\n *\n * @beta\n */\nexport interface Raid {\n\t/** The base raided */\n\tbase: Base\n\t/** What the defence remembers it by: the id of what the base is around */\n\tkey: string\n\t/** The rivals' units there */\n\tintruders: UnitSet\n\t/** Their strength together (`Strength.of`) */\n\tstrength: number\n}\n\n/**\n * The defence as the report shows it (`AiReport.defence`): the raids on now with what answers each, every base's raids\n * so far, the towers it wants\n *\n * @beta\n */\nexport interface DefenceReport {\n\t/** The raids on now, each with where it is, the enemy units in it, their strength, the squad that answers it and how many defend, since when and how many so far */\n\traids: { at: [number, number]; intruders: number[]; strength: number; squad?: string; defenders: number; since: number; count: number }[]\n\t/** The bases raided, each with where it is, how many raids it had and the tick of the last */\n\tbases: { at: [number, number]; raids: number; last: number }[]\n\t/** The towers it wants, each with where, the type wanted and how far the want is along */\n\ttowers: { at: [number, number]; want: string; status: string }[]\n}\n\n/**\n * The id of the defence's goal: what a game weighs it by (`AiOptions.weigh`)\n *\n * @beta\n */\nexport const DEFEND = 'defend'\n/** The name of the squad that answers the strongest raid; the others are `defence 2`, `defence 3` */\nconst SQUAD = 'defence'\nconst squadName = (i: number) => (i === 0 ? SQUAD : `${SQUAD} ${i + 1}`)\n\n/**\n * A brain's defence (`ai.defence`): the raids on its bases and the answer to each, through its goal (`defend`), and the\n * towers a raided base wants. Run by the `defence()` module each think; asked by whoever wants to know (`intruders`,\n * `raids`). Kept in the brain's memory (`BrainMemory.defence`)\n *\n * @internal\n */\nexport class Defence implements AiArea {\n\t/** What finds it on a brain (`ai.area(Defence)`): made the first time a module asks for it */\n\tstatic readonly id = 'defence'\n\t/** Makes the defence of a brain; what `ai.area(Defence)` calls the first time a module asks for it */\n\tstatic make(ai: Brain): Defence {\n\t\treturn new Defence(ai)\n\t}\n\t/** Its id among the brain's areas: what its memory and its report are kept under */\n\treadonly id = 'defence'\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 raids on the computer player in a shape this brain does not read: it starts afresh'\n\n\t/** Whether a `defence()` module is in the brain: without one, nothing here runs, and the goal is not the brain's */\n\tenabled = false\n\tprivate memory: DefenceMemory = { v: 1, raids: {} }\n\tprivate moduleOptions: DefenceOptions = {}\n\tprivate thoughtAt = -1\n\t/** The goal it answers raids through: added to the brain's picker by the module */\n\treadonly goal: GoalDef\n\n\tconstructor(\n\t\t/** The brain it defends for */\n\t\treadonly ai: Brain\n\t) {\n\t\tthis.goal = this.makeGoal()\n\t}\n\n\t/** Puts the `defence()` module's options under the brain's settings, and its goal on the picker */\n\tconfigure(options: DefenceOptions): void {\n\t\tthis.moduleOptions = options\n\t\tif (!this.enabled) this.ai.goals.add(this.goal)\n\t\tthis.enabled = true\n\t}\n\n\t/** How it defends: the module's options, the brain's settings over them (`ai.settings.defence`) */\n\tget options(): DefenceOptions {\n\t\treturn this.ai.cache('defence.options', () => ({ ...this.moduleOptions, ...this.ai.settings.defence }))\n\t}\n\n\t/** How near its buildings a rival's unit is an intruder */\n\tget radius(): number {\n\t\treturn this.options.radius ?? 16\n\t}\n\n\t/** How much stronger than a raid the defenders sent are: from the odds asked, by the square law (two in three: √2) */\n\tget margin(): number {\n\t\tconst odds = Math.min(0.95, Math.max(0.05, this.options.odds ?? 2 / 3))\n\t\treturn Math.sqrt(odds / (1 - odds))\n\t}\n\n\t/** The rivals' units at its buildings, once a think: not creeps that camp near (they are for creeping) */\n\tintruders(): UnitSet {\n\t\tconst { ai } = this\n\t\treturn ai.cache('defence.intruders', () => {\n\t\t\tconst { view } = ai\n\t\t\tconst buildings = view.mine.buildings()\n\t\t\tconst reach = this.radius * this.radius\n\t\t\treturn view.enemies\n\t\t\t\t.units()\n\t\t\t\t.alive()\n\t\t\t\t.where((enemy) => buildings.some((building) => distSq(building, enemy) < reach))\n\t\t})\n\t}\n\n\t/** The intruders base by base (each at the base whose buildings it is nearest), strongest first, once a think */\n\traids(): Raid[] {\n\t\tconst { ai } = this\n\t\treturn ai.cache('defence.raids', () => {\n\t\t\tconst { view } = ai\n\t\t\tconst intruders = this.intruders()\n\t\t\tif (!intruders.length) return []\n\t\t\tconst bases = view.bases()\n\t\t\tconst by = new Map<Base, EntityState[]>()\n\t\t\tfor (const enemy of intruders) {\n\t\t\t\tlet best: Base | undefined\n\t\t\t\tlet bestDistance = Infinity\n\t\t\t\tfor (const base of bases) {\n\t\t\t\t\tfor (const building of base.buildings) {\n\t\t\t\t\t\tconst d = distSq(building, enemy)\n\t\t\t\t\t\tif (d < bestDistance) {\n\t\t\t\t\t\t\tbestDistance = d\n\t\t\t\t\t\t\tbest = base\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (best) (by.get(best) ?? by.set(best, []).get(best)!).push(enemy)\n\t\t\t}\n\t\t\tconst raids: Raid[] = []\n\t\t\tfor (const [base, enemies] of by) {\n\t\t\t\tconst set = intruders.where((entity) => enemies.includes(entity))\n\t\t\t\traids.push({ base, key: String(base.centre.id), intruders: set, strength: set.strength() })\n\t\t\t}\n\t\t\treturn raids.sort((a, b) => b.strength - a.strength || a.base.centre.id - b.base.centre.id)\n\t\t})\n\t}\n\n\t/** Its fighters: what is gathering (a ghoul at the trees) is at work, not in the army */\n\tprivate army(units: UnitSet): UnitSet {\n\t\treturn units.fighters().where((entity) => entity.own?.order !== 'harvest')\n\t}\n\n\t/**\n\t * What is at home to meet a raid: the fighters nothing else holds (the pool) and what the defence holds already. What\n\t * a raid is weighed against for the army to come home\n\t */\n\tprivate atHome(): number {\n\t\tconst { ai } = this\n\t\treturn ai.cache('defence.home', () => {\n\t\t\tconst { goals } = ai\n\t\t\treturn this.army(ai.view.mine.where((unit) => !goals.holder(unit.id) || goals.holder(unit.id) === DEFEND)).strength()\n\t\t})\n\t}\n\n\t/** Whether the army is to come home: a raid more than what is at home can meet, where it may */\n\tprivate recalling(): boolean {\n\t\tif (this.options.recall === false) return false\n\t\tconst strongest = this.raids()[0]\n\t\treturn !!strongest && strongest.strength * this.margin > this.atHome()\n\t}\n\n\t/** The goal: scored on the raids against the army, urgent when the army is to come home, run with a squad a raid */\n\tprivate makeGoal(): GoalDef {\n\t\treturn defineGoal({\n\t\t\tid: DEFEND,\n\t\t\tconsiderations: [\n\t\t\t\tconsider('intruders at my buildings', () => this.intruders().length, curve.step(1)),\n\t\t\t\t// six tenths for any intruder, the whole point for a raid as strong as the army: a lone scout at home does not\n\t\t\t\t// call the wave back, a raid does\n\t\t\t\tconsider(\n\t\t\t\t\t'the raid against my army',\n\t\t\t\t\t() => this.intruders().strength() / Math.max(1e-9, this.army(this.ai.view.mine).strength()),\n\t\t\t\t\tcurve.custom((x) => SCORE_FROM + (1 - SCORE_FROM) * Math.min(1, x))\n\t\t\t\t)\n\t\t\t],\n\t\t\t// it may break what the army out is committed to when what is at home cannot meet the raid\n\t\t\turgent: () => this.recalling(),\n\t\t\tclaims: { units: (_ai, available) => this.claim(available) },\n\t\t\tcommitment: 3,\n\t\t\trun: (_ai, claimed) => this.answer(claimed.units)\n\t\t})\n\t}\n\n\t/**\n\t * What the goal claims as it is picked: for each raid, strongest first, the fighters nearest it that make it as much\n\t * stronger as asked, out of what it may have: those nothing holds first, then (where the army is to come home) whole\n\t * squads, the nearest first\n\t */\n\tprivate claim(available: UnitSet): EntityState[] {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst chosen: EntityState[] = []\n\t\tconst taken = new Set<number>()\n\t\tconst fighters = this.army(available)\n\t\tfor (const raid of this.raids()) {\n\t\t\tconst target = raid.intruders.first()!\n\t\t\tconst need = raid.strength * this.margin\n\t\t\tlet got = 0\n\t\t\tconst free = fighters.items.filter((unit) => !taken.has(unit.id) && !ai.goals.holder(unit.id))\n\t\t\tfree.sort((a, b) => distSq(a, target) - distSq(b, target) || a.id - b.id)\n\t\t\tfor (const unit of free) {\n\t\t\t\tif (got >= need && chosen.length) break\n\t\t\t\tchosen.push(unit)\n\t\t\t\ttaken.add(unit.id)\n\t\t\t\tgot += view.strength.of(unit)\n\t\t\t}\n\t\t\tif (got >= need) continue\n\t\t\t// short: what others hold and it may take, a squad at a time\n\t\t\tconst squads = new Map<Squad | undefined, EntityState[]>()\n\t\t\tfor (const unit of fighters) {\n\t\t\t\tif (taken.has(unit.id) || !ai.goals.holder(unit.id)) continue\n\t\t\t\tconst squad = ai.squads.squadOf(unit)\n\t\t\t\t;(squads.get(squad) ?? squads.set(squad, []).get(squad)!).push(unit)\n\t\t\t}\n\t\t\tconst groups = [...squads.values()].sort((a, b) => distSq(a[0], target) - distSq(b[0], target) || a[0].id - b[0].id)\n\t\t\tfor (const group of groups) {\n\t\t\t\tif (got >= need) break\n\t\t\t\tfor (const unit of group) {\n\t\t\t\t\tchosen.push(unit)\n\t\t\t\t\ttaken.add(unit.id)\n\t\t\t\t\tgot += view.strength.of(unit)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn chosen\n\t}\n\n\t/**\n\t * The goal's run, each think it holds its claim: a squad for each raid, strongest first. A squad keeps answering the\n\t * raid at the base it was sent to while that goes on; what it lacks is made up from what the goal holds and no squad\n\t * has, then from what nothing holds, the nearest first; and where the army is to come home, from the squads of other\n\t * goals, whole\n\t */\n\tprivate answer(held: UnitSet): void {\n\t\tconst { ai } = this\n\t\tconst { view } = ai\n\t\tconst raids = this.raids()\n\t\tconst radius = this.radius\n\t\tconst margin = this.margin\n\t\t// the squads answering, each matched to the raid at the base it defends; a squad whose raid is over is let go of\n\t\tconst mine = ai.squads.of(DEFEND).squads.filter((squad) => squad.name === SQUAD || squad.name.startsWith(`${SQUAD} `))\n\t\tconst matched = new Map<Raid, Squad>()\n\t\tfor (const squad of mine) {\n\t\t\tconst at = squad.current?.data.at as Vec2 | undefined\n\t\t\tconst raid =\n\t\t\t\tat && raids.find((each) => !matched.has(each) && each.base.buildings.some((building) => distSq(building, at) <= radius * radius * 4))\n\t\t\tif (raid) matched.set(raid, squad)\n\t\t}\n\t\tconst inSquads = new Set(mine.filter((squad) => [...matched.values()].includes(squad)).flatMap((squad) => squad.data.units))\n\t\tconst spare = this.army(held).where((unit) => !inSquads.has(unit.id))\n\t\tconst used = new Set<number>()\n\t\tconst recall = this.recalling()\n\t\traids.forEach((raid, i) => {\n\t\t\tconst target = raid.intruders.nearest(matched.get(raid)?.centre() ?? raid.base.at)!\n\t\t\tlet squad = matched.get(raid)\n\t\t\tlet got = squad ? squad.strength() : 0\n\t\t\tconst need = raid.strength * margin\n\t\t\tconst more: number[] = []\n\t\t\tconst add = (units: Iterable<EntityState>) => {\n\t\t\t\tfor (const unit of units) {\n\t\t\t\t\tif (got >= need && (squad?.length || more.length)) return\n\t\t\t\t\tif (used.has(unit.id) || inSquads.has(unit.id)) continue\n\t\t\t\t\tused.add(unit.id)\n\t\t\t\t\tmore.push(unit.id)\n\t\t\t\t\tgot += view.strength.of(unit)\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst byDistance = (units: readonly EntityState[]) => [...units].sort((a, b) => distSq(a, target) - distSq(b, target) || a.id - b.id)\n\t\t\tadd(byDistance(spare.items))\n\t\t\tif (got < need) add(byDistance(this.army(ai.squads.pool()).idle().items))\n\t\t\tif (got < need && recall) {\n\t\t\t\t// the army home: other goals' squads, whole, the nearest first\n\t\t\t\tconst others = ai.squads\n\t\t\t\t\t.all()\n\t\t\t\t\t.squads.filter((each) => each.owner !== DEFEND && ai.goals.get(each.owner) && each.length)\n\t\t\t\t\t.sort((a, b) => distSq(a.centre() ?? target, target) - distSq(b.centre() ?? target, target))\n\t\t\t\tfor (const other of others) {\n\t\t\t\t\tif (got >= need) break\n\t\t\t\t\t// what the goal claimed of it already is its own: only the rest is taken\n\t\t\t\t\tconst ids = other.data.units.filter((id) => ai.goals.holder(id) !== DEFEND && !used.has(id))\n\t\t\t\t\tif (!ids.length) continue\n\t\t\t\t\t// only what the raid needs of it: the rest stays with its goal (taken and left in the pool, its goal would\n\t\t\t\t\t// pick it up again, and its squad be made anew: orders sent twice)\n\t\t\t\t\tconst before = more.length\n\t\t\t\t\t// its fighters: a worker on another goal's errand (a scout) goes on with it, and is not sent to a fight (AI1)\n\t\t\t\t\tadd(this.army(view.mine.where((unit) => ids.includes(unit.id))).items)\n\t\t\t\t\tconst called = more.slice(before)\n\t\t\t\t\tif (!called.length) continue\n\t\t\t\t\tai.goals.take(called, 'urgent')\n\t\t\t\t\tai.decide(\n\t\t\t\t\t\t`calls ${called.length === ids.length ? other.name : `${called.length} of ${other.name}`} home to meet a raid of ${raid.intruders.length} at ${where(raid.base.at)}`,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: 'defence',\n\t\t\t\t\t\t\tgoal: DEFEND\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!squad) {\n\t\t\t\tif (!more.length) return\n\t\t\t\tsquad = ai.squads.make(squadName(i), more, { retreatAt: false, owner: DEFEND })\n\t\t\t\tsquad.defend(point(target), radius)\n\t\t\t\tai.decide(\n\t\t\t\t\t`answers a raid of ${raid.intruders.length} at ${where(raid.base.at)} with ${more.length} (strength ${Math.round(got)} to ${Math.round(raid.strength)})`,\n\t\t\t\t\t{ kind: 'defence', goal: DEFEND }\n\t\t\t\t)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif (more.length) squad.add(more, 'sent to meet the raid')\n\t\t\t// a squad that holds the place the raid is at, sent on to where it went next once that is out of its reach\n\t\t\tconst at = squad.current?.data.at as Vec2 | undefined\n\t\t\tif (!at || squad.done !== undefined || distSq(at, target) > radius * radius) squad.defend(point(target), radius)\n\t\t})\n\t\t// the squads whose raid is over: let go of, their units back to the pool for the goal to give up\n\t\tfor (const squad of mine) if (![...matched.values()].includes(squad) && squad.alive) ai.squads.disband(squad, 'its raid is over')\n\t}\n\n\t/**\n\t * The think, once a think: the raids counted base by base (one begins as intruders come to a base that stood clear,\n\t * and is over once it stood clear `quiet` seconds again), and the towers a base raided often enough wants\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\tconst { view } = ai\n\t\tconst options = this.options\n\t\tconst quiet = (options.quiet ?? 15) * ai.session.tickRate\n\t\tconst raids = this.raids()\n\t\tconst kept = this.memory.raids\n\t\tfor (const raid of raids) {\n\t\t\tconst record = (kept[raid.key] ??= { at: point(raid.base.at), count: 0, last: ai.tick, most: 0 })\n\t\t\tif (record.since === undefined) {\n\t\t\t\trecord.count++\n\t\t\t\trecord.since = ai.tick\n\t\t\t\trecord.most = 0\n\t\t\t\tai.decide(\n\t\t\t\t\t`raid ${record.count} on the base at ${where(raid.base.at)}: ${raid.intruders.length} of theirs, strength ${Math.round(raid.strength)}`,\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: 'defence'\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t\t}\n\t\t\trecord.last = ai.tick\n\t\t\trecord.most = Math.max(record.most, raid.strength)\n\t\t}\n\t\tconst bases = new Set(view.bases().map((base) => String(base.centre.id)))\n\t\tfor (const key in kept) {\n\t\t\tconst record = kept[key]\n\t\t\tif (record.since !== undefined && ai.tick - record.last > quiet) delete record.since\n\t\t\t// a base that is no more is forgotten\n\t\t\tif (!bases.has(key)) {\n\t\t\t\tdelete kept[key]\n\t\t\t\tai.plans.build.drop(`defence.tower:${key}`)\n\t\t\t}\n\t\t}\n\t\tthis.towers()\n\t}\n\n\t/** The tower it builds: the one named, or the cheapest of the `tower` role its workers build */\n\ttowerType(): string | undefined {\n\t\tconst { ai } = this\n\t\tconst named = this.options.tower\n\t\tif (named) return ai.registry.units.has(named) ? named : undefined\n\t\tconst { view, registry } = ai\n\t\tconst builds = new Set(view.typesOf('worker').flatMap((def) => def.builds ?? []))\n\t\tconst money = registry.currency ?? registry.resources[0]?.id ?? ''\n\t\tconst towers = view.typesOf('tower').filter((def) => builds.has(def.id))\n\t\treturn [...towers].sort((a, b) => (a.cost?.[money] ?? 0) - (b.cost?.[money] ?? 0))[0]?.id\n\t}\n\n\t/** The towers a base raided often enough wants: a standing want of the build plan, by the base */\n\tprivate towers(): void {\n\t\tconst { ai } = this\n\t\tconst options = this.options\n\t\tconst wanted = options.towers ?? 1\n\t\tconst after = options.towerAfter ?? 2\n\t\tconst type = this.towerType()\n\t\tif (!type || wanted <= 0) return\n\t\tconst { view } = ai\n\t\tfor (const base of view.bases()) {\n\t\t\tconst key = String(base.centre.id)\n\t\t\tconst record = this.memory.raids[key]\n\t\t\tconst id = `defence.tower:${key}`\n\t\t\tif (!record || record.count < after) continue\n\t\t\tconst at = point(base.at)\n\t\t\tif (!ai.plans.build.get(id))\n\t\t\t\tai.decide(`wants ${wanted === 1 ? 'a tower' : `${wanted} towers`} at the base at ${where(at)}: raided ${record.count} times`, {\n\t\t\t\t\tkind: 'defence'\n\t\t\t\t})\n\t\t\tai.plans.build.want({\n\t\t\t\tid,\n\t\t\t\ttype,\n\t\t\t\t// the towers elsewhere, and so many here\n\t\t\t\tcount: (brain) => {\n\t\t\t\t\tconst all = brain.view.mine.ofType(type)\n\t\t\t\t\treturn all.length - all.near(at, 14).length + wanted\n\t\t\t\t},\n\t\t\t\tnear: at,\n\t\t\t\twithin: 12,\n\t\t\t\tpriority: 45,\n\t\t\t\tkeep: true,\n\t\t\t\tby: 'defence'\n\t\t\t})\n\t\t}\n\t}\n\n\t/** The defence as the report shows it */\n\treport(): DefenceReport {\n\t\tconst { ai } = this\n\t\tif (!this.enabled) return { raids: [], bases: [], towers: [] }\n\t\tconst squads = ai.squads.of(DEFEND).squads\n\t\treturn {\n\t\t\traids: this.raids().map((raid) => {\n\t\t\t\tconst squad = squads.find((each) => {\n\t\t\t\t\tconst at = each.current?.data.at as Vec2 | undefined\n\t\t\t\t\treturn !!at && raid.base.buildings.some((building) => distSq(building, at) <= this.radius * this.radius * 4)\n\t\t\t\t})\n\t\t\t\tconst record = this.memory.raids[raid.key]\n\t\t\t\treturn {\n\t\t\t\t\tat: pair(raid.base.at),\n\t\t\t\t\tintruders: raid.intruders.map((unit) => unit.id),\n\t\t\t\t\tstrength: Math.round(raid.strength),\n\t\t\t\t\t...(squad && { squad: squad.name }),\n\t\t\t\t\tdefenders: squad?.length ?? 0,\n\t\t\t\t\tsince: record?.since ?? ai.tick,\n\t\t\t\t\tcount: record?.count ?? 1\n\t\t\t\t}\n\t\t\t}),\n\t\t\tbases: Object.values(this.memory.raids).map((record) => ({ at: pair(record.at), raids: record.count, last: record.last })),\n\t\t\ttowers: ai.plans.build\n\t\t\t\t.list()\n\t\t\t\t.filter((want) => want.id?.startsWith('defence.tower:'))\n\t\t\t\t.map((want) => ({ at: pair(want.near as Vec2), want: want.id!, status: ai.plans.build.status(want.id!) ?? '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 this.enabled\n\t}\n\n\t/** Its part of the brain's report */\n\treportTo(report: AiReport): void {\n\t\treport.defence = this.report()\n\t}\n\n\t/** Gives a copy of the defence's memory, for a save of the brain */\n\tsave(): DefenceMemory {\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 DefenceMemory | undefined\n\t\tif (!given || typeof given !== 'object' || given.v !== 1) return false\n\t\tthis.memory = { v: 1, raids: structuredClone(given.raids ?? {}) }\n\t\treturn true\n\t}\n}\n\n/**\n * The defence module: the raids on the bases counted each think, the towers a raided base wants (`ai.defence.think`),\n * and the `defend` goal put on the brain's picker, which answers each raid with a squad of its own. With how it defends\n * where the brain's definition and the seat's options say nothing (`DefenceOptions`)\n *\n * @beta\n */\nexport const defence = (options: DefenceOptions = {}): AiModuleDef =>\n\tdefineModule({ id: 'defence', make: (ai: Brain): AiModule => {\n\t\tai.area(Defence).configure(options)\n\t\treturn {\n\t\t\tid: 'defence',\n\t\t\t// before the goals are picked: the raids are counted as the goal reads them\n\t\t\tphase: 'sense',\n\t\t\tthink: () => ai.area(Defence).think()\n\t\t}\n\t} })\n\ndeclare module './area' {\n\tinterface AreaMemories {\n\t\tdefence?: DefenceMemory\n\t}\n}\n"],"mappings":";;;;;;AAoCA,IAAM,aAAa;;;;;;AA+EnB,IAAa,SAAS;;AAEtB,IAAM,QAAQ;AACd,IAAM,aAAa,MAAe,MAAM,IAAI,QAAQ,GAAG,MAAM,GAAG,IAAI;;;;;;;;AASpE,IAAa,UAAb,MAAa,QAA0B;CAsB5B;;CApBV,OAAgB,KAAK;;CAErB,OAAO,KAAK,IAAoB;EAC/B,OAAO,IAAI,QAAQ,EAAE;CACtB;;CAEA,KAAc;;CAEd,SAAkB;;CAGlB,UAAU;CACV,SAAgC;EAAE,GAAG;EAAG,OAAO,CAAC;CAAE;CAClD,gBAAwC,CAAC;CACzC,YAAoB;;CAEpB;CAEA,YAEC,IACC;EADQ,KAAA,KAAA;EAET,KAAK,OAAO,KAAK,SAAS;CAC3B;;CAGA,UAAU,SAA+B;EACxC,KAAK,gBAAgB;EACrB,IAAI,CAAC,KAAK,SAAS,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI;EAC9C,KAAK,UAAU;CAChB;;CAGA,IAAI,UAA0B;EAC7B,OAAO,KAAK,GAAG,MAAM,0BAA0B;GAAE,GAAG,KAAK;GAAe,GAAG,KAAK,GAAG,SAAS;EAAQ,EAAE;CACvG;;CAGA,IAAI,SAAiB;EACpB,OAAO,KAAK,QAAQ,UAAU;CAC/B;;CAGA,IAAI,SAAiB;EACpB,MAAM,OAAO,KAAK,IAAI,KAAM,KAAK,IAAI,KAAM,KAAK,QAAQ,QAAQ,IAAI,CAAC,CAAC;EACtE,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK;CACnC;;CAGA,YAAqB;EACpB,MAAM,EAAE,OAAO;EACf,OAAO,GAAG,MAAM,2BAA2B;GAC1C,MAAM,EAAE,SAAS;GACjB,MAAM,YAAY,KAAK,KAAK,UAAU;GACtC,MAAM,QAAQ,KAAK,SAAS,KAAK;GACjC,OAAO,KAAK,QACV,MAAM,CAAC,CACP,MAAM,CAAC,CACP,OAAO,UAAU,UAAU,MAAM,aAAa,OAAO,UAAU,KAAK,IAAI,KAAK,CAAC;EACjF,CAAC;CACF;;CAGA,QAAgB;EACf,MAAM,EAAE,OAAO;EACf,OAAO,GAAG,MAAM,uBAAuB;GACtC,MAAM,EAAE,SAAS;GACjB,MAAM,YAAY,KAAK,UAAU;GACjC,IAAI,CAAC,UAAU,QAAQ,OAAO,CAAC;GAC/B,MAAM,QAAQ,KAAK,MAAM;GACzB,MAAM,qBAAK,IAAI,IAAyB;GACxC,KAAK,MAAM,SAAS,WAAW;IAC9B,IAAI;IACJ,IAAI,eAAe;IACnB,KAAK,MAAM,QAAQ,OAClB,KAAK,MAAM,YAAY,KAAK,WAAW;KACtC,MAAM,IAAI,OAAO,UAAU,KAAK;KAChC,IAAI,IAAI,cAAc;MACrB,eAAe;MACf,OAAO;KACR;IACD;IAED,IAAI,MAAM,CAAC,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAA,CAAI,KAAK,KAAK;GACnE;GACA,MAAM,QAAgB,CAAC;GACvB,KAAK,MAAM,CAAC,MAAM,YAAY,IAAI;IACjC,MAAM,MAAM,UAAU,OAAO,WAAW,QAAQ,SAAS,MAAM,CAAC;IAChE,MAAM,KAAK;KAAE;KAAM,KAAK,OAAO,KAAK,OAAO,EAAE;KAAG,WAAW;KAAK,UAAU,IAAI,SAAS;IAAE,CAAC;GAC3F;GACA,OAAO,MAAM,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,OAAO,KAAK,EAAE,KAAK,OAAO,EAAE;EAC3F,CAAC;CACF;;CAGA,KAAa,OAAyB;EACrC,OAAO,MAAM,SAAS,CAAC,CAAC,OAAO,WAAW,OAAO,KAAK,UAAU,SAAS;CAC1E;;;;;CAMA,SAAyB;EACxB,MAAM,EAAE,OAAO;EACf,OAAO,GAAG,MAAM,sBAAsB;GACrC,MAAM,EAAE,UAAU;GAClB,OAAO,KAAK,KAAK,GAAG,KAAK,KAAK,OAAO,SAAS,CAAC,MAAM,OAAO,KAAK,EAAE,KAAK,MAAM,OAAO,KAAK,EAAE,MAAA,QAAY,CAAC,CAAC,CAAC,SAAS;EACrH,CAAC;CACF;;CAGA,YAA6B;EAC5B,IAAI,KAAK,QAAQ,WAAW,OAAO,OAAO;EAC1C,MAAM,YAAY,KAAK,MAAM,CAAC,CAAC;EAC/B,OAAO,CAAC,CAAC,aAAa,UAAU,WAAW,KAAK,SAAS,KAAK,OAAO;CACtE;;CAGA,WAA4B;EAC3B,OAAO,WAAW;GACjB,IAAI;GACJ,gBAAgB,CACf,SAAS,mCAAmC,KAAK,UAAU,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC,GAGlF,SACC,kCACM,KAAK,UAAU,CAAC,CAAC,SAAS,IAAI,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS,CAAC,GAC1F,MAAM,QAAQ,MAAM,aAAc,KAAkB,KAAK,IAAI,GAAG,CAAC,CAAC,CACnE,CACD;GAEA,cAAc,KAAK,UAAU;GAC7B,QAAQ,EAAE,QAAQ,KAAK,cAAc,KAAK,MAAM,SAAS,EAAE;GAC3D,YAAY;GACZ,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ,KAAK;EACjD,CAAC;CACF;;;;;;CAOA,MAAc,WAAmC;EAChD,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,SAAwB,CAAC;EAC/B,MAAM,wBAAQ,IAAI,IAAY;EAC9B,MAAM,WAAW,KAAK,KAAK,SAAS;EACpC,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG;GAChC,MAAM,SAAS,KAAK,UAAU,MAAM;GACpC,MAAM,OAAO,KAAK,WAAW,KAAK;GAClC,IAAI,MAAM;GACV,MAAM,OAAO,SAAS,MAAM,QAAQ,SAAS,CAAC,MAAM,IAAI,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,KAAK,EAAE,CAAC;GAC7F,KAAK,MAAM,GAAG,MAAM,OAAO,GAAG,MAAM,IAAI,OAAO,GAAG,MAAM,KAAK,EAAE,KAAK,EAAE,EAAE;GACxE,KAAK,MAAM,QAAQ,MAAM;IACxB,IAAI,OAAO,QAAQ,OAAO,QAAQ;IAClC,OAAO,KAAK,IAAI;IAChB,MAAM,IAAI,KAAK,EAAE;IACjB,OAAO,KAAK,SAAS,GAAG,IAAI;GAC7B;GACA,IAAI,OAAO,MAAM;GAEjB,MAAM,yBAAS,IAAI,IAAsC;GACzD,KAAK,MAAM,QAAQ,UAAU;IAC5B,IAAI,MAAM,IAAI,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,KAAK,EAAE,GAAG;IACrD,MAAM,QAAQ,GAAG,OAAO,QAAQ,IAAI;IACnC,CAAC,OAAO,IAAI,KAAK,KAAK,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAA,CAAI,KAAK,IAAI;GACpE;GACA,MAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,OAAO,EAAE,IAAI,MAAM,IAAI,OAAO,EAAE,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;GACnH,KAAK,MAAM,SAAS,QAAQ;IAC3B,IAAI,OAAO,MAAM;IACjB,KAAK,MAAM,QAAQ,OAAO;KACzB,OAAO,KAAK,IAAI;KAChB,MAAM,IAAI,KAAK,EAAE;KACjB,OAAO,KAAK,SAAS,GAAG,IAAI;IAC7B;GACD;EACD;EACA,OAAO;CACR;;;;;;;CAQA,OAAe,MAAqB;EACnC,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,SAAS;EACjB,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,KAAK;EAEpB,MAAM,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC,OAAO,QAAQ,UAAU,MAAM,SAAS,SAAS,MAAM,KAAK,WAAW,GAAG,MAAM,EAAE,CAAC;EACrH,MAAM,0BAAU,IAAI,IAAiB;EACrC,KAAK,MAAM,SAAS,MAAM;GACzB,MAAM,KAAK,MAAM,SAAS,KAAK;GAC/B,MAAM,OACL,MAAM,MAAM,MAAM,SAAS,CAAC,QAAQ,IAAI,IAAI,KAAK,KAAK,KAAK,UAAU,MAAM,aAAa,OAAO,UAAU,EAAE,KAAK,SAAS,SAAS,CAAC,CAAC;GACrI,IAAI,MAAM,QAAQ,IAAI,MAAM,KAAK;EAClC;EACA,MAAM,WAAW,IAAI,IAAI,KAAK,QAAQ,UAAU,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,SAAS,UAAU,MAAM,KAAK,KAAK,CAAC;EAC3H,MAAM,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,OAAO,SAAS,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;EACpE,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,SAAS,MAAM,MAAM;GAC1B,MAAM,SAAS,KAAK,UAAU,QAAQ,QAAQ,IAAI,IAAI,CAAC,EAAE,OAAO,KAAK,KAAK,KAAK,EAAE;GACjF,IAAI,QAAQ,QAAQ,IAAI,IAAI;GAC5B,IAAI,MAAM,QAAQ,MAAM,SAAS,IAAI;GACrC,MAAM,OAAO,KAAK,WAAW;GAC7B,MAAM,OAAiB,CAAC;GACxB,MAAM,OAAO,UAAiC;IAC7C,KAAK,MAAM,QAAQ,OAAO;KACzB,IAAI,OAAO,SAAS,OAAO,UAAU,KAAK,SAAS;KACnD,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,SAAS,IAAI,KAAK,EAAE,GAAG;KAChD,KAAK,IAAI,KAAK,EAAE;KAChB,KAAK,KAAK,KAAK,EAAE;KACjB,OAAO,KAAK,SAAS,GAAG,IAAI;IAC7B;GACD;GACA,MAAM,cAAc,UAAkC,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,OAAO,GAAG,MAAM,IAAI,OAAO,GAAG,MAAM,KAAK,EAAE,KAAK,EAAE,EAAE;GACpI,IAAI,WAAW,MAAM,KAAK,CAAC;GAC3B,IAAI,MAAM,MAAM,IAAI,WAAW,KAAK,KAAK,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;GACxE,IAAI,MAAM,QAAQ,QAAQ;IAEzB,MAAM,SAAS,GAAG,OAChB,IAAI,CAAC,CACL,OAAO,QAAQ,SAAS,KAAK,UAAA,YAAoB,GAAG,MAAM,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,CAAC,CACzF,MAAM,GAAG,MAAM,OAAO,EAAE,OAAO,KAAK,QAAQ,MAAM,IAAI,OAAO,EAAE,OAAO,KAAK,QAAQ,MAAM,CAAC;IAC5F,KAAK,MAAM,SAAS,QAAQ;KAC3B,IAAI,OAAO,MAAM;KAEjB,MAAM,MAAM,MAAM,KAAK,MAAM,QAAQ,OAAO,GAAG,MAAM,OAAO,EAAE,MAAA,YAAgB,CAAC,KAAK,IAAI,EAAE,CAAC;KAC3F,IAAI,CAAC,IAAI,QAAQ;KAGjB,MAAM,SAAS,KAAK;KAEpB,IAAI,KAAK,KAAK,KAAK,KAAK,OAAO,SAAS,IAAI,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK;KACrE,MAAM,SAAS,KAAK,MAAM,MAAM;KAChC,IAAI,CAAC,OAAO,QAAQ;KACpB,GAAG,MAAM,KAAK,QAAQ,QAAQ;KAC9B,GAAG,OACF,SAAS,OAAO,WAAW,IAAI,SAAS,MAAM,OAAO,GAAG,OAAO,OAAO,MAAM,MAAM,OAAO,0BAA0B,KAAK,UAAU,OAAO,MAAM,MAAM,KAAK,KAAK,EAAE,KACjK;MACC,MAAM;MACN,MAAM;KACP,CACD;IACD;GACD;GACA,IAAI,CAAC,OAAO;IACX,IAAI,CAAC,KAAK,QAAQ;IAClB,QAAQ,GAAG,OAAO,KAAK,UAAU,CAAC,GAAG,MAAM;KAAE,WAAW;KAAO,OAAO;IAAO,CAAC;IAC9E,MAAM,OAAO,MAAM,MAAM,GAAG,MAAM;IAClC,GAAG,OACF,qBAAqB,KAAK,UAAU,OAAO,MAAM,MAAM,KAAK,KAAK,EAAE,EAAE,QAAQ,KAAK,OAAO,aAAa,KAAK,MAAM,GAAG,EAAE,MAAM,KAAK,MAAM,KAAK,QAAQ,EAAE,IACtJ;KAAE,MAAM;KAAW,MAAM;IAAO,CACjC;IACA;GACD;GACA,IAAI,KAAK,QAAQ,MAAM,IAAI,MAAM,uBAAuB;GAExD,MAAM,KAAK,MAAM,SAAS,KAAK;GAC/B,IAAI,CAAC,MAAM,MAAM,SAAS,KAAA,KAAa,OAAO,IAAI,MAAM,IAAI,SAAS,QAAQ,MAAM,OAAO,MAAM,MAAM,GAAG,MAAM;EAChH,CAAC;EAED,KAAK,MAAM,SAAS,MAAM,IAAI,CAAC,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,SAAS,KAAK,KAAK,MAAM,OAAO,GAAG,OAAO,QAAQ,OAAO,kBAAkB;CACjI;;;;;CAMA,QAAc;EACb,MAAM,EAAE,OAAO;EACf,IAAI,KAAK,cAAc,GAAG,MAAM;EAChC,KAAK,YAAY,GAAG;EACpB,MAAM,EAAE,SAAS;EAEjB,MAAM,SADU,KAAK,QACE,SAAS,MAAM,GAAG,QAAQ;EACjD,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,OAAO,KAAK,OAAO;EACzB,KAAK,MAAM,QAAQ,OAAO;GACzB,MAAM,SAAU,KAAK,KAAK,SAAS;IAAE,IAAI,MAAM,KAAK,KAAK,EAAE;IAAG,OAAO;IAAG,MAAM,GAAG;IAAM,MAAM;GAAE;GAC/F,IAAI,OAAO,UAAU,KAAA,GAAW;IAC/B,OAAO;IACP,OAAO,QAAQ,GAAG;IAClB,OAAO,OAAO;IACd,GAAG,OACF,QAAQ,OAAO,MAAM,kBAAkB,MAAM,KAAK,KAAK,EAAE,EAAE,IAAI,KAAK,UAAU,OAAO,uBAAuB,KAAK,MAAM,KAAK,QAAQ,KACpI,EACC,MAAM,UACP,CACD;GACD;GACA,OAAO,OAAO,GAAG;GACjB,OAAO,OAAO,KAAK,IAAI,OAAO,MAAM,KAAK,QAAQ;EAClD;EACA,MAAM,QAAQ,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK,SAAS,OAAO,KAAK,OAAO,EAAE,CAAC,CAAC;EACxE,KAAK,MAAM,OAAO,MAAM;GACvB,MAAM,SAAS,KAAK;GACpB,IAAI,OAAO,UAAU,KAAA,KAAa,GAAG,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO;GAE/E,IAAI,CAAC,MAAM,IAAI,GAAG,GAAG;IACpB,OAAO,KAAK;IACZ,GAAG,MAAM,MAAM,KAAK,iBAAiB,KAAK;GAC3C;EACD;EACA,KAAK,OAAO;CACb;;CAGA,YAAgC;EAC/B,MAAM,EAAE,OAAO;EACf,MAAM,QAAQ,KAAK,QAAQ;EAC3B,IAAI,OAAO,OAAO,GAAG,SAAS,MAAM,IAAI,KAAK,IAAI,QAAQ,KAAA;EACzD,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,SAAS,IAAI,IAAI,KAAK,QAAQ,QAAQ,CAAC,CAAC,SAAS,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC;EAChF,MAAM,QAAQ,SAAS,YAAY,SAAS,UAAU,EAAE,EAAE,MAAM;EAEhE,OAAO,CAAC,GADO,KAAK,QAAQ,OAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO,IAAI,IAAI,EAAE,CAC3D,CAAM,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,OAAO,UAAU,MAAM,EAAE,OAAO,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;CACxF;;CAGA,SAAuB;EACtB,MAAM,EAAE,OAAO;EACf,MAAM,UAAU,KAAK;EACrB,MAAM,SAAS,QAAQ,UAAU;EACjC,MAAM,QAAQ,QAAQ,cAAc;EACpC,MAAM,OAAO,KAAK,UAAU;EAC5B,IAAI,CAAC,QAAQ,UAAU,GAAG;EAC1B,MAAM,EAAE,SAAS;EACjB,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG;GAChC,MAAM,MAAM,OAAO,KAAK,OAAO,EAAE;GACjC,MAAM,SAAS,KAAK,OAAO,MAAM;GACjC,MAAM,KAAK,iBAAiB;GAC5B,IAAI,CAAC,UAAU,OAAO,QAAQ,OAAO;GACrC,MAAM,KAAK,MAAM,KAAK,EAAE;GACxB,IAAI,CAAC,GAAG,MAAM,MAAM,IAAI,EAAE,GACzB,GAAG,OAAO,SAAS,WAAW,IAAI,YAAY,GAAG,OAAO,SAAS,kBAAkB,MAAM,EAAE,EAAE,WAAW,OAAO,MAAM,SAAS,EAC7H,MAAM,UACP,CAAC;GACF,GAAG,MAAM,MAAM,KAAK;IACnB;IACA;IAEA,QAAQ,UAAU;KACjB,MAAM,MAAM,MAAM,KAAK,KAAK,OAAO,IAAI;KACvC,OAAO,IAAI,SAAS,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,SAAS;IAC/C;IACA,MAAM;IACN,QAAQ;IACR,UAAU;IACV,MAAM;IACN,IAAI;GACL,CAAC;EACF;CACD;;CAGA,SAAwB;EACvB,MAAM,EAAE,OAAO;EACf,IAAI,CAAC,KAAK,SAAS,OAAO;GAAE,OAAO,CAAC;GAAG,OAAO,CAAC;GAAG,QAAQ,CAAC;EAAE;EAC7D,MAAM,SAAS,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC;EACpC,OAAO;GACN,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK,SAAS;IACjC,MAAM,QAAQ,OAAO,MAAM,SAAS;KACnC,MAAM,KAAK,KAAK,SAAS,KAAK;KAC9B,OAAO,CAAC,CAAC,MAAM,KAAK,KAAK,UAAU,MAAM,aAAa,OAAO,UAAU,EAAE,KAAK,KAAK,SAAS,KAAK,SAAS,CAAC;IAC5G,CAAC;IACD,MAAM,SAAS,KAAK,OAAO,MAAM,KAAK;IACtC,OAAO;KACN,IAAI,KAAK,KAAK,KAAK,EAAE;KACrB,WAAW,KAAK,UAAU,KAAK,SAAS,KAAK,EAAE;KAC/C,UAAU,KAAK,MAAM,KAAK,QAAQ;KAClC,GAAI,SAAS,EAAE,OAAO,MAAM,KAAK;KACjC,WAAW,OAAO,UAAU;KAC5B,OAAO,QAAQ,SAAS,GAAG;KAC3B,OAAO,QAAQ,SAAS;IACzB;GACD,CAAC;GACD,OAAO,OAAO,OAAO,KAAK,OAAO,KAAK,CAAC,CAAC,KAAK,YAAY;IAAE,IAAI,KAAK,OAAO,EAAE;IAAG,OAAO,OAAO;IAAO,MAAM,OAAO;GAAK,EAAE;GACzH,QAAQ,GAAG,MAAM,MACf,KAAK,CAAC,CACN,QAAQ,SAAS,KAAK,IAAI,WAAW,gBAAgB,CAAC,CAAC,CACvD,KAAK,UAAU;IAAE,IAAI,KAAK,KAAK,IAAY;IAAG,MAAM,KAAK;IAAK,QAAQ,GAAG,MAAM,MAAM,OAAO,KAAK,EAAG,KAAK;GAAM,EAAE;EACpH;CACD;;;CAIA,YAAqB;EACpB,OAAO,KAAK;CACb;;CAGA,SAAS,QAAwB;EAChC,OAAO,UAAU,KAAK,OAAO;CAC9B;;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;GAAE,GAAG;GAAG,OAAO,gBAAgB,MAAM,SAAS,CAAC,CAAC;EAAE;EAChE,OAAO;CACR;AACD;;;;;;;;AASA,IAAa,WAAW,UAA0B,CAAC,MAClD,aAAa;CAAE,IAAI;CAAW,OAAO,OAAwB;EAC5D,GAAG,KAAK,OAAO,CAAC,CAAC,UAAU,OAAO;EAClC,OAAO;GACN,IAAI;GAEJ,OAAO;GACP,aAAa,GAAG,KAAK,OAAO,CAAC,CAAC,MAAM;EACrC;CACD;AAAE,CAAC"}

package/dist/ai/define.d.ts

@@ -9,13 +9,14 @@ import type { BrainDef, BrainExtension } from './brain';
  * @beta
  */
 export interface DefinedBrain extends BrainDef {
+    /** Gives a brain of this one with the extension laid over it: its modules, settings and plans added to or replaced */
     with(more: BrainExtension): DefinedBrain;
 }
 /**
  * Defines a brain: what a computer player is made of, to seat at a world (`world.computers.seat(player, { ...options, brain })`,
- * `world.computers.seat`) and to list in `GameModule.brains`, for a save to find it by its id. Modules that keep state
+ * `world.computers.seat`) and to list in `Rules.brains`, for a save to find it by its id. Modules that keep state
  * are given as functions of the brain, as systems are of the world
  *
- * @beta
+ * @public
  */
 export declare function defineBrain(def: BrainDef): DefinedBrain;

package/dist/ai/define.js

@@ -0,0 +1,31 @@
+import { resolveSettings } from "./settings.js";
+import { createBrainSystem, mapAiOptions } from "./computer.js";
+//#region src/ai/define.ts
+/**
+* Defines a brain: what a computer player is made of, to seat at a world (`world.computers.seat(player, { ...options, brain })`,
+* `world.computers.seat`) and to list in `Rules.brains`, for a save to find it by its id. Modules that keep state
+* are given as functions of the brain, as systems are of the world
+*
+* @public
+*/
+function defineBrain(def) {
+	if (!def.id) throw new Error("A brain needs an id");
+	if (!Array.isArray(def.modules)) throw new Error(`The brain "${def.id}" needs its modules, as a list`);
+	const brain = { ...def };
+	brain.with = (more) => defineBrain({
+		...def,
+		...more,
+		seat: more.seat,
+		modules: [...def.modules, ...more.modules ?? []],
+		goals: [...def.goals ?? [], ...more.goals ?? []],
+		...(def.settings || more.settings) && { settings: resolveSettings([def.settings, more.settings]) },
+		...(def.rules || more.rules) && { rules: [...def.rules ?? [], ...more.rules ?? []] },
+		...(def.without || more.without) && { without: [...def.without ?? [], ...more.without ?? []] }
+	});
+	brain.seat ??= (world, player, options) => createBrainSystem(world, player, brain, mapAiOptions(world, player, options));
+	return brain;
+}
+//#endregion
+export { defineBrain };
+
+//# sourceMappingURL=define.js.map

package/dist/ai/define.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"define.js","names":[],"sources":["../../src/ai/define.ts"],"sourcesContent":["/**\n * A brain defined (`defineBrain`): checked, given its `with` for variants, and its seat (`BrainDef.seat`), which is the\n * kit's (`createBrainSystem`). Apart from the brain itself (`brain.ts`), which the seat is made of\n */\nimport type { BrainDef, BrainExtension } from './brain'\nimport { createBrainSystem, mapAiOptions } from './computer'\nimport { resolveSettings } from './settings'\n\n/**\n * A brain as `defineBrain` gives it: with its `with`, for variants of it\n *\n * @beta\n */\nexport interface DefinedBrain extends BrainDef {\n\t/** Gives a brain of this one with the extension laid over it: its modules, settings and plans added to or replaced */\n\twith(more: BrainExtension): DefinedBrain\n}\n\n/**\n * Defines a brain: what a computer player is made of, to seat at a world (`world.computers.seat(player, { ...options, brain })`,\n * `world.computers.seat`) and to list in `Rules.brains`, for a save to find it by its id. Modules that keep state\n * are given as functions of the brain, as systems are of the world\n *\n * @public\n */\nexport function defineBrain(def: BrainDef): DefinedBrain {\n\tif (!def.id) throw new Error('A brain needs an id')\n\tif (!Array.isArray(def.modules)) throw new Error(`The brain \"${def.id}\" needs its modules, as a list`)\n\t// a brain of its own: what it was given is left as it is (AI4: a frozen literal would have thrown)\n\tconst brain = { ...def } as DefinedBrain\n\tbrain.with = (more) =>\n\t\tdefineBrain({\n\t\t\t...def,\n\t\t\t...more,\n\t\t\t// its own seat, of the variant: not the one it was made from\n\t\t\tseat: more.seat,\n\t\t\tmodules: [...def.modules, ...(more.modules ?? [])],\n\t\t\tgoals: [...(def.goals ?? []), ...(more.goals ?? [])],\n\t\t\t...((def.settings || more.settings) && { settings: resolveSettings([def.settings, more.settings]) }),\n\t\t\t...((def.rules || more.rules) && { rules: [...(def.rules ?? []), ...(more.rules ?? [])] }),\n\t\t\t...((def.without || more.without) && { without: [...(def.without ?? []), ...(more.without ?? [])] })\n\t\t})\n\t// seated as the kit seats a brain, so that the core does not have to know how (`world.computers.seat`)\n\tbrain.seat ??= (world, player, options) => createBrainSystem(world, player, brain, mapAiOptions(world, player, options))\n\treturn brain\n}\n"],"mappings":";;;;;;;;;;AAyBA,SAAgB,YAAY,KAA6B;CACxD,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,MAAM,qBAAqB;CAClD,IAAI,CAAC,MAAM,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAI,MAAM,cAAc,IAAI,GAAG,+BAA+B;CAErG,MAAM,QAAQ,EAAE,GAAG,IAAI;CACvB,MAAM,QAAQ,SACb,YAAY;EACX,GAAG;EACH,GAAG;EAEH,MAAM,KAAK;EACX,SAAS,CAAC,GAAG,IAAI,SAAS,GAAI,KAAK,WAAW,CAAC,CAAE;EACjD,OAAO,CAAC,GAAI,IAAI,SAAS,CAAC,GAAI,GAAI,KAAK,SAAS,CAAC,CAAE;EACnD,IAAK,IAAI,YAAY,KAAK,aAAa,EAAE,UAAU,gBAAgB,CAAC,IAAI,UAAU,KAAK,QAAQ,CAAC,EAAE;EAClG,IAAK,IAAI,SAAS,KAAK,UAAU,EAAE,OAAO,CAAC,GAAI,IAAI,SAAS,CAAC,GAAI,GAAI,KAAK,SAAS,CAAC,CAAE,EAAE;EACxF,IAAK,IAAI,WAAW,KAAK,YAAY,EAAE,SAAS,CAAC,GAAI,IAAI,WAAW,CAAC,GAAI,GAAI,KAAK,WAAW,CAAC,CAAE,EAAE;CACnG,CAAC;CAEF,MAAM,UAAU,OAAO,QAAQ,YAAY,kBAAkB,OAAO,QAAQ,OAAO,aAAa,OAAO,QAAQ,OAAO,CAAC;CACvH,OAAO;AACR"}

package/dist/ai/economy.d.ts

@@ -1,4 +1,4 @@
-import { type ResourceKind } from '#engine/defs';
+import { type ResourceId } from '#engine/defs';
 import { type Vec2 } from '#engine/math';
 import type { EntityState } from '#engine/session/protocol';
 import { type Brain } from './brain';
@@ -11,7 +11,7 @@ import type { Base } from './view';
  *
  * @beta
  */
-export type WorkersPer = Partial<Record<ResourceKind, number>> | ((ai: Brain, base: Base, index: number) => Partial<Record<ResourceKind, number>>);
+export type WorkersPer = Partial<Record<ResourceId, number>> | ((ai: Brain, base: Base, index: number) => Partial<Record<ResourceId, number>>);
 /**
  * How a brain runs its economy (`BrainDef.economy`, the seat's `AiOptions.economy` over it, the `economy()` module's
  * own under both). Every field has a data form a save keeps; the function forms are the brain's to give again
@@ -53,6 +53,7 @@ export interface EconomyOptions {
  * @beta
  */
 export interface EconomyMemory {
+    /** The version of the memory's format: 1 so far */
     v: 1;
     /** Each worker that fled, by id: the base it fled (its middle), where to, since when, and since when its base stood clear */
     fled: Record<string, {
@@ -83,13 +84,13 @@ export interface EconomyBase {
     /** The view's base */
     base: Base;
     /** 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 */
-    deposits: Partial<Record<ResourceKind, EntityState[]>>;
+    deposits: Partial<Record<ResourceId, EntityState[]>>;
     /** How many workers its deposits of each resource serve at once */
-    serves: Partial<Record<ResourceKind, number>>;
+    serves: Partial<Record<ResourceId, number>>;
     /** How many it wants on each resource: what it is to have, no more than what is served where it saturates */
-    wants: Partial<Record<ResourceKind, number>>;
+    wants: Partial<Record<ResourceId, number>>;
     /** The workers at work on each resource at it, by id */
-    working: Partial<Record<ResourceKind, number[]>>;
+    working: Partial<Record<ResourceId, number[]>>;
 }
 /**
  * The economy as the report shows it (`AiReport.economy.bases`, `fled`): each base with what it wants and has, the
@@ -98,11 +99,13 @@ export interface EconomyBase {
  * @beta
  */
 export interface EconomyReport {
+    /** The bases, each with where it is, its hall's entity id and per resource the workers working, wanted and served by it */
     bases: {
         at: [number, number];
         hall: number;
-        workers: Record<ResourceKind, [working: number, wants: number, serves: number]>;
+        workers: Record<ResourceId, [working: number, wants: number, serves: number]>;
     }[];
+    /** The workers that fled a raid, each with the unit's id, the place it fled and the tick it fled at */
     fled: {
         unit: number;
         from: [number, number];