@v12-engine/engine 0.1.1 → 0.4.0

package/dist/ai/scouting.js

@@ -0,0 +1,324 @@
+import { distSq } from "../math.js";
+import { baseStats } from "../defs.js";
+import { heroOfState } from "../hero.js";
+import { defineModule } from "./module.js";
+import { consider, curve, defineGoal } from "./goals.js";
+import { pair, point, where } from "./geometry.js";
+//#region src/ai/scouting.ts
+/** How many places one round takes a scout to at most: the rest wait for the next */
+var ROUND = 4;
+/**
+* The id of the scouting's goal
+*
+* @beta
+*/
+var SCOUT = "scout";
+/**
+* A brain's scouting (`ai.scouting`): its plan of looks (`looks`), the scout it sends (`scoutFor`), through the `scout`
+* goal the `scouting()` module puts on the picker. Kept in the brain's memory (`BrainMemory.scouting`)
+*
+* @internal
+*/
+var Scouting = class Scouting {
+	ai;
+	/** What finds it on a brain (`ai.area(Scouting)`): made the first time a module asks for it */
+	static id = "scouting";
+	/** Makes the scouting of a brain; what `ai.area(Scouting)` calls the first time a module asks for it */
+	static make(ai) {
+		return new Scouting(ai);
+	}
+	/** Its id among the brain's areas: what its memory and its report are kept under */
+	id = "scouting";
+	/** What the log says where a save's memory of it is of a shape it does not read */
+	afresh = "the save remembers the computer player’s scouting in a shape this brain does not read: it starts afresh";
+	/** Whether a `scouting()` module is in the brain: without one, nothing here runs, and the goal is not the brain's */
+	enabled = false;
+	memory = {
+		v: 1,
+		rounds: 0
+	};
+	moduleOptions = {};
+	/** The goal it scouts through: added to the brain's picker by the module, unless told not to scout */
+	goal;
+	constructor(ai) {
+		this.ai = ai;
+		this.goal = this.makeGoal();
+	}
+	/** Puts the `scouting()` module's options under the brain's settings, and its goal on the picker */
+	configure(options) {
+		this.moduleOptions = options;
+		if (!this.enabled && this.options.scout !== false) this.ai.goals.add(this.goal);
+		this.enabled = true;
+	}
+	/** How it scouts: the module's options, the brain's settings over them (`ai.settings.scouting`) */
+	get options() {
+		return this.ai.cache("scouting.options", () => ({
+			...this.moduleOptions,
+			...this.ai.settings.scouting
+		}));
+	}
+	/** Seconds a place stays out of sight before it is due again */
+	get lookEvery() {
+		return this.options.lookEvery ?? 90;
+	}
+	/** The scout's unit, while it lives */
+	get scout() {
+		return this.memory.scout;
+	}
+	/**
+	* Their starts it was told of (`AiOptions.enemyBases`) not seen yet: not looked at, and no building of theirs known
+	* near (a creep's hut is no base)
+	*/
+	unseenStarts() {
+		const { ai } = this;
+		const bases = ai.options.enemyBases ?? [];
+		if (!(ai.def.knowledge !== false)) return bases.map(point);
+		const { map, enemy } = ai.knowledge;
+		const rivals = enemy.structures({ gone: true });
+		const reach = 196;
+		return bases.filter((base) => map.lastLooked(base) === void 0 && !rivals.some((building) => distSq(building.at, base) < reach)).map(point);
+	}
+	/**
+	* The plan of looks, once a think: their starts not seen (due at once), then their bases as remembered, the mines they
+	* would expand to, where their army was last seen, each due once out of sight `lookEvery` seconds. A game's own
+	* places (`scout` as a function) in place of all of it
+	*/
+	looks() {
+		const { ai } = this;
+		return ai.cache("scouting.looks", () => {
+			const options = this.options;
+			const every = this.lookEvery;
+			const knows = ai.def.knowledge !== false;
+			const lost = this.lostPlaces();
+			const reach = 196;
+			const since = (at) => {
+				const looked = knows ? ai.knowledge.map.sinceLooked(at) : Infinity;
+				let losing = Infinity;
+				for (const each of lost) if (distSq(each.at, at) < reach) losing = Math.min(losing, (ai.tick - each.tick) / ai.session.tickRate);
+				return Math.min(looked, losing);
+			};
+			const look = (at, kind) => {
+				const ago = since(at);
+				return {
+					at: point(at),
+					kind,
+					since: ago,
+					due: ago >= every
+				};
+			};
+			if (typeof options.scout === "function") return options.scout(ai).map((at) => look(at, "game"));
+			const starts = this.unseenStarts();
+			const looks = starts.map((at) => ({
+				at,
+				kind: "start",
+				since: Infinity,
+				due: true
+			}));
+			if (!knows) return looks;
+			const { enemy } = ai.knowledge;
+			const theirs = enemy.bases().filter((base) => !base.gone);
+			for (const base of theirs) looks.push(look(base.at, "base"));
+			const told = ai.options.enemyBases ?? [];
+			for (const at of told) if (!starts.some((each) => each.x === at.x && each.z === at.z) && !theirs.some((base) => distSq(base.at, at) < 196)) looks.push(look(at, "base"));
+			if (options.expansions ?? true) {
+				const mine = ai.view.bases();
+				const near = (at, of) => of.reduce((best, each) => Math.min(best, distSq(each, at)), Infinity);
+				const centres = [...theirs.map((base) => base.at), ...told];
+				const candidates = ai.view.mines().filter((each) => {
+					if (theirs.some((base) => distSq(base.at, each) < 196)) return false;
+					const toThem = near(each, centres);
+					return toThem < 3600 && toThem < near(each, mine.map((base) => base.at));
+				}).sort((a, b) => near(a, centres) - near(b, centres) || a.id - b.id);
+				for (const each of candidates.slice(0, 3)) looks.push(look(each, "expansion"));
+			}
+			if (options.army ?? true) {
+				const army = enemy.armySeen()[0];
+				if (army) looks.push(look(army.at, "army"));
+			}
+			return looks;
+		});
+	}
+	/**
+	* The places scouts were lost on the way to, these `lookEvery` seconds: the round of a scout that died before it was
+	* over taken in, once, as it is found gone
+	*/
+	lostPlaces() {
+		const { ai } = this;
+		const memory = this.memory;
+		if (memory.round && memory.scout !== void 0 && !ai.view.mine.has(memory.scout)) {
+			const lost = memory.lost ??= [];
+			for (const at of memory.round) lost.push({
+				at: point(at),
+				tick: ai.tick
+			});
+			ai.decide(`lost its scout on the way to ${memory.round.map(where).join(", ")}: not sent there again for ${this.lookEvery} s`, {
+				kind: "scout",
+				goal: SCOUT
+			});
+			delete memory.round;
+			delete memory.scout;
+		} else if (memory.round && !this.out()) delete memory.round;
+		const every = this.lookEvery * ai.session.tickRate;
+		if (memory.lost?.some((each) => ai.tick - each.tick >= every)) memory.lost = memory.lost.filter((each) => ai.tick - each.tick < every);
+		return memory.lost ?? [];
+	}
+	/** The looks due now, nearest a place first, each after the one before: the round a scout is sent on */
+	round(from) {
+		const due = this.looks().filter((each) => each.due);
+		const starts = due.filter((each) => each.kind === "start").map((each) => each.at);
+		if (starts.length) return starts.slice(0, 1);
+		const rest = due.map((each) => each.at);
+		const round = [];
+		let at = from;
+		while (rest.length && round.length < ROUND) {
+			let best = 0;
+			for (let i = 1; i < rest.length; i++) if (distSq(rest[i], at) < distSq(rest[best], at)) best = i;
+			at = rest.splice(best, 1)[0];
+			round.push(at);
+		}
+		return round;
+	}
+	/**
+	* Who goes to look, of what it may have: the scout of the last round, while it is there; else a flying unit with
+	* nothing to do (`flyers`); else the fastest of its fighters with nothing to do that is no hero; else, only to find
+	* a start of theirs not seen yet, a worker. Looking again (their base, an expansion, their army) waits for a fighter:
+	* a worker sent into a base it knows is lost to its towers, and what chases it home comes into its own (AI1)
+	*/
+	scoutFor(available) {
+		const { ai } = this;
+		const kept = available.find((unit) => unit.id === this.memory.scout);
+		if (kept) return kept;
+		const { registry } = ai;
+		const speed = (unit) => baseStats(ai.view.def(unit), registry).moveSpeed;
+		const fastest = (units) => [...units].sort((a, b) => speed(b) - speed(a) || a.id - b.id)[0];
+		const idle = available.fighters().where((unit) => !unit.own?.order && !heroOfState(unit));
+		if (this.options.flyers ?? true) {
+			const flyer = fastest(idle.withRole("air"));
+			if (flyer) return flyer;
+		}
+		const fighter = fastest(idle);
+		if (fighter || !this.unseenStarts().length) return fighter;
+		return fastest(available.workers().where((unit) => !unit.own?.hidden && unit.own?.order !== "build" && unit.own?.order !== "construct"));
+	}
+	/** The goal: worth 0.3 while a look is due, one unit claimed, a squad of one sent on the round */
+	makeGoal() {
+		return defineGoal({
+			id: SCOUT,
+			weight: .3,
+			considerations: [consider("looks due", () => this.out() ? 1 : this.looks().filter((each) => each.due).length, curve.step(1)), consider("seconds into the game", (ai) => ai.time, curve.step(this.options.from ?? 15))],
+			claims: { units: (_ai, available) => {
+				const unit = this.scoutFor(available);
+				return unit ? [unit] : [];
+			} },
+			run: (_ai, claimed) => this.send(claimed.units.first())
+		});
+	}
+	/** The scout's squad while it is on a round */
+	out() {
+		const squad = this.ai.squads.named(SCOUT);
+		return !!squad && squad.current?.kind === "scout" && squad.done === void 0;
+	}
+	/** Sends the scout on the round of looks due, unless it is on one */
+	send(unit) {
+		const { ai } = this;
+		if (!unit || this.out()) return;
+		const round = this.round(unit);
+		if (!round.length) return;
+		this.memory.scout = unit.id;
+		this.memory.round = round.map(point);
+		this.memory.rounds++;
+		ai.squads.make(SCOUT, [unit], {
+			micro: false,
+			owner: this.goal.id
+		}).scout(round);
+		ai.decide(`sends ${unit.type} ${unit.id} to look at ${round.map(where).join(", ")}`, {
+			kind: "scout",
+			goal: SCOUT
+		});
+	}
+	/** The scouting as the report shows it */
+	report() {
+		const { ai } = this;
+		if (!this.enabled) return {
+			looks: [],
+			rounds: 0
+		};
+		const squad = ai.squads.named(SCOUT);
+		const points = squad?.current?.kind === "scout" && squad.done === void 0 ? squad.current.data.points : void 0;
+		const next = squad?.current?.memory.next ?? 0;
+		return {
+			looks: this.looks().map((each) => ({
+				at: pair(each.at),
+				kind: each.kind,
+				...Number.isFinite(each.since) && { seen: Math.round(each.since) },
+				due: each.due
+			})),
+			...this.memory.scout !== void 0 && ai.view.mine.has(this.memory.scout) && { scout: this.memory.scout },
+			...points && { going: points.slice(next).map(pair) },
+			rounds: this.memory.rounds
+		};
+	}
+	/** 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.scouting = this.report();
+	}
+	/** Gives a copy of the scouting's memory, for a save of the brain */
+	save() {
+		const { round, lost, ...rest } = this.memory;
+		return {
+			...rest,
+			...round && { round: round.map(point) },
+			...lost && { lost: lost.map((each) => ({
+				at: point(each.at),
+				tick: each.tick
+			})) }
+		};
+	}
+	/** 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,
+			rounds: given.rounds ?? 0,
+			...given.scout !== void 0 && { scout: given.scout },
+			...Array.isArray(given.round) && { round: given.round.map(point) },
+			...Array.isArray(given.lost) && { lost: given.lost.map((each) => ({
+				at: point(each.at),
+				tick: each.tick
+			})) }
+		};
+		return true;
+	}
+	/** Takes in the scout of a save from before the module (the melee player kept it) */
+	adopt(scout) {
+		if (scout !== void 0 && this.memory.scout === void 0) this.memory.scout = scout;
+	}
+};
+/**
+* The scouting module: puts the `scout` goal on the brain's picker, which sends one unit at a time to look at what is
+* due (`ai.scouting`). With how it scouts where the brain's definition and the seat's options say nothing
+* (`ScoutingOptions`)
+*
+* @beta
+*/
+var scouting = (options = {}) => defineModule({
+	id: "scouting",
+	make: (ai) => {
+		ai.area(Scouting).configure(options);
+		return {
+			id: "scouting",
+			phase: "act",
+			think: () => void 0
+		};
+	}
+});
+//#endregion
+export { SCOUT, Scouting, scouting };
+
+//# sourceMappingURL=scouting.js.map

package/dist/ai/scouting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scouting.js","names":[],"sources":["../../src/ai/scouting.ts"],"sourcesContent":["import { baseStats } from '#engine/defs'\nimport type { AiArea } from './area'\nimport type { AiReport } from './report'\nimport { distSq, type Vec2 } from '#engine/math'\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 { UnitSet } from './view'\nimport { heroOfState } from '#engine/hero'\nimport { pair, point, where } from './geometry'\n\n/*\n * Scouting (AI plan, C3): going to look. What a computer knows of its rivals is what it saw (A3: their buildings stay\n * remembered, their army is where it was last seen), so a computer that looked once, early, plays the rest of the game\n * against a picture of minute two: it misses the expansion, the tech switch to flyers, the army gathering at the\n * corner. A player looks again and again; this is the computer doing the same:\n *\n * - **A plan of looks.** First their bases it was told of (the starts) and has not seen, one after the other, as the\n *   old melee player did. Then, every `lookEvery` seconds, each place worth a look again: their bases as remembered,\n *   the mines they would expand to (mines nobody of its own holds, nearer one of their bases than any of its own), and\n *   where their army was last seen. A place is due once it has been out of sight `lookEvery` seconds; nothing is due\n *   while it is in sight.\n * - **One scout.** The looks due go to one unit at a time, as a squad of one (`scout`) on a `scout` task over the\n *   places, nearest first: a flying unit where it has one idle (it sees over walls and is not stopped by them), else\n *   the fastest of its fighters with nothing to do that is no hero, else a worker. The same unit goes on to the next\n *   round while it lives.\n * - **What it saw** is the knowledge's: the scout's sight brings structures, workers, the army and the tech in as any\n *   unit's does, so scouting only has to be there.\n *\n * The plan is a goal on the brain's picker (`scout`, weight 0.3: anything more important takes the unit), so it never\n * fights the army for units. `scout: false` leaves it out (a mission's computer that knows where everything is), a\n * function says where to look (`scout: (ai) => points`). What it remembers (the scout, the rounds) is plain data in\n * the brain's memory (`BrainMemory.scouting`).\n */\n\n/** How near one of their bases a mine is to be a likely expansion of theirs, and not its own way */\nconst EXPANSION_REACH = 60\n/** How near a known building of theirs a start is seen: a base found where it was said to be */\nconst BASE_SEEN = 14\n/** How many places one round takes a scout to at most: the rest wait for the next */\nconst ROUND = 4\n\n/**\n * How a brain scouts (`BrainDef.scouting`, the seat's `AiOptions.scouting` over it, the `scouting()` module's own under\n * both). Data, but for the function form of `scout`\n *\n * @beta\n */\nexport interface ScoutingOptions {\n\t/** Seconds a place stays out of sight before it is worth a look again: 90 when left out */\n\tlookEvery?: number\n\t/**\n\t * Where to look: `false` nowhere (the goal is left out), a function for places of the game's own each think (in place\n\t * of the kit's plan). The kit's plan when left out\n\t */\n\tscout?: false | ((ai: Brain) => Vec2[])\n\t/** Whether the mines they would expand to are looked at: yes when left out */\n\texpansions?: boolean\n\t/** Whether where their army was last seen is looked at again: yes when left out */\n\tarmy?: boolean\n\t/** Whether a flying unit with nothing to do goes before the fastest on foot: yes when left out */\n\tflyers?: boolean\n\t/** Seconds into the game before the first look: 15 when left out */\n\tfrom?: number\n}\n\n/**\n * What the scouting remembers between thinks, as a save keeps it\n *\n * @beta\n */\nexport interface ScoutingMemory {\n\t/** The version of the memory's format: 1 so far */\n\tv: 1\n\t/** The unit that scouts, while it lives: the same one goes on to the next round */\n\tscout?: number\n\t/** Rounds sent */\n\trounds: number\n\t/** The places of the round the scout is on, while it is */\n\tround?: Vec2[]\n\t/**\n\t * Places a scout was lost on the way to, and when: not due again for `lookEvery` seconds, as if looked at (a lost\n\t * scout says as much: what guards it is there). Never the same unit sent to die at their towers over and over (AI1)\n\t */\n\tlost?: { at: Vec2; tick: number }[]\n}\n\n/**\n * A place in the plan of looks: where, what kind of place it is, when it was last in sight\n *\n * @beta\n */\nexport interface Look {\n\t/** Where the place is, in cells */\n\tat: Vec2\n\t/** Their start not seen yet, their base, a mine they would expand to, where their army was, or a place the game names */\n\tkind: 'start' | 'base' | 'expansion' | 'army' | 'game'\n\t/** Seconds since it was last in sight: `Infinity` for never */\n\tsince: number\n\t/** Whether it is worth a look now */\n\tdue: boolean\n}\n\n/**\n * The scouting as the report shows it (`AiReport.scouting`): the plan of looks with how old each is, the scout, where\n * it goes\n *\n * @beta\n */\nexport interface ScoutingReport {\n\t/** The plan of looks, each with where, its kind, how many seconds ago it was seen and whether it is due */\n\tlooks: { at: [number, number]; kind: Look['kind']; seen?: number; due: boolean }[]\n\t/** The entity id of the unit that scouts; nothing when there is none */\n\tscout?: number\n\t/** The places the scout is going to, in order, in cells */\n\tgoing?: [number, number][]\n\t/** How many rounds of looks were sent */\n\trounds: number\n}\n\n/**\n * The id of the scouting's goal\n *\n * @beta\n */\nexport const SCOUT = 'scout'\n\n/**\n * A brain's scouting (`ai.scouting`): its plan of looks (`looks`), the scout it sends (`scoutFor`), through the `scout`\n * goal the `scouting()` module puts on the picker. Kept in the brain's memory (`BrainMemory.scouting`)\n *\n * @internal\n */\nexport class Scouting implements AiArea {\n\t/** What finds it on a brain (`ai.area(Scouting)`): made the first time a module asks for it */\n\tstatic readonly id = 'scouting'\n\t/** Makes the scouting of a brain; what `ai.area(Scouting)` calls the first time a module asks for it */\n\tstatic make(ai: Brain): Scouting {\n\t\treturn new Scouting(ai)\n\t}\n\t/** Its id among the brain's areas: what its memory and its report are kept under */\n\treadonly id = 'scouting'\n\t/** What the log says where a save's memory of it is of a shape it does not read */\n\treadonly afresh = 'the save remembers the computer player’s scouting in a shape this brain does not read: it starts afresh'\n\n\t/** Whether a `scouting()` module is in the brain: without one, nothing here runs, and the goal is not the brain's */\n\tenabled = false\n\tprivate memory: ScoutingMemory = { v: 1, rounds: 0 }\n\tprivate moduleOptions: ScoutingOptions = {}\n\t/** The goal it scouts through: added to the brain's picker by the module, unless told not to scout */\n\treadonly goal: GoalDef\n\n\tconstructor(\n\t\t/** The brain it scouts for */\n\t\treadonly ai: Brain\n\t) {\n\t\tthis.goal = this.makeGoal()\n\t}\n\n\t/** Puts the `scouting()` module's options under the brain's settings, and its goal on the picker */\n\tconfigure(options: ScoutingOptions): void {\n\t\tthis.moduleOptions = options\n\t\tif (!this.enabled && this.options.scout !== false) this.ai.goals.add(this.goal)\n\t\tthis.enabled = true\n\t}\n\n\t/** How it scouts: the module's options, the brain's settings over them (`ai.settings.scouting`) */\n\tget options(): ScoutingOptions {\n\t\treturn this.ai.cache('scouting.options', () => ({ ...this.moduleOptions, ...this.ai.settings.scouting }))\n\t}\n\n\t/** Seconds a place stays out of sight before it is due again */\n\tget lookEvery(): number {\n\t\treturn this.options.lookEvery ?? 90\n\t}\n\n\t/** The scout's unit, while it lives */\n\tget scout(): number | undefined {\n\t\treturn this.memory.scout\n\t}\n\n\t/**\n\t * Their starts it was told of (`AiOptions.enemyBases`) not seen yet: not looked at, and no building of theirs known\n\t * near (a creep's hut is no base)\n\t */\n\tunseenStarts(): Vec2[] {\n\t\tconst { ai } = this\n\t\tconst bases = ai.options.enemyBases ?? []\n\t\tconst knows = ai.def.knowledge !== false\n\t\tif (!knows) return bases.map(point)\n\t\tconst { map, enemy } = ai.knowledge\n\t\tconst rivals = enemy.structures({ gone: true })\n\t\tconst reach = BASE_SEEN * BASE_SEEN\n\t\treturn bases.filter((base) => map.lastLooked(base) === undefined && !rivals.some((building) => distSq(building.at, base) < reach)).map(point)\n\t}\n\n\t/**\n\t * The plan of looks, once a think: their starts not seen (due at once), then their bases as remembered, the mines they\n\t * would expand to, where their army was last seen, each due once out of sight `lookEvery` seconds. A game's own\n\t * places (`scout` as a function) in place of all of it\n\t */\n\tlooks(): Look[] {\n\t\tconst { ai } = this\n\t\treturn ai.cache('scouting.looks', () => {\n\t\t\tconst options = this.options\n\t\t\tconst every = this.lookEvery\n\t\t\tconst knows = ai.def.knowledge !== false\n\t\t\tconst lost = this.lostPlaces()\n\t\t\tconst reach = BASE_SEEN * BASE_SEEN\n\t\t\tconst since = (at: Vec2) => {\n\t\t\t\tconst looked = knows ? ai.knowledge.map.sinceLooked(at) : Infinity\n\t\t\t\tlet losing = Infinity\n\t\t\t\tfor (const each of lost) if (distSq(each.at, at) < reach) losing = Math.min(losing, (ai.tick - each.tick) / ai.session.tickRate)\n\t\t\t\treturn Math.min(looked, losing)\n\t\t\t}\n\t\t\tconst look = (at: Vec2, kind: Look['kind']): Look => {\n\t\t\t\tconst ago = since(at)\n\t\t\t\treturn { at: point(at), kind, since: ago, due: ago >= every }\n\t\t\t}\n\t\t\tif (typeof options.scout === 'function') return options.scout(ai).map((at) => look(at, 'game'))\n\t\t\tconst starts = this.unseenStarts()\n\t\t\tconst looks: Look[] = starts.map((at) => ({ at, kind: 'start', since: Infinity, due: true }))\n\t\t\tif (!knows) return looks\n\t\t\tconst { enemy } = ai.knowledge\n\t\t\tconst theirs = enemy.bases().filter((base) => !base.gone)\n\t\t\tfor (const base of theirs) looks.push(look(base.at, 'base'))\n\t\t\tconst told = ai.options.enemyBases ?? []\n\t\t\t// a start that was seen, with nothing remembered there now, is worth looking at again: they may have come back\n\t\t\tfor (const at of told)\n\t\t\t\tif (!starts.some((each) => each.x === at.x && each.z === at.z) && !theirs.some((base) => distSq(base.at, at) < BASE_SEEN * BASE_SEEN))\n\t\t\t\t\tlooks.push(look(at, 'base'))\n\t\t\tif (options.expansions ?? true) {\n\t\t\t\tconst mine = ai.view.bases()\n\t\t\t\tconst near = (at: Vec2, of: readonly Vec2[]) => of.reduce((best, each) => Math.min(best, distSq(each, at)), Infinity)\n\t\t\t\tconst centres = [...theirs.map((base) => base.at), ...told]\n\t\t\t\tconst candidates = ai.view\n\t\t\t\t\t.mines()\n\t\t\t\t\t.filter((each) => {\n\t\t\t\t\t\tif (theirs.some((base) => distSq(base.at, each) < BASE_SEEN * BASE_SEEN)) return false\n\t\t\t\t\t\tconst toThem = near(each, centres)\n\t\t\t\t\t\treturn (\n\t\t\t\t\t\t\ttoThem < EXPANSION_REACH * EXPANSION_REACH &&\n\t\t\t\t\t\t\ttoThem <\n\t\t\t\t\t\t\t\tnear(\n\t\t\t\t\t\t\t\t\teach,\n\t\t\t\t\t\t\t\t\tmine.map((base) => base.at)\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t)\n\t\t\t\t\t})\n\t\t\t\t\t.sort((a, b) => near(a, centres) - near(b, centres) || a.id - b.id)\n\t\t\t\tfor (const each of candidates.slice(0, 3)) looks.push(look(each, 'expansion'))\n\t\t\t}\n\t\t\tif (options.army ?? true) {\n\t\t\t\tconst army = enemy.armySeen()[0]\n\t\t\t\tif (army) looks.push(look(army.at, 'army'))\n\t\t\t}\n\t\t\treturn looks\n\t\t})\n\t}\n\n\t/**\n\t * The places scouts were lost on the way to, these `lookEvery` seconds: the round of a scout that died before it was\n\t * over taken in, once, as it is found gone\n\t */\n\tprivate lostPlaces(): readonly { at: Vec2; tick: number }[] {\n\t\tconst { ai } = this\n\t\tconst memory = this.memory\n\t\tif (memory.round && memory.scout !== undefined && !ai.view.mine.has(memory.scout)) {\n\t\t\tconst lost = (memory.lost ??= [])\n\t\t\tfor (const at of memory.round) lost.push({ at: point(at), tick: ai.tick })\n\t\t\tai.decide(`lost its scout on the way to ${memory.round.map(where).join(', ')}: not sent there again for ${this.lookEvery} s`, {\n\t\t\t\tkind: 'scout',\n\t\t\t\tgoal: SCOUT\n\t\t\t})\n\t\t\tdelete memory.round\n\t\t\tdelete memory.scout\n\t\t} else if (memory.round && !this.out()) delete memory.round\n\t\tconst every = this.lookEvery * ai.session.tickRate\n\t\tif (memory.lost?.some((each) => ai.tick - each.tick >= every)) memory.lost = memory.lost.filter((each) => ai.tick - each.tick < every)\n\t\treturn memory.lost ?? []\n\t}\n\n\t/** The looks due now, nearest a place first, each after the one before: the round a scout is sent on */\n\tround(from: Vec2): Vec2[] {\n\t\tconst due = this.looks().filter((each) => each.due)\n\t\t// their starts first, in the order told; the rest a walk from one to the nearest next\n\t\tconst starts = due.filter((each) => each.kind === 'start').map((each) => each.at)\n\t\tif (starts.length) return starts.slice(0, 1)\n\t\tconst rest = due.map((each) => each.at)\n\t\tconst round: Vec2[] = []\n\t\tlet at = from\n\t\twhile (rest.length && round.length < ROUND) {\n\t\t\tlet best = 0\n\t\t\tfor (let i = 1; i < rest.length; i++) if (distSq(rest[i], at) < distSq(rest[best], at)) best = i\n\t\t\tat = rest.splice(best, 1)[0]\n\t\t\tround.push(at)\n\t\t}\n\t\treturn round\n\t}\n\n\t/**\n\t * Who goes to look, of what it may have: the scout of the last round, while it is there; else a flying unit with\n\t * nothing to do (`flyers`); else the fastest of its fighters with nothing to do that is no hero; else, only to find\n\t * a start of theirs not seen yet, a worker. Looking again (their base, an expansion, their army) waits for a fighter:\n\t * a worker sent into a base it knows is lost to its towers, and what chases it home comes into its own (AI1)\n\t */\n\tscoutFor(available: UnitSet): EntityState | undefined {\n\t\tconst { ai } = this\n\t\tconst kept = available.find((unit) => unit.id === this.memory.scout)\n\t\tif (kept) return kept\n\t\tconst { registry } = ai\n\t\tconst speed = (unit: EntityState) => baseStats(ai.view.def(unit), registry).moveSpeed\n\t\tconst fastest = (units: Iterable<EntityState>) => [...units].sort((a, b) => speed(b) - speed(a) || a.id - b.id)[0]\n\t\tconst idle = available.fighters().where((unit) => !unit.own?.order && !heroOfState(unit))\n\t\tif (this.options.flyers ?? true) {\n\t\t\tconst flyer = fastest(idle.withRole('air'))\n\t\t\tif (flyer) return flyer\n\t\t}\n\t\tconst fighter = fastest(idle)\n\t\tif (fighter || !this.unseenStarts().length) return fighter\n\t\t// a worker inside a mine is not told to go anywhere until it is out: one outside, not building\n\t\treturn fastest(available.workers().where((unit) => !unit.own?.hidden && unit.own?.order !== 'build' && unit.own?.order !== 'construct'))\n\t}\n\n\t/** The goal: worth 0.3 while a look is due, one unit claimed, a squad of one sent on the round */\n\tprivate makeGoal(): GoalDef {\n\t\treturn defineGoal({\n\t\t\tid: SCOUT,\n\t\t\tweight: 0.3,\n\t\t\tconsiderations: [\n\t\t\t\t// while its scout is out on a round, the round goes on\n\t\t\t\tconsider('looks due', () => (this.out() ? 1 : this.looks().filter((each) => each.due).length), curve.step(1)),\n\t\t\t\tconsider('seconds into the game', (ai) => ai.time, curve.step(this.options.from ?? 15))\n\t\t\t],\n\t\t\tclaims: {\n\t\t\t\tunits: (_ai, available) => {\n\t\t\t\t\tconst unit = this.scoutFor(available)\n\t\t\t\t\treturn unit ? [unit] : []\n\t\t\t\t}\n\t\t\t},\n\t\t\trun: (_ai, claimed) => this.send(claimed.units.first())\n\t\t})\n\t}\n\n\t/** The scout's squad while it is on a round */\n\tprivate out(): boolean {\n\t\tconst squad = this.ai.squads.named(SCOUT)\n\t\treturn !!squad && squad.current?.kind === 'scout' && squad.done === undefined\n\t}\n\n\t/** Sends the scout on the round of looks due, unless it is on one */\n\tprivate send(unit: EntityState | undefined): void {\n\t\tconst { ai } = this\n\t\tif (!unit || this.out()) return\n\t\tconst round = this.round(unit)\n\t\tif (!round.length) return\n\t\tthis.memory.scout = unit.id\n\t\tthis.memory.round = round.map(point)\n\t\tthis.memory.rounds++\n\t\tai.squads.make(SCOUT, [unit], { micro: false, owner: this.goal.id }).scout(round)\n\t\tai.decide(`sends ${unit.type} ${unit.id} to look at ${round.map(where).join(', ')}`, { kind: 'scout', goal: SCOUT })\n\t}\n\n\t/** The scouting as the report shows it */\n\treport(): ScoutingReport {\n\t\tconst { ai } = this\n\t\tif (!this.enabled) return { looks: [], rounds: 0 }\n\t\tconst squad = ai.squads.named(SCOUT)\n\t\tconst points = squad?.current?.kind === 'scout' && squad.done === undefined ? (squad.current.data.points as Vec2[]) : undefined\n\t\tconst next = (squad?.current?.memory.next as number | undefined) ?? 0\n\t\treturn {\n\t\t\tlooks: this.looks().map((each) => ({\n\t\t\t\tat: pair(each.at),\n\t\t\t\tkind: each.kind,\n\t\t\t\t...(Number.isFinite(each.since) && { seen: Math.round(each.since) }),\n\t\t\t\tdue: each.due\n\t\t\t})),\n\t\t\t...(this.memory.scout !== undefined && ai.view.mine.has(this.memory.scout) && { scout: this.memory.scout }),\n\t\t\t...(points && { going: points.slice(next).map(pair) }),\n\t\t\trounds: this.memory.rounds\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.scouting = this.report()\n\t}\n\n\t/** Gives a copy of the scouting's memory, for a save of the brain */\n\tsave(): ScoutingMemory {\n\t\tconst { round, lost, ...rest } = this.memory\n\t\treturn {\n\t\t\t...rest,\n\t\t\t...(round && { round: round.map(point) }),\n\t\t\t...(lost && { lost: lost.map((each) => ({ at: point(each.at), tick: each.tick })) })\n\t\t}\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 ScoutingMemory | undefined\n\t\tif (!given || typeof given !== 'object' || given.v !== 1) return false\n\t\tthis.memory = {\n\t\t\tv: 1,\n\t\t\trounds: given.rounds ?? 0,\n\t\t\t...(given.scout !== undefined && { scout: given.scout }),\n\t\t\t...(Array.isArray(given.round) && { round: given.round.map(point) }),\n\t\t\t...(Array.isArray(given.lost) && { lost: given.lost.map((each) => ({ at: point(each.at), tick: each.tick })) })\n\t\t}\n\t\treturn true\n\t}\n\n\t/** Takes in the scout of a save from before the module (the melee player kept it) */\n\tadopt(scout: number | undefined): void {\n\t\tif (scout !== undefined && this.memory.scout === undefined) this.memory.scout = scout\n\t}\n}\n\n/**\n * The scouting module: puts the `scout` goal on the brain's picker, which sends one unit at a time to look at what is\n * due (`ai.scouting`). With how it scouts where the brain's definition and the seat's options say nothing\n * (`ScoutingOptions`)\n *\n * @beta\n */\nexport const scouting = (options: ScoutingOptions = {}): AiModuleDef =>\n\tdefineModule({ id: 'scouting', make: (ai: Brain): AiModule => {\n\t\tai.area(Scouting).configure(options)\n\t\treturn { id: 'scouting', phase: 'act', think: () => undefined }\n\t} })\n\ndeclare module './area' {\n\tinterface AreaMemories {\n\t\tscouting?: ScoutingMemory\n\t}\n}\n"],"mappings":";;;;;;;;AAyCA,IAAM,QAAQ;;;;;;AAqFd,IAAa,QAAQ;;;;;;;AAQrB,IAAa,WAAb,MAAa,SAA2B;CAqB7B;;CAnBV,OAAgB,KAAK;;CAErB,OAAO,KAAK,IAAqB;EAChC,OAAO,IAAI,SAAS,EAAE;CACvB;;CAEA,KAAc;;CAEd,SAAkB;;CAGlB,UAAU;CACV,SAAiC;EAAE,GAAG;EAAG,QAAQ;CAAE;CACnD,gBAAyC,CAAC;;CAE1C;CAEA,YAEC,IACC;EADQ,KAAA,KAAA;EAET,KAAK,OAAO,KAAK,SAAS;CAC3B;;CAGA,UAAU,SAAgC;EACzC,KAAK,gBAAgB;EACrB,IAAI,CAAC,KAAK,WAAW,KAAK,QAAQ,UAAU,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI;EAC9E,KAAK,UAAU;CAChB;;CAGA,IAAI,UAA2B;EAC9B,OAAO,KAAK,GAAG,MAAM,2BAA2B;GAAE,GAAG,KAAK;GAAe,GAAG,KAAK,GAAG,SAAS;EAAS,EAAE;CACzG;;CAGA,IAAI,YAAoB;EACvB,OAAO,KAAK,QAAQ,aAAa;CAClC;;CAGA,IAAI,QAA4B;EAC/B,OAAO,KAAK,OAAO;CACpB;;;;;CAMA,eAAuB;EACtB,MAAM,EAAE,OAAO;EACf,MAAM,QAAQ,GAAG,QAAQ,cAAc,CAAC;EAExC,IAAI,EADU,GAAG,IAAI,cAAc,QACvB,OAAO,MAAM,IAAI,KAAK;EAClC,MAAM,EAAE,KAAK,UAAU,GAAG;EAC1B,MAAM,SAAS,MAAM,WAAW,EAAE,MAAM,KAAK,CAAC;EAC9C,MAAM,QAAQ;EACd,OAAO,MAAM,QAAQ,SAAS,IAAI,WAAW,IAAI,MAAM,KAAA,KAAa,CAAC,OAAO,MAAM,aAAa,OAAO,SAAS,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK;CAC7I;;;;;;CAOA,QAAgB;EACf,MAAM,EAAE,OAAO;EACf,OAAO,GAAG,MAAM,wBAAwB;GACvC,MAAM,UAAU,KAAK;GACrB,MAAM,QAAQ,KAAK;GACnB,MAAM,QAAQ,GAAG,IAAI,cAAc;GACnC,MAAM,OAAO,KAAK,WAAW;GAC7B,MAAM,QAAQ;GACd,MAAM,SAAS,OAAa;IAC3B,MAAM,SAAS,QAAQ,GAAG,UAAU,IAAI,YAAY,EAAE,IAAI;IAC1D,IAAI,SAAS;IACb,KAAK,MAAM,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAI,EAAE,IAAI,OAAO,SAAS,KAAK,IAAI,SAAS,GAAG,OAAO,KAAK,QAAQ,GAAG,QAAQ,QAAQ;IAC/H,OAAO,KAAK,IAAI,QAAQ,MAAM;GAC/B;GACA,MAAM,QAAQ,IAAU,SAA6B;IACpD,MAAM,MAAM,MAAM,EAAE;IACpB,OAAO;KAAE,IAAI,MAAM,EAAE;KAAG;KAAM,OAAO;KAAK,KAAK,OAAO;IAAM;GAC7D;GACA,IAAI,OAAO,QAAQ,UAAU,YAAY,OAAO,QAAQ,MAAM,EAAE,CAAC,CAAC,KAAK,OAAO,KAAK,IAAI,MAAM,CAAC;GAC9F,MAAM,SAAS,KAAK,aAAa;GACjC,MAAM,QAAgB,OAAO,KAAK,QAAQ;IAAE;IAAI,MAAM;IAAS,OAAO;IAAU,KAAK;GAAK,EAAE;GAC5F,IAAI,CAAC,OAAO,OAAO;GACnB,MAAM,EAAE,UAAU,GAAG;GACrB,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC,QAAQ,SAAS,CAAC,KAAK,IAAI;GACxD,KAAK,MAAM,QAAQ,QAAQ,MAAM,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC;GAC3D,MAAM,OAAO,GAAG,QAAQ,cAAc,CAAC;GAEvC,KAAK,MAAM,MAAM,MAChB,IAAI,CAAC,OAAO,MAAM,SAAS,KAAK,MAAM,GAAG,KAAK,KAAK,MAAM,GAAG,CAAC,KAAK,CAAC,OAAO,MAAM,SAAS,OAAO,KAAK,IAAI,EAAE,IAAI,GAAqB,GACnI,MAAM,KAAK,KAAK,IAAI,MAAM,CAAC;GAC7B,IAAI,QAAQ,cAAc,MAAM;IAC/B,MAAM,OAAO,GAAG,KAAK,MAAM;IAC3B,MAAM,QAAQ,IAAU,OAAwB,GAAG,QAAQ,MAAM,SAAS,KAAK,IAAI,MAAM,OAAO,MAAM,EAAE,CAAC,GAAG,QAAQ;IACpH,MAAM,UAAU,CAAC,GAAG,OAAO,KAAK,SAAS,KAAK,EAAE,GAAG,GAAG,IAAI;IAC1D,MAAM,aAAa,GAAG,KACpB,MAAM,CAAC,CACP,QAAQ,SAAS;KACjB,IAAI,OAAO,MAAM,SAAS,OAAO,KAAK,IAAI,IAAI,IAAI,GAAqB,GAAG,OAAO;KACjF,MAAM,SAAS,KAAK,MAAM,OAAO;KACjC,OACC,SAAS,QACT,SACC,KACC,MACA,KAAK,KAAK,SAAS,KAAK,EAAE,CAC3B;IAEH,CAAC,CAAC,CACD,MAAM,GAAG,MAAM,KAAK,GAAG,OAAO,IAAI,KAAK,GAAG,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;IACnE,KAAK,MAAM,QAAQ,WAAW,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,KAAK,MAAM,WAAW,CAAC;GAC9E;GACA,IAAI,QAAQ,QAAQ,MAAM;IACzB,MAAM,OAAO,MAAM,SAAS,CAAC,CAAC;IAC9B,IAAI,MAAM,MAAM,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC;GAC3C;GACA,OAAO;EACR,CAAC;CACF;;;;;CAMA,aAA4D;EAC3D,MAAM,EAAE,OAAO;EACf,MAAM,SAAS,KAAK;EACpB,IAAI,OAAO,SAAS,OAAO,UAAU,KAAA,KAAa,CAAC,GAAG,KAAK,KAAK,IAAI,OAAO,KAAK,GAAG;GAClF,MAAM,OAAQ,OAAO,SAAS,CAAC;GAC/B,KAAK,MAAM,MAAM,OAAO,OAAO,KAAK,KAAK;IAAE,IAAI,MAAM,EAAE;IAAG,MAAM,GAAG;GAAK,CAAC;GACzE,GAAG,OAAO,gCAAgC,OAAO,MAAM,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,6BAA6B,KAAK,UAAU,KAAK;IAC7H,MAAM;IACN,MAAM;GACP,CAAC;GACD,OAAO,OAAO;GACd,OAAO,OAAO;EACf,OAAO,IAAI,OAAO,SAAS,CAAC,KAAK,IAAI,GAAG,OAAO,OAAO;EACtD,MAAM,QAAQ,KAAK,YAAY,GAAG,QAAQ;EAC1C,IAAI,OAAO,MAAM,MAAM,SAAS,GAAG,OAAO,KAAK,QAAQ,KAAK,GAAG,OAAO,OAAO,OAAO,KAAK,QAAQ,SAAS,GAAG,OAAO,KAAK,OAAO,KAAK;EACrI,OAAO,OAAO,QAAQ,CAAC;CACxB;;CAGA,MAAM,MAAoB;EACzB,MAAM,MAAM,KAAK,MAAM,CAAC,CAAC,QAAQ,SAAS,KAAK,GAAG;EAElD,MAAM,SAAS,IAAI,QAAQ,SAAS,KAAK,SAAS,OAAO,CAAC,CAAC,KAAK,SAAS,KAAK,EAAE;EAChF,IAAI,OAAO,QAAQ,OAAO,OAAO,MAAM,GAAG,CAAC;EAC3C,MAAM,OAAO,IAAI,KAAK,SAAS,KAAK,EAAE;EACtC,MAAM,QAAgB,CAAC;EACvB,IAAI,KAAK;EACT,OAAO,KAAK,UAAU,MAAM,SAAS,OAAO;GAC3C,IAAI,OAAO;GACX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,EAAE,IAAI,OAAO,KAAK,OAAO,EAAE,GAAG,OAAO;GAC/F,KAAK,KAAK,OAAO,MAAM,CAAC,CAAC,CAAC;GAC1B,MAAM,KAAK,EAAE;EACd;EACA,OAAO;CACR;;;;;;;CAQA,SAAS,WAA6C;EACrD,MAAM,EAAE,OAAO;EACf,MAAM,OAAO,UAAU,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,KAAK;EACnE,IAAI,MAAM,OAAO;EACjB,MAAM,EAAE,aAAa;EACrB,MAAM,SAAS,SAAsB,UAAU,GAAG,KAAK,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC;EAC5E,MAAM,WAAW,UAAiC,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;EAChH,MAAM,OAAO,UAAU,SAAS,CAAC,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,SAAS,CAAC,YAAY,IAAI,CAAC;EACxF,IAAI,KAAK,QAAQ,UAAU,MAAM;GAChC,MAAM,QAAQ,QAAQ,KAAK,SAAS,KAAK,CAAC;GAC1C,IAAI,OAAO,OAAO;EACnB;EACA,MAAM,UAAU,QAAQ,IAAI;EAC5B,IAAI,WAAW,CAAC,KAAK,aAAa,CAAC,CAAC,QAAQ,OAAO;EAEnD,OAAO,QAAQ,UAAU,QAAQ,CAAC,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,UAAU,KAAK,KAAK,UAAU,WAAW,KAAK,KAAK,UAAU,WAAW,CAAC;CACxI;;CAGA,WAA4B;EAC3B,OAAO,WAAW;GACjB,IAAI;GACJ,QAAQ;GACR,gBAAgB,CAEf,SAAS,mBAAoB,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,QAAQ,SAAS,KAAK,GAAG,CAAC,CAAC,QAAS,MAAM,KAAK,CAAC,CAAC,GAC5G,SAAS,0BAA0B,OAAO,GAAG,MAAM,MAAM,KAAK,KAAK,QAAQ,QAAQ,EAAE,CAAC,CACvF;GACA,QAAQ,EACP,QAAQ,KAAK,cAAc;IAC1B,MAAM,OAAO,KAAK,SAAS,SAAS;IACpC,OAAO,OAAO,CAAC,IAAI,IAAI,CAAC;GACzB,EACD;GACA,MAAM,KAAK,YAAY,KAAK,KAAK,QAAQ,MAAM,MAAM,CAAC;EACvD,CAAC;CACF;;CAGA,MAAuB;EACtB,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,KAAK;EACxC,OAAO,CAAC,CAAC,SAAS,MAAM,SAAS,SAAS,WAAW,MAAM,SAAS,KAAA;CACrE;;CAGA,KAAa,MAAqC;EACjD,MAAM,EAAE,OAAO;EACf,IAAI,CAAC,QAAQ,KAAK,IAAI,GAAG;EACzB,MAAM,QAAQ,KAAK,MAAM,IAAI;EAC7B,IAAI,CAAC,MAAM,QAAQ;EACnB,KAAK,OAAO,QAAQ,KAAK;EACzB,KAAK,OAAO,QAAQ,MAAM,IAAI,KAAK;EACnC,KAAK,OAAO;EACZ,GAAG,OAAO,KAAK,OAAO,CAAC,IAAI,GAAG;GAAE,OAAO;GAAO,OAAO,KAAK,KAAK;EAAG,CAAC,CAAC,CAAC,MAAM,KAAK;EAChF,GAAG,OAAO,SAAS,KAAK,KAAK,GAAG,KAAK,GAAG,cAAc,MAAM,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,KAAK;GAAE,MAAM;GAAS,MAAM;EAAM,CAAC;CACpH;;CAGA,SAAyB;EACxB,MAAM,EAAE,OAAO;EACf,IAAI,CAAC,KAAK,SAAS,OAAO;GAAE,OAAO,CAAC;GAAG,QAAQ;EAAE;EACjD,MAAM,QAAQ,GAAG,OAAO,MAAM,KAAK;EACnC,MAAM,SAAS,OAAO,SAAS,SAAS,WAAW,MAAM,SAAS,KAAA,IAAa,MAAM,QAAQ,KAAK,SAAoB,KAAA;EACtH,MAAM,OAAQ,OAAO,SAAS,OAAO,QAA+B;EACpE,OAAO;GACN,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK,UAAU;IAClC,IAAI,KAAK,KAAK,EAAE;IAChB,MAAM,KAAK;IACX,GAAI,OAAO,SAAS,KAAK,KAAK,KAAK,EAAE,MAAM,KAAK,MAAM,KAAK,KAAK,EAAE;IAClE,KAAK,KAAK;GACX,EAAE;GACF,GAAI,KAAK,OAAO,UAAU,KAAA,KAAa,GAAG,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,EAAE,OAAO,KAAK,OAAO,MAAM;GACzG,GAAI,UAAU,EAAE,OAAO,OAAO,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;GACpD,QAAQ,KAAK,OAAO;EACrB;CACD;;;CAIA,YAAqB;EACpB,OAAO,KAAK;CACb;;CAGA,SAAS,QAAwB;EAChC,OAAO,WAAW,KAAK,OAAO;CAC/B;;CAGA,OAAuB;EACtB,MAAM,EAAE,OAAO,MAAM,GAAG,SAAS,KAAK;EACtC,OAAO;GACN,GAAG;GACH,GAAI,SAAS,EAAE,OAAO,MAAM,IAAI,KAAK,EAAE;GACvC,GAAI,QAAQ,EAAE,MAAM,KAAK,KAAK,UAAU;IAAE,IAAI,MAAM,KAAK,EAAE;IAAG,MAAM,KAAK;GAAK,EAAE,EAAE;EACnF;CACD;;CAGA,QAAQ,QAA0B;EACjC,MAAM,QAAQ;EACd,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,MAAM,GAAG,OAAO;EACjE,KAAK,SAAS;GACb,GAAG;GACH,QAAQ,MAAM,UAAU;GACxB,GAAI,MAAM,UAAU,KAAA,KAAa,EAAE,OAAO,MAAM,MAAM;GACtD,GAAI,MAAM,QAAQ,MAAM,KAAK,KAAK,EAAE,OAAO,MAAM,MAAM,IAAI,KAAK,EAAE;GAClE,GAAI,MAAM,QAAQ,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,KAAK,KAAK,UAAU;IAAE,IAAI,MAAM,KAAK,EAAE;IAAG,MAAM,KAAK;GAAK,EAAE,EAAE;EAC9G;EACA,OAAO;CACR;;CAGA,MAAM,OAAiC;EACtC,IAAI,UAAU,KAAA,KAAa,KAAK,OAAO,UAAU,KAAA,GAAW,KAAK,OAAO,QAAQ;CACjF;AACD;;;;;;;;AASA,IAAa,YAAY,UAA2B,CAAC,MACpD,aAAa;CAAE,IAAI;CAAY,OAAO,OAAwB;EAC7D,GAAG,KAAK,QAAQ,CAAC,CAAC,UAAU,OAAO;EACnC,OAAO;GAAE,IAAI;GAAY,OAAO;GAAO,aAAa,KAAA;EAAU;CAC/D;AAAE,CAAC"}

package/dist/ai/settings.js

@@ -0,0 +1,99 @@
+//#region src/ai/settings.ts
+/**
+* Where each flag that an area has a name for goes in it, and whether it is a share (`true`: the share a lower layer or
+* the area gives; a number: that share; `false`: never)
+*/
+var FLAGGED = {
+	defendUsers: [["team", "defendUsers"], "switch"],
+	say: [["team", "say"], "switch"],
+	targetHeroes: [["micro", "targetHeroes"], "switch"],
+	ignoreInjured: [["micro", "ignoreInjured"], "switch"],
+	removeInjuries: [["micro", "removeInjuries"], "switch"],
+	takeItems: [["micro", "takeItems"], "switch"],
+	buyItems: [["micro", "buyItems"], "switch"],
+	smartArtillery: [["micro", "smartArtillery"], "switch"],
+	kite: [["micro", "kite"], "switch"],
+	unitsFlee: [["micro", "unitsFlee"], "share"],
+	heroesFlee: [["micro", "heroesFlee"], "share"],
+	groupsFlee: [["squads", "retreatAt"], "share"],
+	workersFlee: [["economy", "workersFlee"], "switch"],
+	repairStructures: [[
+		"plans",
+		"build",
+		"repair"
+	], "switch"],
+	rebuild: [[
+		"plans",
+		"build",
+		"rebuild"
+	], "switch"],
+	scout: [["scouting", "scout"], "off"]
+};
+/** Of what a layer gives, the lists that add to the lower layers' rather than replace them */
+var ADDED = /* @__PURE__ */ new Set(["plans.build.wants", "waves.groups"]);
+/** Of what a layer gives, the tables merged key by key with the lower layers' rather than replaced */
+var MERGED = /* @__PURE__ */ new Set([
+	"plans",
+	"plans.build",
+	"plans.production",
+	"plans.build.placement"
+]);
+var isObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+/** A copy of a layer with its flags taken into the areas they name, the area's own value of the same layer over it */
+function folded(layer, ai) {
+	const copy = { ...layer };
+	for (const [flag, value] of Object.entries(layer.flags ?? {})) {
+		const where = FLAGGED[flag];
+		if (!where) continue;
+		const said = typeof value === "function" ? ai ? value(ai) : void 0 : value;
+		if (said === void 0) continue;
+		const [path, kind] = where;
+		const word = kind === "switch" ? !!said : kind === "off" ? said === false ? false : void 0 : said;
+		if (word === void 0) continue;
+		let at = copy;
+		for (const key of path.slice(0, -1)) {
+			at[key] = { ...at[key] };
+			at = at[key];
+		}
+		const key = path[path.length - 1];
+		if (at[key] === void 0) at[key] = word;
+	}
+	return copy;
+}
+/** A layer's values over the lower layers', key by key: see `ADDED`, `MERGED`; `true` over a share keeps the share */
+function over(under, given, path) {
+	const merged = { ...under };
+	for (const [key, value] of Object.entries(given)) {
+		if (value === void 0) continue;
+		const at = path ? `${path}.${key}` : key;
+		const below = merged[key];
+		if (ADDED.has(at) && Array.isArray(value)) merged[key] = [...below ?? [], ...value];
+		else if ((MERGED.has(at) || !path) && isObject(value) && isObject(below)) merged[key] = over(below, value, at);
+		else if (value === true && typeof below === "number") continue;
+		else merged[key] = value;
+	}
+	return merged;
+}
+/**
+* The settings layered, lowest first (see the file's comment): each area's values key by key, a flag taken into the area
+* it names in its own layer. A flag that is a function of the brain is asked of `ai`, and left out where none is given
+*
+* @beta
+*/
+function resolveSettings(layers, ai) {
+	let resolved = {};
+	for (const layer of layers) if (layer) resolved = over(resolved, folded(layer, ai), "");
+	for (const [path, kind] of Object.values(FLAGGED)) {
+		if (kind !== "share") continue;
+		const area = resolved[path[0]];
+		if (area?.[path[1]] === true) resolved[path[0]] = {
+			...area,
+			[path[1]]: void 0
+		};
+	}
+	return resolved;
+}
+//#endregion
+export { resolveSettings };
+
+//# sourceMappingURL=settings.js.map

package/dist/ai/settings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"settings.js","names":[],"sources":["../../src/ai/settings.ts"],"sourcesContent":["/**\n * The settings of a brain (design review B2): every number and switch its areas play by, in one schema keyed by area,\n * each under the area's own names (`{ economy: { workers }, defence: { radius, towers }, micro: { unitsFlee } }`). Every\n * layer speaks it, lowest first:\n *\n *   the brain's definition (`BrainDef.settings`)  →  the game's defaults (`GameAi.defaults`)  →  the race's\n *   (`GameAi.races`)  →  the difficulty  →  the personality  →  the map (`MapAi.settings`, `MapAi.races`)  →  the seat\n *   (`AiOptions.settings`)\n *\n * and `resolveSettings` layers them once: an area's values key by key, the higher layer's over the lower's. What a\n * module was made with (`economy({ workers })`) is under all of them, and what no layer says is the area's own default\n * (`Economy`'s 8 workers). An area reads what it plays by from `ai.settings` and nothing else.\n *\n * The classic flags (`AiFlags`) are a section of their own, for a lobby and the editor's flags list: a flag that says what\n * an area has a name for (Kite: `micro.kite`, Units Flee: `micro.unitsFlee`) is taken into that area in the layer that\n * says it, so that a higher layer's word goes over it either way. A flag may be a function of the brain: worked out each\n * think, as `ai.settings` is\n */\nimport type { DefenceOptions } from './defence'\nimport type { EconomyOptions } from './economy'\nimport type { Brain } from './brain'\nimport type { LanesPlayOptions } from './lanes'\nimport type { MeleeArmyOptions } from './melee/goals'\nimport type { MeleeHeroesOptions } from './melee/heroes'\nimport type { MicroOptions } from './micro'\nimport type { PlansOptions } from './plans/plans'\nimport type { AiFlags } from './profiles'\nimport type { ScoutingOptions } from './scouting'\nimport type { SquadsOptions } from './squads'\nimport type { TeamOptions } from './team'\nimport type { WavesOptions } from './waves'\n\n/**\n * What a brain's areas play by, by area, each under its own names (see the file's comment): what every layer gives, from\n * the brain's definition to the seat. Plain data where a lobby, a map or a save holds it; a function in it is code, not\n * kept in a save\n *\n * @beta\n */\nexport interface AiSettings {\n\t/** The workers and the bases (`Economy`) */\n\teconomy?: EconomyOptions\n\t/** What it defends and how (`Defence`) */\n\tdefence?: DefenceOptions\n\t/** How often it looks and with whom (`Scouting`) */\n\tscouting?: ScoutingOptions\n\t/** How its units fight (`Micro`) */\n\tmicro?: MicroOptions\n\t/** How its squads go, and the tasks they may be given (`Squads`) */\n\tsquads?: SquadsOptions\n\t/** How it plays with its team (`Team`) */\n\tteam?: TeamOptions\n\t/** The waves it was given (`Waves`) */\n\twaves?: WavesOptions\n\t/** What it builds, trains and researches, and in what order (`Plans`) */\n\tplans?: PlansOptions\n\t/** The melee army: when it attacks, how many go, how a wave goes (`melee.army`) */\n\tarmy?: MeleeArmyOptions\n\t/** The melee player's heroes: how many, and from when (`melee.heroes`) */\n\theroes?: MeleeHeroesOptions\n\t/** A lanes brain's play (`lanes`) */\n\tlanes?: LanesPlayOptions\n\t/** How much each goal weighs, by its id (1 when left out): the picker's (`Goals`) */\n\tweights?: Record<string, number>\n\t/** The classic flags (see the file's comment) */\n\tflags?: AiFlags\n}\n\n/**\n * Where each flag that an area has a name for goes in it, and whether it is a share (`true`: the share a lower layer or\n * the area gives; a number: that share; `false`: never)\n */\nconst FLAGGED: Readonly<Partial<Record<keyof AiFlags, readonly [path: readonly string[], kind: 'switch' | 'share' | 'off']>>> = {\n\tdefendUsers: [['team', 'defendUsers'], 'switch'],\n\tsay: [['team', 'say'], 'switch'],\n\ttargetHeroes: [['micro', 'targetHeroes'], 'switch'],\n\tignoreInjured: [['micro', 'ignoreInjured'], 'switch'],\n\tremoveInjuries: [['micro', 'removeInjuries'], 'switch'],\n\ttakeItems: [['micro', 'takeItems'], 'switch'],\n\tbuyItems: [['micro', 'buyItems'], 'switch'],\n\tsmartArtillery: [['micro', 'smartArtillery'], 'switch'],\n\tkite: [['micro', 'kite'], 'switch'],\n\tunitsFlee: [['micro', 'unitsFlee'], 'share'],\n\theroesFlee: [['micro', 'heroesFlee'], 'share'],\n\tgroupsFlee: [['squads', 'retreatAt'], 'share'],\n\tworkersFlee: [['economy', 'workersFlee'], 'switch'],\n\trepairStructures: [['plans', 'build', 'repair'], 'switch'],\n\trebuild: [['plans', 'build', 'rebuild'], 'switch'],\n\t// only its no: the scouting's `scout` is who goes, where it is not `false`\n\tscout: [['scouting', 'scout'], 'off']\n}\n\n/** Of what a layer gives, the lists that add to the lower layers' rather than replace them */\nconst ADDED = new Set(['plans.build.wants', 'waves.groups'])\n\n/** Of what a layer gives, the tables merged key by key with the lower layers' rather than replaced */\nconst MERGED = new Set(['plans', 'plans.build', 'plans.production', 'plans.build.placement'])\n\ntype Loose = Record<string, unknown>\n\nconst isObject = (value: unknown): value is Loose => typeof value === 'object' && value !== null && !Array.isArray(value)\n\n/** A copy of a layer with its flags taken into the areas they name, the area's own value of the same layer over it */\nfunction folded(layer: AiSettings, ai: Brain | undefined): Loose {\n\tconst copy: Loose = { ...layer }\n\tfor (const [flag, value] of Object.entries(layer.flags ?? {})) {\n\t\tconst where = FLAGGED[flag as keyof AiFlags]\n\t\tif (!where) continue\n\t\tconst said = typeof value === 'function' ? (ai ? (value as (ai: Brain) => unknown)(ai) : undefined) : value\n\t\tif (said === undefined) continue\n\t\tconst [path, kind] = where\n\t\tconst word = kind === 'switch' ? !!said : kind === 'off' ? (said === false ? false : undefined) : said\n\t\tif (word === undefined) continue\n\t\tlet at = copy\n\t\tfor (const key of path.slice(0, -1)) {\n\t\t\tat[key] = { ...(at[key] as Loose | undefined) }\n\t\t\tat = at[key] as Loose\n\t\t}\n\t\tconst key = path[path.length - 1]\n\t\tif (at[key] === undefined) at[key] = word\n\t}\n\treturn copy\n}\n\n/** A layer's values over the lower layers', key by key: see `ADDED`, `MERGED`; `true` over a share keeps the share */\nfunction over(under: Loose, given: Loose, path: string): Loose {\n\tconst merged: Loose = { ...under }\n\tfor (const [key, value] of Object.entries(given)) {\n\t\tif (value === undefined) continue\n\t\tconst at = path ? `${path}.${key}` : key\n\t\tconst below = merged[key]\n\t\tif (ADDED.has(at) && Array.isArray(value)) merged[key] = [...((below as unknown[] | undefined) ?? []), ...value]\n\t\telse if ((MERGED.has(at) || !path) && isObject(value) && isObject(below)) merged[key] = over(below, value, at)\n\t\telse if (value === true && typeof below === 'number') continue\n\t\telse merged[key] = value\n\t}\n\treturn merged\n}\n\n/**\n * The settings layered, lowest first (see the file's comment): each area's values key by key, a flag taken into the area\n * it names in its own layer. A flag that is a function of the brain is asked of `ai`, and left out where none is given\n *\n * @beta\n */\nexport function resolveSettings(layers: readonly (AiSettings | undefined)[], ai?: Brain): AiSettings {\n\tlet resolved: Loose = {}\n\tfor (const layer of layers) if (layer) resolved = over(resolved, folded(layer, ai), '')\n\t// a share left at `true` is the area's own\n\tfor (const [path, kind] of Object.values(FLAGGED)) {\n\t\tif (kind !== 'share') continue\n\t\tconst area = resolved[path[0]] as Loose | undefined\n\t\tif (area?.[path[1]] === true) resolved[path[0]] = { ...area, [path[1]]: undefined }\n\t}\n\treturn resolved as AiSettings\n}\n"],"mappings":";;;;;AAwEA,IAAM,UAA0H;CAC/H,aAAa,CAAC,CAAC,QAAQ,aAAa,GAAG,QAAQ;CAC/C,KAAK,CAAC,CAAC,QAAQ,KAAK,GAAG,QAAQ;CAC/B,cAAc,CAAC,CAAC,SAAS,cAAc,GAAG,QAAQ;CAClD,eAAe,CAAC,CAAC,SAAS,eAAe,GAAG,QAAQ;CACpD,gBAAgB,CAAC,CAAC,SAAS,gBAAgB,GAAG,QAAQ;CACtD,WAAW,CAAC,CAAC,SAAS,WAAW,GAAG,QAAQ;CAC5C,UAAU,CAAC,CAAC,SAAS,UAAU,GAAG,QAAQ;CAC1C,gBAAgB,CAAC,CAAC,SAAS,gBAAgB,GAAG,QAAQ;CACtD,MAAM,CAAC,CAAC,SAAS,MAAM,GAAG,QAAQ;CAClC,WAAW,CAAC,CAAC,SAAS,WAAW,GAAG,OAAO;CAC3C,YAAY,CAAC,CAAC,SAAS,YAAY,GAAG,OAAO;CAC7C,YAAY,CAAC,CAAC,UAAU,WAAW,GAAG,OAAO;CAC7C,aAAa,CAAC,CAAC,WAAW,aAAa,GAAG,QAAQ;CAClD,kBAAkB,CAAC;EAAC;EAAS;EAAS;CAAQ,GAAG,QAAQ;CACzD,SAAS,CAAC;EAAC;EAAS;EAAS;CAAS,GAAG,QAAQ;CAEjD,OAAO,CAAC,CAAC,YAAY,OAAO,GAAG,KAAK;AACrC;;AAGA,IAAM,wBAAQ,IAAI,IAAI,CAAC,qBAAqB,cAAc,CAAC;;AAG3D,IAAM,yBAAS,IAAI,IAAI;CAAC;CAAS;CAAe;CAAoB;AAAuB,CAAC;AAI5F,IAAM,YAAY,UAAmC,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;;AAGxH,SAAS,OAAO,OAAmB,IAA8B;CAChE,MAAM,OAAc,EAAE,GAAG,MAAM;CAC/B,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,GAAG;EAC9D,MAAM,QAAQ,QAAQ;EACtB,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,OAAO,UAAU,aAAc,KAAM,MAAiC,EAAE,IAAI,KAAA,IAAa;EACtG,IAAI,SAAS,KAAA,GAAW;EACxB,MAAM,CAAC,MAAM,QAAQ;EACrB,MAAM,OAAO,SAAS,WAAW,CAAC,CAAC,OAAO,SAAS,QAAS,SAAS,QAAQ,QAAQ,KAAA,IAAa;EAClG,IAAI,SAAS,KAAA,GAAW;EACxB,IAAI,KAAK;EACT,KAAK,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,GAAG;GACpC,GAAG,OAAO,EAAE,GAAI,GAAG,KAA2B;GAC9C,KAAK,GAAG;EACT;EACA,MAAM,MAAM,KAAK,KAAK,SAAS;EAC/B,IAAI,GAAG,SAAS,KAAA,GAAW,GAAG,OAAO;CACtC;CACA,OAAO;AACR;;AAGA,SAAS,KAAK,OAAc,OAAc,MAAqB;CAC9D,MAAM,SAAgB,EAAE,GAAG,MAAM;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EACjD,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,KAAK,OAAO,GAAG,KAAK,GAAG,QAAQ;EACrC,MAAM,QAAQ,OAAO;EACrB,IAAI,MAAM,IAAI,EAAE,KAAK,MAAM,QAAQ,KAAK,GAAG,OAAO,OAAO,CAAC,GAAK,SAAmC,CAAC,GAAI,GAAG,KAAK;OAC1G,KAAK,OAAO,IAAI,EAAE,KAAK,CAAC,SAAS,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG,OAAO,OAAO,KAAK,OAAO,OAAO,EAAE;OACxG,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;OACjD,OAAO,OAAO;CACpB;CACA,OAAO;AACR;;;;;;;AAQA,SAAgB,gBAAgB,QAA6C,IAAwB;CACpG,IAAI,WAAkB,CAAC;CACvB,KAAK,MAAM,SAAS,QAAQ,IAAI,OAAO,WAAW,KAAK,UAAU,OAAO,OAAO,EAAE,GAAG,EAAE;CAEtF,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,OAAO,OAAO,GAAG;EAClD,IAAI,SAAS,SAAS;EACtB,MAAM,OAAO,SAAS,KAAK;EAC3B,IAAI,OAAO,KAAK,QAAQ,MAAM,SAAS,KAAK,MAAM;GAAE,GAAG;IAAO,KAAK,KAAK,KAAA;EAAU;CACnF;CACA,OAAO;AACR"}

package/dist/ai/squads.d.ts

@@ -81,7 +81,9 @@ export interface SquadData {
  * @beta
  */
 export interface SquadsMemory {
+    /** The version of the memory's format: 1 so far */
     v: 1;
+    /** Each squad's data */
     squads: SquadData[];
 }
 /**
@@ -90,13 +92,19 @@ export interface SquadsMemory {
  * @beta
  */
 export interface SquadReport {
+    /** The squad's name, by which it is found (`ai.squads.named`) */
     name: string;
+    /** What holds the squad: the module or goal that made it */
     owner: string;
+    /** The entity ids of its units */
     units: number[];
+    /** How strong its units are together */
     strength: number;
     /** Its middle */
     at?: [number, number];
+    /** How many units it has */
     size: number;
+    /** Its task: the kind, the phase it is in, since when, where, and how it ended once done */
     task?: {
         kind: string;
         phase: string;
@@ -104,7 +112,9 @@ export interface SquadReport {
         at?: [number, number];
         done?: TaskDone;
     };
+    /** How many times it retreated */
     retreats: number;
+    /** The tick its task last changed and why */
     changed?: {
         tick: number;
         why: string;
@@ -167,6 +177,7 @@ export declare class Squad {
      * What it was doing is over. Its first orders go at once; the squads module watches it from then on
      */
     task<D extends object, M extends object>(def: TaskDef<D, M>, data: D & TaskCommon): this;
+    /** Gives the squad a task of a game's own, by its definition and data; what it was doing is over and the squad is returned */
     task(kind: string, data?: TaskData): this;
     /** Ends its task, saying how: what a task's `think` calls once it is over */
     finish(done: TaskDone): void;
@@ -237,12 +248,12 @@ export declare class Squad {
     /** Sends its units an order (`move`, `hold`, the game's), all or some of them: counted as the task's last */
     order(order: OrderInit, units?: readonly number[], queue?: boolean): void;
     /**
-     * Puts its units, all or some, in a stance, where the game has stances (`withStances`): those not in it already. A
+     * Puts its units, all or some, in a stance, where the game has stances (`stancesPack`): those not in it already. A
      * squad that holds is defensive, one sent to fight aggressive
      */
     setStance(id: string, units?: readonly number[]): void;
     /**
-     * Sends its units to take a capture point of the game's (`withCapture`), by its id: they fight their way in and
+     * Sends its units to take a capture point of the game's (`capturePack`), by its id: they fight their way in and
      * stand in it until it is theirs (`captured`), or it is gone (`lost`)
      */
     capture(id: string): this;
@@ -275,6 +286,7 @@ export declare class SquadGroup implements Iterable<Squad> {
     ai: Brain, 
     /** The squads */
     squads: readonly Squad[]);
+    /** Iterates the squads, so that the set reads as a list */
     [Symbol.iterator](): Iterator<Squad>;
     /** How many squads */
     get length(): number;
@@ -284,14 +296,20 @@ export declare class SquadGroup implements Iterable<Squad> {
     strength(): number;
     /** Each given the same task */
     task<D extends object, M extends object>(def: TaskDef<D, M>, data: D & TaskCommon): this;
+    /** Gives each squad the same task, by its kind and data, and returns the set */
     task(kind: string, data?: TaskData): this;
+    /** Tells each squad to attack a point, an entity or an entity id, as `Squad.attack` does, and returns the set */
     attack(target: Vec2 | EntityState | number, options?: {
         avoid?: 'army' | false;
         then?: TaskOrder;
     }): this;
+    /** Tells each squad to defend a place within a radius as `Squad.defend` does; does nothing without a place; returns the set */
     defend(at: Vec2 | undefined, radius?: number): this;
+    /** Tells each squad to hold at a place, or where it is, as `Squad.hold` does, and returns the set */
     hold(at?: Vec2): this;
+    /** Tells each squad to move to a point as `Squad.move` does, and returns the set */
     move(at: Vec2): this;
+    /** Tells each squad to retreat to a point, or home when left out, as `Squad.retreat` does, and returns the set */
     retreat(to?: Vec2): this;
     /** Each disbanded */
     disband(why?: string): void;
@@ -410,6 +428,7 @@ export declare class Squads implements AiArea {
     /** What the squads are, for a save: copies */
     /** Whether it has anything to remember now: one that does not is left out of a save */
     remembers(): boolean;
+    /** Gives the squads' data as plain data for a save of the brain */
     save(): SquadsMemory;
     /** Takes back what `save` gave: whether it was read. A squad on a task the brain does not know is kept, and does nothing */
     restore(memory: unknown): boolean;