@v12-engine/engine 0.1.0 → 0.4.0

package/dist/ai/plans/purse.js

@@ -0,0 +1,139 @@
+//#region src/ai/plans/purse.ts
+/**
+* What a computer player has to spend this think (`ai.purse`): its resources less what is promised and held, spent
+* through `spend`. Rebuilt from the picture each think
+*
+* @beta
+*/
+var Purse = class {
+	/** What is free to spend now, by resource: less with every `spend` and `reserve` of the think. `view.me.purse` is this */
+	free = {};
+	/** What builders on their way to a site will pay as they get there, by resource */
+	promised = {};
+	/** What was paid this think (`spend`), by resource: with `promised`, never more than the picture's resources (`ai/checks.ts`) */
+	spent = {};
+	/** The resource most things cost (`Registry.currency`): what `affords` keeps `spare` of */
+	money;
+	holds = {};
+	constructor(registry) {
+		this.money = registry.currency ?? registry.resources[0]?.id ?? "";
+	}
+	/**
+	* Starts the think's ledger from the picture: the player's resources, less what its builders on their way will pay
+	* (`promised`). Every hold of the think before is dropped: whoever still wants one makes it again
+	*/
+	begin(view) {
+		this.free = { ...view.me.resources };
+		this.promised = {};
+		this.spent = {};
+		this.holds = {};
+		const { registry } = view;
+		for (const entity of view.mine) {
+			const own = entity.own;
+			if (own?.order !== "build" || !own.build || !registry.units.has(own.build)) continue;
+			const cost = registry.unit(own.build).cost;
+			for (const kind in cost) {
+				this.promised[kind] = (this.promised[kind] ?? 0) + cost[kind];
+				this.free[kind] = (this.free[kind] ?? 0) - cost[kind];
+			}
+		}
+	}
+	/** What someone this important may spend: what is free, and what is held by anyone less important */
+	available(priority = 0) {
+		const sum = { ...this.free };
+		for (const id in this.holds) {
+			const hold = this.holds[id];
+			if (hold.priority >= priority) continue;
+			for (const kind in hold.cost) sum[kind] = (sum[kind] ?? 0) + hold.cost[kind];
+		}
+		return sum;
+	}
+	/** The resource a cost is short of, out of what someone this important may spend: none when it can be paid */
+	shortOf(cost, priority = 0) {
+		const available = this.available(priority);
+		for (const kind in cost) if ((available[kind] ?? 0) < cost[kind]) return kind;
+	}
+	/**
+	* Whether a cost can be paid by someone this important, with `spare` of the money left over after it (a luxury
+	* waits for gold to spare): out of what is free, and what is held by anyone less important
+	*/
+	affords(cost, spare = 0, priority = 0) {
+		return this.shortOf(cost, priority) === void 0 && (this.available(priority)[this.money] ?? 0) >= (cost?.[this.money] ?? 0) + spare;
+	}
+	/**
+	* Pays a cost, for a command sent this think: out of what is free first, then out of what is held by anyone less
+	* important (the least important first), whose holds are less by that much. False, and nothing paid, when it cannot be
+	*/
+	spend(cost, priority = 0) {
+		if (this.shortOf(cost, priority) !== void 0) return false;
+		const lesser = Object.keys(this.holds).filter((id) => this.holds[id].priority < priority).sort((a, b) => this.holds[a].priority - this.holds[b].priority);
+		for (const kind in cost) {
+			let owed = cost[kind];
+			this.spent[kind] = (this.spent[kind] ?? 0) + owed;
+			const free = this.free[kind] ?? 0;
+			const fromFree = Math.min(owed, Math.max(0, free));
+			this.free[kind] = free - fromFree;
+			owed -= fromFree;
+			for (const id of lesser) {
+				if (owed <= 0) break;
+				const held = this.holds[id].cost[kind] ?? 0;
+				const taken = Math.min(owed, held);
+				this.holds[id].cost[kind] = held - taken;
+				owed -= taken;
+			}
+			if (owed > 0) this.free[kind] = (this.free[kind] ?? 0) - owed;
+		}
+		return true;
+	}
+	/**
+	* Holds a cost aside under a name (a goal's id, a want's) for the rest of the think, with how important the holder
+	* is (0 when left out): what is free is less by it, so that nothing less important spends what is saved up. Made
+	* again each think by whoever still saves; a second hold under the same name replaces the first
+	*/
+	reserve(id, cost, priority = 0) {
+		this.release(id);
+		this.holds[id] = {
+			cost: { ...cost },
+			priority
+		};
+		for (const kind in cost) this.free[kind] = (this.free[kind] ?? 0) - cost[kind];
+	}
+	/** Lets a hold go: what it held is free again this think */
+	release(id) {
+		const held = this.holds[id];
+		if (!held) return;
+		delete this.holds[id];
+		for (const kind in held.cost) this.free[kind] = (this.free[kind] ?? 0) + held.cost[kind];
+	}
+	/** What is held under a name */
+	reservation(id) {
+		return this.holds[id]?.cost;
+	}
+	/** What is held altogether, by resource */
+	reserved() {
+		const sum = {};
+		for (const id in this.holds) for (const kind in this.holds[id].cost) sum[kind] = (sum[kind] ?? 0) + this.holds[id].cost[kind];
+		return sum;
+	}
+	/** Every hold, by name: what and how important */
+	holdings() {
+		return this.holds;
+	}
+	/** The ledger for the report: what is free, what is promised, what is held and by whom */
+	inspect() {
+		const held = {};
+		for (const id in this.holds) held[id] = {
+			cost: { ...this.holds[id].cost },
+			priority: this.holds[id].priority
+		};
+		return {
+			free: { ...this.free },
+			promised: { ...this.promised },
+			held
+		};
+	}
+};
+//#endregion
+export { Purse };
+
+//# sourceMappingURL=purse.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"purse.js","names":[],"sources":["../../../src/ai/plans/purse.ts"],"sourcesContent":["import type { Cost, ResourceId } from '#engine/defs'\nimport type { Registry } from '#engine/registry'\nimport type { AiView } from '#engine/ai/view'\n\n/*\n * The purse (AI plan, B3): the one ledger a computer player spends through. Commands land next tick, so a think that\n * sent a worker to build a barracks still sees the gold in its next picture; and a building is paid for as its builder\n * arrives, not as it is sent. Without a ledger the same gold is spent twice. The purse is rebuilt from the picture at\n * the start of every think (`begin`): the player's resources, less what builders on their way will pay (`promised`),\n * less what is held (`reserve`: a goal's money claim, a want of the build plan saving up for a hall). What is left is\n * `free`, and everything that spends (`spend`) takes it off `free` for the rest of the think. Nothing is carried from\n * one think to the next: a hold belongs to whoever made it and is made again each think while they still want it, so\n * nothing can be promised twice or held for ever.\n *\n * A hold has a priority, as a want does: saving up for a hero does not stop the hall going up, and does stop the\n * footmen. Whoever asks the purse says how important they are (`affords(cost, spare, priority)`), and may spend what\n * is held by anyone less important; a hold spent into is less by that much for the rest of the think.\n */\n\n/**\n * What a computer player has to spend this think (`ai.purse`): its resources less what is promised and held, spent\n * through `spend`. Rebuilt from the picture each think\n *\n * @beta\n */\nexport class Purse {\n\t/** What is free to spend now, by resource: less with every `spend` and `reserve` of the think. `view.me.purse` is this */\n\tfree: Cost = {}\n\t/** What builders on their way to a site will pay as they get there, by resource */\n\tpromised: Cost = {}\n\t/** What was paid this think (`spend`), by resource: with `promised`, never more than the picture's resources (`ai/checks.ts`) */\n\tspent: Cost = {}\n\t/** The resource most things cost (`Registry.currency`): what `affords` keeps `spare` of */\n\treadonly money: ResourceId\n\tprivate holds: Record<string, { cost: Cost; priority: number }> = {}\n\n\tconstructor(registry: Registry) {\n\t\tthis.money = registry.currency ?? registry.resources[0]?.id ?? ''\n\t}\n\n\t/**\n\t * Starts the think's ledger from the picture: the player's resources, less what its builders on their way will pay\n\t * (`promised`). Every hold of the think before is dropped: whoever still wants one makes it again\n\t */\n\tbegin(view: AiView): void {\n\t\tthis.free = { ...view.me.resources }\n\t\tthis.promised = {}\n\t\tthis.spent = {}\n\t\tthis.holds = {}\n\t\tconst { registry } = view\n\t\tfor (const entity of view.mine) {\n\t\t\tconst own = entity.own\n\t\t\tif (own?.order !== 'build' || !own.build || !registry.units.has(own.build)) continue\n\t\t\tconst cost = registry.unit(own.build).cost\n\t\t\tfor (const kind in cost) {\n\t\t\t\tthis.promised[kind] = (this.promised[kind] ?? 0) + cost[kind]\n\t\t\t\tthis.free[kind] = (this.free[kind] ?? 0) - cost[kind]\n\t\t\t}\n\t\t}\n\t}\n\n\t/** What someone this important may spend: what is free, and what is held by anyone less important */\n\tavailable(priority = 0): Cost {\n\t\tconst sum: Cost = { ...this.free }\n\t\tfor (const id in this.holds) {\n\t\t\tconst hold = this.holds[id]\n\t\t\tif (hold.priority >= priority) continue\n\t\t\tfor (const kind in hold.cost) sum[kind] = (sum[kind] ?? 0) + hold.cost[kind]\n\t\t}\n\t\treturn sum\n\t}\n\n\t/** The resource a cost is short of, out of what someone this important may spend: none when it can be paid */\n\tshortOf(cost: Cost | undefined, priority = 0): ResourceId | undefined {\n\t\tconst available = this.available(priority)\n\t\tfor (const kind in cost) if ((available[kind] ?? 0) < cost[kind]) return kind\n\t\treturn undefined\n\t}\n\n\t/**\n\t * Whether a cost can be paid by someone this important, with `spare` of the money left over after it (a luxury\n\t * waits for gold to spare): out of what is free, and what is held by anyone less important\n\t */\n\taffords(cost: Cost | undefined, spare = 0, priority = 0): boolean {\n\t\treturn this.shortOf(cost, priority) === undefined && (this.available(priority)[this.money] ?? 0) >= (cost?.[this.money] ?? 0) + spare\n\t}\n\n\t/**\n\t * Pays a cost, for a command sent this think: out of what is free first, then out of what is held by anyone less\n\t * important (the least important first), whose holds are less by that much. False, and nothing paid, when it cannot be\n\t */\n\tspend(cost: Cost | undefined, priority = 0): boolean {\n\t\tif (this.shortOf(cost, priority) !== undefined) return false\n\t\tconst lesser = Object.keys(this.holds)\n\t\t\t.filter((id) => this.holds[id].priority < priority)\n\t\t\t.sort((a, b) => this.holds[a].priority - this.holds[b].priority)\n\t\tfor (const kind in cost) {\n\t\t\tlet owed = cost[kind]\n\t\t\tthis.spent[kind] = (this.spent[kind] ?? 0) + owed\n\t\t\tconst free = this.free[kind] ?? 0\n\t\t\tconst fromFree = Math.min(owed, Math.max(0, free))\n\t\t\tthis.free[kind] = free - fromFree\n\t\t\towed -= fromFree\n\t\t\tfor (const id of lesser) {\n\t\t\t\tif (owed <= 0) break\n\t\t\t\tconst held = this.holds[id].cost[kind] ?? 0\n\t\t\t\tconst taken = Math.min(owed, held)\n\t\t\t\tthis.holds[id].cost[kind] = held - taken\n\t\t\t\towed -= taken\n\t\t\t}\n\t\t\t// what the lesser holds did not cover goes on the free side, under nothing: `shortOf` said it is there\n\t\t\tif (owed > 0) this.free[kind] = (this.free[kind] ?? 0) - owed\n\t\t}\n\t\treturn true\n\t}\n\n\t/**\n\t * Holds a cost aside under a name (a goal's id, a want's) for the rest of the think, with how important the holder\n\t * is (0 when left out): what is free is less by it, so that nothing less important spends what is saved up. Made\n\t * again each think by whoever still saves; a second hold under the same name replaces the first\n\t */\n\treserve(id: string, cost: Cost, priority = 0): void {\n\t\tthis.release(id)\n\t\tthis.holds[id] = { cost: { ...cost }, priority }\n\t\tfor (const kind in cost) this.free[kind] = (this.free[kind] ?? 0) - cost[kind]\n\t}\n\n\t/** Lets a hold go: what it held is free again this think */\n\trelease(id: string): void {\n\t\tconst held = this.holds[id]\n\t\tif (!held) return\n\t\tdelete this.holds[id]\n\t\tfor (const kind in held.cost) this.free[kind] = (this.free[kind] ?? 0) + held.cost[kind]\n\t}\n\n\t/** What is held under a name */\n\treservation(id: string): Readonly<Cost> | undefined {\n\t\treturn this.holds[id]?.cost\n\t}\n\n\t/** What is held altogether, by resource */\n\treserved(): Cost {\n\t\tconst sum: Cost = {}\n\t\tfor (const id in this.holds) for (const kind in this.holds[id].cost) sum[kind] = (sum[kind] ?? 0) + this.holds[id].cost[kind]\n\t\treturn sum\n\t}\n\n\t/** Every hold, by name: what and how important */\n\tholdings(): Readonly<Record<string, { cost: Readonly<Cost>; priority: number }>> {\n\t\treturn this.holds\n\t}\n\n\t/** The ledger for the report: what is free, what is promised, what is held and by whom */\n\tinspect(): PurseReport {\n\t\tconst held: PurseReport['held'] = {}\n\t\tfor (const id in this.holds) held[id] = { cost: { ...this.holds[id].cost }, priority: this.holds[id].priority }\n\t\treturn { free: { ...this.free }, promised: { ...this.promised }, held }\n\t}\n}\n\n/**\n * The purse as the report shows it: what is free, what builders on their way will pay, what is held and by whom, with\n * how important each holder is\n *\n * @beta\n */\nexport interface PurseReport {\n\t/** What the player has that nothing holds or has promised */\n\tfree: Cost\n\t/** What builders on their way will pay */\n\tpromised: Cost\n\t/** What is held, by the id of the holder, with its cost and how important the holder is */\n\theld: Record<string, { cost: Cost; priority: number }>\n}\n"],"mappings":";;;;;;;AAyBA,IAAa,QAAb,MAAmB;;CAElB,OAAa,CAAC;;CAEd,WAAiB,CAAC;;CAElB,QAAc,CAAC;;CAEf;CACA,QAAkE,CAAC;CAEnE,YAAY,UAAoB;EAC/B,KAAK,QAAQ,SAAS,YAAY,SAAS,UAAU,EAAE,EAAE,MAAM;CAChE;;;;;CAMA,MAAM,MAAoB;EACzB,KAAK,OAAO,EAAE,GAAG,KAAK,GAAG,UAAU;EACnC,KAAK,WAAW,CAAC;EACjB,KAAK,QAAQ,CAAC;EACd,KAAK,QAAQ,CAAC;EACd,MAAM,EAAE,aAAa;EACrB,KAAK,MAAM,UAAU,KAAK,MAAM;GAC/B,MAAM,MAAM,OAAO;GACnB,IAAI,KAAK,UAAU,WAAW,CAAC,IAAI,SAAS,CAAC,SAAS,MAAM,IAAI,IAAI,KAAK,GAAG;GAC5E,MAAM,OAAO,SAAS,KAAK,IAAI,KAAK,CAAC,CAAC;GACtC,KAAK,MAAM,QAAQ,MAAM;IACxB,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,KAAK;IACxD,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK;GACjD;EACD;CACD;;CAGA,UAAU,WAAW,GAAS;EAC7B,MAAM,MAAY,EAAE,GAAG,KAAK,KAAK;EACjC,KAAK,MAAM,MAAM,KAAK,OAAO;GAC5B,MAAM,OAAO,KAAK,MAAM;GACxB,IAAI,KAAK,YAAY,UAAU;GAC/B,KAAK,MAAM,QAAQ,KAAK,MAAM,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,KAAK;EACxE;EACA,OAAO;CACR;;CAGA,QAAQ,MAAwB,WAAW,GAA2B;EACrE,MAAM,YAAY,KAAK,UAAU,QAAQ;EACzC,KAAK,MAAM,QAAQ,MAAM,KAAK,UAAU,SAAS,KAAK,KAAK,OAAO,OAAO;CAE1E;;;;;CAMA,QAAQ,MAAwB,QAAQ,GAAG,WAAW,GAAY;EACjE,OAAO,KAAK,QAAQ,MAAM,QAAQ,MAAM,KAAA,MAAc,KAAK,UAAU,QAAQ,CAAC,CAAC,KAAK,UAAU,OAAO,OAAO,KAAK,UAAU,KAAK;CACjI;;;;;CAMA,MAAM,MAAwB,WAAW,GAAY;EACpD,IAAI,KAAK,QAAQ,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;EACvD,MAAM,SAAS,OAAO,KAAK,KAAK,KAAK,CAAC,CACpC,QAAQ,OAAO,KAAK,MAAM,GAAG,CAAC,WAAW,QAAQ,CAAC,CAClD,MAAM,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,WAAW,KAAK,MAAM,EAAE,CAAC,QAAQ;EAChE,KAAK,MAAM,QAAQ,MAAM;GACxB,IAAI,OAAO,KAAK;GAChB,KAAK,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK;GAC7C,MAAM,OAAO,KAAK,KAAK,SAAS;GAChC,MAAM,WAAW,KAAK,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;GACjD,KAAK,KAAK,QAAQ,OAAO;GACzB,QAAQ;GACR,KAAK,MAAM,MAAM,QAAQ;IACxB,IAAI,QAAQ,GAAG;IACf,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,KAAK,SAAS;IAC1C,MAAM,QAAQ,KAAK,IAAI,MAAM,IAAI;IACjC,KAAK,MAAM,GAAG,CAAC,KAAK,QAAQ,OAAO;IACnC,QAAQ;GACT;GAEA,IAAI,OAAO,GAAG,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK;EAC1D;EACA,OAAO;CACR;;;;;;CAOA,QAAQ,IAAY,MAAY,WAAW,GAAS;EACnD,KAAK,QAAQ,EAAE;EACf,KAAK,MAAM,MAAM;GAAE,MAAM,EAAE,GAAG,KAAK;GAAG;EAAS;EAC/C,KAAK,MAAM,QAAQ,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK;CAC1E;;CAGA,QAAQ,IAAkB;EACzB,MAAM,OAAO,KAAK,MAAM;EACxB,IAAI,CAAC,MAAM;EACX,OAAO,KAAK,MAAM;EAClB,KAAK,MAAM,QAAQ,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,KAAK;CACpF;;CAGA,YAAY,IAAwC;EACnD,OAAO,KAAK,MAAM,GAAG,EAAE;CACxB;;CAGA,WAAiB;EAChB,MAAM,MAAY,CAAC;EACnB,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG,CAAC,MAAM,IAAI,SAAS,IAAI,SAAS,KAAK,KAAK,MAAM,GAAG,CAAC,KAAK;EACxH,OAAO;CACR;;CAGA,WAAiF;EAChF,OAAO,KAAK;CACb;;CAGA,UAAuB;EACtB,MAAM,OAA4B,CAAC;EACnC,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,MAAM;GAAE,MAAM,EAAE,GAAG,KAAK,MAAM,GAAG,CAAC,KAAK;GAAG,UAAU,KAAK,MAAM,GAAG,CAAC;EAAS;EAC9G,OAAO;GAAE,MAAM,EAAE,GAAG,KAAK,KAAK;GAAG,UAAU,EAAE,GAAG,KAAK,SAAS;GAAG;EAAK;CACvE;AACD"}

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

@@ -6,10 +6,13 @@ import type { AiView } from '#engine/ai/view';
  * @beta
  */
 export interface TechStep {
+    /** The unit type id the step is on */
     type: string;
+    /** How it is made: built by a worker, turned into from another type (`morph`) or trained at a building */
     how: 'build' | 'morph' | 'train';
     /** For a `morph`, the type that turns into it; for a `train`, the type that trains it; for a `build`, the type that builds it */
     from: string;
+    /** The type the step is on the way to */
     for: string;
 }
 /**
@@ -21,8 +24,11 @@ export interface TechStep {
  * @beta
  */
 export interface TechPath {
+    /** The steps in the order they can be taken, the type itself not among them */
     steps: TechStep[];
+    /** The definitions that go round in a circle, where they do */
     cycle?: string[];
+    /** The type nothing of the player's can make, where there is one */
     impossible?: string;
 }
 /**

package/dist/ai/plans/tech.js

@@ -0,0 +1,122 @@
+import { upgradesOf } from "../../defs.js";
+import { availableToPlayer } from "../../shared.js";
+//#region src/ai/plans/tech.ts
+/**
+* How a type is made, by the player's definitions: built by a worker type, turned into from another type, or trained
+* at a building type; nothing for a type nothing of the player's race makes (a creep's hut). Of the makers, one the
+* player has first, then the first in the game's order
+*
+* @internal
+*/
+function makerOf(view, type) {
+	const { registry, me } = view;
+	if (!registry.units.has(type)) return void 0;
+	const def = registry.unit(type);
+	const may = (maker) => availableToPlayer(maker, {
+		race: me.race,
+		availability: me.availability
+	}, maker.id);
+	const owned = (maker) => view.mine.ofType(maker.id).length > 0;
+	const pick = (makers) => makers.find(owned) ?? makers[0];
+	const all = registry.units.all().filter(may);
+	if (def.kind === "building") {
+		const builders = all.filter((maker) => maker.kind === "unit" && maker.builds?.includes(type));
+		if (builders.length) return {
+			how: "build",
+			from: pick(builders).id
+		};
+		const befores = all.filter((maker) => upgradesOf(maker).includes(type));
+		if (befores.length) return {
+			how: "morph",
+			from: pick(befores).id
+		};
+		return;
+	}
+	if (def.kind === "unit") {
+		const trainers = all.filter((maker) => maker.kind === "building" && maker.trains?.includes(type));
+		if (trainers.length) return {
+			how: "train",
+			from: pick(trainers).id
+		};
+	}
+}
+/**
+* The steps from what the player has to being able to make a type: what it requires that it lacks, each of those in
+* turn, and the type's maker where it has none (the hall that trains the worker, the worker that builds the barracks,
+* the hall that turns into the keep). What stands finished (`view.me.tech`, with what it counts as) or is on its way
+* (`onItsWay`: under construction, a builder sent, a morph queued) is had already. A requirement no type has as its
+* id is met by a type that provides it
+*
+* @beta
+*/
+function techPath(view, target, onItsWay = () => false) {
+	const { registry, me } = view;
+	const steps = [];
+	const planned = /* @__PURE__ */ new Set();
+	const visiting = /* @__PURE__ */ new Set();
+	const path = { steps };
+	const may = (def) => availableToPlayer(def, {
+		race: me.race,
+		availability: me.availability
+	}, def.id);
+	const have = (id) => me.tech.includes(id) || view.mine.ofType(id).length > 0 || onItsWay(id);
+	/** Whether a requirement is met, or will be by a step planned already (a planned keep provides the town hall) */
+	const covered = (id) => have(id) || planned.has(id) || [...planned].some((type) => registry.units.has(type) && registry.unit(type).provides?.includes(id));
+	/** What is to be made for a requirement: the type itself, or the first type the player may make that provides it */
+	const typeFor = (id) => {
+		if (registry.units.has(id) && makerOf(view, id)) return id;
+		return registry.units.all().find((def) => may(def) && def.provides?.includes(id) && makerOf(view, def.id))?.id;
+	};
+	const need = (id, forWhat) => {
+		if (covered(id)) return true;
+		const type = typeFor(id);
+		if (type === void 0) {
+			path.impossible = id;
+			return false;
+		}
+		if (type !== id && covered(type)) return true;
+		if (visiting.has(type)) {
+			path.cycle = [...visiting, type];
+			return false;
+		}
+		visiting.add(type);
+		const def = registry.unit(type);
+		for (const required of def.requires ?? []) if (!need(required, type)) return false;
+		const maker = makerOf(view, type);
+		if (!have(maker.from) && !need(maker.from, type)) return false;
+		visiting.delete(type);
+		planned.add(type);
+		steps.push({
+			type,
+			...maker,
+			for: forWhat
+		});
+		return true;
+	};
+	if (!registry.units.has(target)) {
+		path.impossible = target;
+		return path;
+	}
+	const def = registry.unit(target);
+	for (const required of def.requires ?? []) if (!need(required, target)) return path;
+	const maker = makerOf(view, target);
+	if (!maker) {
+		path.impossible = target;
+		return path;
+	}
+	if (!have(maker.from)) need(maker.from, target);
+	return path;
+}
+/**
+* A tech path's trouble in words, for the report and the log: nothing for a path with none
+*
+* @internal
+*/
+function techTrouble(path) {
+	if (path.cycle) return `each needs another it does not have, so nothing can start it: ${path.cycle.join(" → ")} (a game whose definitions go round like this needs one of them to start with; a player that lost them all cannot make them again)`;
+	if (path.impossible !== void 0) return `nothing of its own makes ${path.impossible}`;
+}
+//#endregion
+export { makerOf, techPath, techTrouble };
+
+//# sourceMappingURL=tech.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tech.js","names":[],"sources":["../../../src/ai/plans/tech.ts"],"sourcesContent":["import { type UnitTypeDef, upgradesOf } from '#engine/defs'\nimport { availableToPlayer } from '#engine/shared'\nimport type { AiView } from '#engine/ai/view'\n\n/*\n * The tech path (AI plan, B3): how a computer player gets from what it has to what it wants. \"I want gryphons\" is,\n * to the definitions, \"gryphons are trained at an aviary, which needs a keep and a lumber mill; a keep is what a town\n * hall turns into\". Nothing here knows those names: it reads `requires` (what must stand finished), `trains` and\n * `builds` (who makes what), `upgradesTo` (what turns into what, one or several) and `provides` (what counts as what: a keep is a town\n * hall too) and walks them back from the wanted type to the player's tech, giving the steps in the order they can be\n * taken. `requires` is a list that must all hold; there is no \"either\" form. A cycle in a game's definitions (a\n * building that requires what it provides) is refused with a message naming it, rather than walked for ever\n */\n\n/**\n * One step towards a type: a building to build (by a worker), a building to turn another into (`morph`, from the\n * type that turns into it), or a unit to train (at the type that trains it). `for` is what the step is on the way to\n *\n * @beta\n */\nexport interface TechStep {\n\t/** The unit type id the step is on */\n\ttype: string\n\t/** How it is made: built by a worker, turned into from another type (`morph`) or trained at a building */\n\thow: 'build' | 'morph' | 'train'\n\t/** For a `morph`, the type that turns into it; for a `train`, the type that trains it; for a `build`, the type that builds it */\n\tfrom: string\n\t/** The type the step is on the way to */\n\tfor: string\n}\n\n/**\n * The steps from what the player has to being able to make a type (`techPath`): the prerequisites, the producer, in\n * the order they can be taken; the type itself is not among them. `cycle` names the definitions that go round in a\n * circle where they do, `impossible` the type nothing of the player's can make, and the steps are then as far as the\n * walk got\n *\n * @beta\n */\nexport interface TechPath {\n\t/** The steps in the order they can be taken, the type itself not among them */\n\tsteps: TechStep[]\n\t/** The definitions that go round in a circle, where they do */\n\tcycle?: string[]\n\t/** The type nothing of the player's can make, where there is one */\n\timpossible?: string\n}\n\n/**\n * How a type is made, by the player's definitions: built by a worker type, turned into from another type, or trained\n * at a building type; nothing for a type nothing of the player's race makes (a creep's hut). Of the makers, one the\n * player has first, then the first in the game's order\n *\n * @internal\n */\nexport function makerOf(view: AiView, type: string): Pick<TechStep, 'how' | 'from'> | undefined {\n\tconst { registry, me } = view\n\tif (!registry.units.has(type)) return undefined\n\tconst def = registry.unit(type)\n\tconst may = (maker: UnitTypeDef) => availableToPlayer(maker, { race: me.race, availability: me.availability }, maker.id)\n\tconst owned = (maker: UnitTypeDef) => view.mine.ofType(maker.id).length > 0\n\tconst pick = (makers: UnitTypeDef[]) => makers.find(owned) ?? makers[0]\n\tconst all = registry.units.all().filter(may)\n\tif (def.kind === 'building') {\n\t\tconst builders = all.filter((maker) => maker.kind === 'unit' && maker.builds?.includes(type))\n\t\tif (builders.length) return { how: 'build', from: pick(builders).id }\n\t\tconst befores = all.filter((maker) => upgradesOf(maker).includes(type))\n\t\tif (befores.length) return { how: 'morph', from: pick(befores).id }\n\t\treturn undefined\n\t}\n\tif (def.kind === 'unit') {\n\t\tconst trainers = all.filter((maker) => maker.kind === 'building' && maker.trains?.includes(type))\n\t\tif (trainers.length) return { how: 'train', from: pick(trainers).id }\n\t}\n\treturn undefined\n}\n\n/**\n * The steps from what the player has to being able to make a type: what it requires that it lacks, each of those in\n * turn, and the type's maker where it has none (the hall that trains the worker, the worker that builds the barracks,\n * the hall that turns into the keep). What stands finished (`view.me.tech`, with what it counts as) or is on its way\n * (`onItsWay`: under construction, a builder sent, a morph queued) is had already. A requirement no type has as its\n * id is met by a type that provides it\n *\n * @beta\n */\nexport function techPath(view: AiView, target: string, onItsWay: (type: string) => boolean = () => false): TechPath {\n\tconst { registry, me } = view\n\tconst steps: TechStep[] = []\n\tconst planned = new Set<string>()\n\tconst visiting = new Set<string>()\n\tconst path: TechPath = { steps }\n\tconst may = (def: UnitTypeDef) => availableToPlayer(def, { race: me.race, availability: me.availability }, def.id)\n\tconst have = (id: string) => me.tech.includes(id) || view.mine.ofType(id).length > 0 || onItsWay(id)\n\t/** Whether a requirement is met, or will be by a step planned already (a planned keep provides the town hall) */\n\tconst covered = (id: string) =>\n\t\thave(id) || planned.has(id) || [...planned].some((type) => registry.units.has(type) && registry.unit(type).provides?.includes(id))\n\n\t/** What is to be made for a requirement: the type itself, or the first type the player may make that provides it */\n\tconst typeFor = (id: string): string | undefined => {\n\t\tif (registry.units.has(id) && makerOf(view, id)) return id\n\t\tconst provider = registry.units.all().find((def) => may(def) && def.provides?.includes(id) && makerOf(view, def.id))\n\t\treturn provider?.id\n\t}\n\n\tconst need = (id: string, forWhat: string): boolean => {\n\t\tif (covered(id)) return true\n\t\tconst type = typeFor(id)\n\t\tif (type === undefined) {\n\t\t\tpath.impossible = id\n\t\t\treturn false\n\t\t}\n\t\tif (type !== id && covered(type)) return true\n\t\tif (visiting.has(type)) {\n\t\t\tpath.cycle = [...visiting, type]\n\t\t\treturn false\n\t\t}\n\t\tvisiting.add(type)\n\t\tconst def = registry.unit(type)\n\t\tfor (const required of def.requires ?? []) if (!need(required, type)) return false\n\t\tconst maker = makerOf(view, type)!\n\t\t// a morph turns what the player has (or will have) into it; a build needs a builder; a train a trainer\n\t\tif (!have(maker.from) && !need(maker.from, type)) return false\n\t\tvisiting.delete(type)\n\t\tplanned.add(type)\n\t\tsteps.push({ type, ...maker, for: forWhat })\n\t\treturn true\n\t}\n\n\tif (!registry.units.has(target)) {\n\t\tpath.impossible = target\n\t\treturn path\n\t}\n\tconst def = registry.unit(target)\n\tfor (const required of def.requires ?? []) if (!need(required, target)) return path\n\tconst maker = makerOf(view, target)\n\tif (!maker) {\n\t\tpath.impossible = target\n\t\treturn path\n\t}\n\tif (!have(maker.from)) need(maker.from, target)\n\treturn path\n}\n\n/**\n * A tech path's trouble in words, for the report and the log: nothing for a path with none\n *\n * @internal\n */\nexport function techTrouble(path: TechPath): string | undefined {\n\tif (path.cycle)\n\t\treturn `each needs another it does not have, so nothing can start it: ${path.cycle.join(' → ')} (a game whose definitions go round like this needs one of them to start with; a player that lost them all cannot make them again)`\n\tif (path.impossible !== undefined) return `nothing of its own makes ${path.impossible}`\n\treturn undefined\n}\n"],"mappings":";;;;;;;;;;AAuDA,SAAgB,QAAQ,MAAc,MAA0D;CAC/F,MAAM,EAAE,UAAU,OAAO;CACzB,IAAI,CAAC,SAAS,MAAM,IAAI,IAAI,GAAG,OAAO,KAAA;CACtC,MAAM,MAAM,SAAS,KAAK,IAAI;CAC9B,MAAM,OAAO,UAAuB,kBAAkB,OAAO;EAAE,MAAM,GAAG;EAAM,cAAc,GAAG;CAAa,GAAG,MAAM,EAAE;CACvH,MAAM,SAAS,UAAuB,KAAK,KAAK,OAAO,MAAM,EAAE,CAAC,CAAC,SAAS;CAC1E,MAAM,QAAQ,WAA0B,OAAO,KAAK,KAAK,KAAK,OAAO;CACrE,MAAM,MAAM,SAAS,MAAM,IAAI,CAAC,CAAC,OAAO,GAAG;CAC3C,IAAI,IAAI,SAAS,YAAY;EAC5B,MAAM,WAAW,IAAI,QAAQ,UAAU,MAAM,SAAS,UAAU,MAAM,QAAQ,SAAS,IAAI,CAAC;EAC5F,IAAI,SAAS,QAAQ,OAAO;GAAE,KAAK;GAAS,MAAM,KAAK,QAAQ,CAAC,CAAC;EAAG;EACpE,MAAM,UAAU,IAAI,QAAQ,UAAU,WAAW,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC;EACtE,IAAI,QAAQ,QAAQ,OAAO;GAAE,KAAK;GAAS,MAAM,KAAK,OAAO,CAAC,CAAC;EAAG;EAClE;CACD;CACA,IAAI,IAAI,SAAS,QAAQ;EACxB,MAAM,WAAW,IAAI,QAAQ,UAAU,MAAM,SAAS,cAAc,MAAM,QAAQ,SAAS,IAAI,CAAC;EAChG,IAAI,SAAS,QAAQ,OAAO;GAAE,KAAK;GAAS,MAAM,KAAK,QAAQ,CAAC,CAAC;EAAG;CACrE;AAED;;;;;;;;;;AAWA,SAAgB,SAAS,MAAc,QAAgB,iBAA4C,OAAiB;CACnH,MAAM,EAAE,UAAU,OAAO;CACzB,MAAM,QAAoB,CAAC;CAC3B,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,2BAAW,IAAI,IAAY;CACjC,MAAM,OAAiB,EAAE,MAAM;CAC/B,MAAM,OAAO,QAAqB,kBAAkB,KAAK;EAAE,MAAM,GAAG;EAAM,cAAc,GAAG;CAAa,GAAG,IAAI,EAAE;CACjH,MAAM,QAAQ,OAAe,GAAG,KAAK,SAAS,EAAE,KAAK,KAAK,KAAK,OAAO,EAAE,CAAC,CAAC,SAAS,KAAK,SAAS,EAAE;;CAEnG,MAAM,WAAW,OAChB,KAAK,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,SAAS,SAAS,MAAM,IAAI,IAAI,KAAK,SAAS,KAAK,IAAI,CAAC,CAAC,UAAU,SAAS,EAAE,CAAC;;CAGlI,MAAM,WAAW,OAAmC;EACnD,IAAI,SAAS,MAAM,IAAI,EAAE,KAAK,QAAQ,MAAM,EAAE,GAAG,OAAO;EAExD,OADiB,SAAS,MAAM,IAAI,CAAC,CAAC,MAAM,QAAQ,IAAI,GAAG,KAAK,IAAI,UAAU,SAAS,EAAE,KAAK,QAAQ,MAAM,IAAI,EAAE,CAC3G,CAAA,EAAU;CAClB;CAEA,MAAM,QAAQ,IAAY,YAA6B;EACtD,IAAI,QAAQ,EAAE,GAAG,OAAO;EACxB,MAAM,OAAO,QAAQ,EAAE;EACvB,IAAI,SAAS,KAAA,GAAW;GACvB,KAAK,aAAa;GAClB,OAAO;EACR;EACA,IAAI,SAAS,MAAM,QAAQ,IAAI,GAAG,OAAO;EACzC,IAAI,SAAS,IAAI,IAAI,GAAG;GACvB,KAAK,QAAQ,CAAC,GAAG,UAAU,IAAI;GAC/B,OAAO;EACR;EACA,SAAS,IAAI,IAAI;EACjB,MAAM,MAAM,SAAS,KAAK,IAAI;EAC9B,KAAK,MAAM,YAAY,IAAI,YAAY,CAAC,GAAG,IAAI,CAAC,KAAK,UAAU,IAAI,GAAG,OAAO;EAC7E,MAAM,QAAQ,QAAQ,MAAM,IAAI;EAEhC,IAAI,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,KAAK,MAAM,MAAM,IAAI,GAAG,OAAO;EACzD,SAAS,OAAO,IAAI;EACpB,QAAQ,IAAI,IAAI;EAChB,MAAM,KAAK;GAAE;GAAM,GAAG;GAAO,KAAK;EAAQ,CAAC;EAC3C,OAAO;CACR;CAEA,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,GAAG;EAChC,KAAK,aAAa;EAClB,OAAO;CACR;CACA,MAAM,MAAM,SAAS,KAAK,MAAM;CAChC,KAAK,MAAM,YAAY,IAAI,YAAY,CAAC,GAAG,IAAI,CAAC,KAAK,UAAU,MAAM,GAAG,OAAO;CAC/E,MAAM,QAAQ,QAAQ,MAAM,MAAM;CAClC,IAAI,CAAC,OAAO;EACX,KAAK,aAAa;EAClB,OAAO;CACR;CACA,IAAI,CAAC,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,MAAM,MAAM;CAC9C,OAAO;AACR;;;;;;AAOA,SAAgB,YAAY,MAAoC;CAC/D,IAAI,KAAK,OACR,OAAO,iEAAiE,KAAK,MAAM,KAAK,KAAK,EAAE;CAChG,IAAI,KAAK,eAAe,KAAA,GAAW,OAAO,4BAA4B,KAAK;AAE5E"}

package/dist/ai/profiles.d.ts

@@ -64,12 +64,12 @@ export interface AiFlags {
  */
 export interface AiProfile extends AiSettings {
     /**
-     * The brain it plays with, by id (one the game lists in `GameModule.brains`): what a race's profile says
+     * The brain it plays with, by id (one the game lists in `Rules.brains`): what a race's profile says
      * (`GameAi.races`, campaign plan AR3), for a seat that names none and a map that says none. The game's first brain
      * where nothing says
      */
     brain?: string;
-    /** The difficulty by name: `easy`, `normal`, `hard`, `insane`, or a game's own (`GameModule.ai.difficulties`). `normal` when left out */
+    /** The difficulty by name: `easy`, `normal`, `hard`, `insane`, or a game's own (`Rules.ai.difficulties`). `normal` when left out */
     difficulty?: string;
     /** The personality by name: `balanced`, `rusher`, `turtle`, `expander`, `harasser`, or a game's own. `balanced` when left out */
     personality?: string;
@@ -136,7 +136,7 @@ export declare const DIFFICULTIES: Readonly<AiProfileTable>;
  */
 export declare const PERSONALITIES: Readonly<AiProfileTable>;
 /**
- * What a game says of its computer players' profiles (`GameModule.ai`): difficulties and personalities of its own, and
+ * What a game says of its computer players' profiles (`Rules.ai`): difficulties and personalities of its own, and
  * defaults over the engine's
  *
  * @beta
@@ -151,7 +151,7 @@ export interface GameAi {
     /** Defaults over the engine's, under the difficulty */
     defaults?: AiProfile;
     /**
-     * How its computers play each of its races (`GameModule.races`), by race id: a layer over `defaults` and under the
+     * How its computers play each of its races (`Rules.races`), by race id: a layer over `defaults` and under the
      * difficulty, for a seat of that race (its build order, heroes, composition, flags; how often it thinks). Its
      * `difficulty` and `personality` are the seat's where the lobby and the map say none
      */

package/dist/{profiles-B3NS9jwk.js → ai/profiles.js}

@@ -1,99 +1,4 @@
-//#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
+import { resolveSettings } from "./settings.js";
 //#region src/ai/profiles.ts
 /**
 * The engine's defaults of how well it plays: the bottom layer. The areas' numbers are each area's own where no layer
@@ -330,6 +235,6 @@ function flagOf(ai, name) {
 	return typeof value === "function" ? value(ai) : value;
 }
 //#endregion
-export { flagOf as a, resolveSettings as c, difficultiesOf as i, DIFFICULTIES as n, personalitiesOf as o, PERSONALITIES as r, resolveProfile as s, DEFAULT_PROFILE as t };
+export { DEFAULT_PROFILE, DIFFICULTIES, PERSONALITIES, difficultiesOf, flagOf, personalitiesOf, resolveProfile };
 
-//# sourceMappingURL=profiles-B3NS9jwk.js.map
+//# sourceMappingURL=profiles.js.map

package/dist/ai/profiles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"profiles.js","names":[],"sources":["../../src/ai/profiles.ts"],"sourcesContent":["import type { Registry } from '#engine/registry'\nimport type { AiConditionTest } from './rules'\nimport type { ThinkBudgetOptions } from './budget'\nimport type { AiOptions } from './options'\nimport type { Brain } from './brain'\nimport { type AiSettings, resolveSettings } from './settings'\n\n/*\n * Profiles (AI plan, D1): how a computer player plays, as one piece of plain data. A profile (`AiProfile`) is the\n * settings of its areas (`AiSettings`, keyed by area: see settings.ts) and how well it plays, and is made of layers,\n * lowest first:\n *\n *   the brain's  →  the game's defaults  →  the race's  →  the difficulty (by name)  →  the personality (by name)  →  the map  →  the seat\n *\n * - **A race's** (`GameAi.races`, by the race the seat plays) is how the game's computers play that race: its build\n *   order, its heroes, its composition, a flag the race's roster asks for. Under the difficulty and the personality,\n *   so that a hard rusher of either race is still hard and still rushes; the map's (`MapAi.races`) goes over the map's\n *   settings for a player whose race the map leaves to the lobby.\n * - **A difficulty** (`easy`, `normal`, `hard`, `insane`, or a game's own: `Rules.ai.difficulties`) is how\n *   well it plays: how often it thinks, how many commands a think may send (`commandsPerThink`, a person's hands), how\n *   often it slips (`mistakes`: a think's fights left alone, a wave sent early; drawn with its own numbers, so the same\n *   game slips alike), whether it sees through the fog (`vision: 'all'`, insane only: the one way a computer sees what\n *   its seat does not, an observer's session), and the handicaps it is given (`handicap`: more of what its workers\n *   bring in, more health, more damage, quicker making, asked of the game through its hooks as the computer is seated).\n * - **A personality** (`balanced`, `rusher`, `turtle`, `expander`, `harasser`, or a game's own: `Rules.ai.personalities`) is how\n *   it likes to play: how much each goal weighs (`weights`), when it attacks and expands, how many towers it puts up.\n * - **The map's and the seat's** are what the map (`MapAi`), the lobby or the mission give (`AiOptions.settings`).\n *\n * `ai.profile` is the profile resolved; `ai.settings` its settings as the areas read them, worked out once a think.\n * Every field is data a lobby, a map or an editor can hold; a flag may be a function of the brain instead (code: given\n * again by the game, not kept in a save).\n */\n\n/**\n * A flag's value: as data, or worked out by the brain as it is asked (code, not kept in a save)\n *\n * @beta\n */\nexport type AiFlag<T> = T | ((ai: Brain) => T)\n\n/**\n * The classic RTS behaviour flags, where the meaning holds, and the kit's own beside them: each a yes or no, a number where\n * one says how much, or a function of the brain\n *\n * @beta\n */\nexport interface AiFlags {\n\t/** Helps its allies, people and computers, where asked (the team's `help` goal) */\n\tdefendUsers?: AiFlag<boolean>\n\t/** Hits heroes first among those alike (the micro's targets) */\n\ttargetHeroes?: AiFlag<boolean>\n\t/** Mends damaged buildings when no enemy reaches them (the build plan's `repair`) */\n\trepairStructures?: AiFlag<boolean>\n\t/** A hero leaves a fight under this share of its health: `true` at the share under it, `false` never (`micro.heroesFlee`) */\n\theroesFlee?: AiFlag<boolean | number>\n\t/** A unit leaves a fight under this share of its health: `true` at the share under it, `false` never (`micro.unitsFlee`) */\n\tunitsFlee?: AiFlag<boolean | number>\n\t/** A squad falls back from a fight away from home under these odds: `true` at the odds under it, `false` never (`squads.retreatAt`) */\n\tgroupsFlee?: AiFlag<boolean | number>\n\t/** Attacks before its time when the enemy's army as last seen is weak against its own: at these odds (`true`: 0.75) */\n\tnoMercy?: AiFlag<boolean | number>\n\t/** A unit that fled stays out until healed */\n\tignoreInjured?: AiFlag<boolean>\n\t/** The hurt go home to heal between fights */\n\tremoveInjuries?: AiFlag<boolean>\n\t/** Picks up what lies about */\n\ttakeItems?: AiFlag<boolean>\n\t/** Its heroes buy from shops in reach */\n\tbuyItems?: AiFlag<boolean>\n\t/** Builds its hall again where it can, once its home falls, rather than where it first stood: yes when left out */\n\tallowHomeChanges?: AiFlag<boolean>\n\t/** Siege units shoot buildings and stay behind their squad */\n\tsmartArtillery?: AiFlag<boolean>\n\t/** Each wave takes a way of its own to the target, by the brain's numbers: straight, or round one side or the other */\n\trandomPaths?: AiFlag<boolean>\n\t/** Builds again what it lost */\n\trebuild?: AiFlag<boolean>\n\t/** Ranged units step back from melee they outrun */\n\tkite?: AiFlag<boolean>\n\t/** Workers a raid is on walk to a safe base */\n\tworkersFlee?: AiFlag<boolean>\n\t/** Says its lines to its side (the team's `say`) */\n\tsay?: AiFlag<boolean>\n\t/** Sends a unit to look at the enemy (the scouting's goal) */\n\tscout?: AiFlag<boolean>\n}\n\n/**\n * How a computer player plays, as plain data: the settings of its areas (`AiSettings`) and how well it plays, every field\n * optional, layered (see the file's comment). What a difficulty, a personality and a game's defaults give\n *\n * @beta\n */\nexport interface AiProfile extends AiSettings {\n\t/**\n\t * The brain it plays with, by id (one the game lists in `Rules.brains`): what a race's profile says\n\t * (`GameAi.races`, campaign plan AR3), for a seat that names none and a map that says none. The game's first brain\n\t * where nothing says\n\t */\n\tbrain?: string\n\t/** The difficulty by name: `easy`, `normal`, `hard`, `insane`, or a game's own (`Rules.ai.difficulties`). `normal` when left out */\n\tdifficulty?: string\n\t/** The personality by name: `balanced`, `rusher`, `turtle`, `expander`, `harasser`, or a game's own. `balanced` when left out */\n\tpersonality?: string\n\t/** Seconds between thinks: its reactions */\n\tevery?: number\n\t/** Commands a think may send at the most, like a person's hands: no limit when left out */\n\tcommandsPerThink?: number\n\t/** How often it slips, 0 to 1: a think's fights left alone, a wave sent early. Drawn with the brain's own numbers */\n\tmistakes?: number\n\t/** `fair`: it sees what its seat does. `all`: it sees through the fog (an observer's session), for insane only */\n\tvision?: 'fair' | 'all'\n\t/**\n\t * How much of a think one tick may do (`ThinkBudgetOptions`): modules a tick, units looked at a tick, the milliseconds\n\t * a module is warned over (4). Nothing sliced when left out: a game sets it where its numbers ask, at many computers\n\t */\n\tbudget?: ThinkBudgetOptions\n\t/**\n\t * What it is given beyond the rules, each a factor (1 is none), through the game's hooks while it is seated:\n\t * `income`, what its workers bring in (1.5: half again; `beforeDeposit`); `health`, the most health of everything\n\t * it has (`stats`); `damage`, the damage it deals (`beforeDamage`, before armour); `buildTime`, how long what it\n\t * trains, builds and researches takes (0.8: a fifth sooner; `beforeProduce`). The classic handicap is `health`\n\t */\n\thandicap?: AiHandicap\n}\n\n/**\n * What a computer is given beyond the rules (`AiProfile.handicap`): each a factor, 1 (or left out) for none\n *\n * @beta\n */\nexport interface AiHandicap {\n\t/** What its workers bring in, through the game's `beforeDeposit` hook */\n\tincome?: number\n\t/** The most health of everything it has, through a `stats` hook: the classic handicap */\n\thealth?: number\n\t/** The damage it deals, before armour, through a `beforeDamage` hook */\n\tdamage?: number\n\t/** How long what it trains, builds and researches takes, through a `beforeProduce` hook: under 1 is sooner */\n\tbuildTime?: number\n}\n\n/**\n * A difficulty's or a personality's profile, the engine's or a game's\n *\n * @beta\n */\nexport type AiProfileTable = Record<string, AiProfile>\n\n/**\n * The engine's defaults of how well it plays: the bottom layer. The areas' numbers are each area's own where no layer\n * says them (`Economy`'s 8 workers)\n *\n * @beta\n */\nexport const DEFAULT_PROFILE: Readonly<AiProfile> = {\n\tdifficulty: 'normal',\n\tpersonality: 'balanced',\n\tevery: 1,\n\tmistakes: 0,\n\tvision: 'fair'\n}\n\n/** The numbers the strongest difficulties share */\nconst STRONG: AiProfile = {\n\tevery: 0.5,\n\teconomy: { workers: 10, expansions: 2 },\n\tarmy: { firstAttack: 105, attackEvery: 34, waveSize: 8 },\n\tdefence: { radius: 22 },\n\tscouting: { lookEvery: 60 }\n}\n\n/**\n * The engine's difficulties: how well it plays. `normal` is the areas' own numbers. `insane` sees through the fog and\n * gets half again of what its workers bring in, as the classic insane computer does\n *\n * @beta\n */\nexport const DIFFICULTIES: Readonly<AiProfileTable> = {\n\teasy: {\n\t\tevery: 2,\n\t\tcommandsPerThink: 12,\n\t\tmistakes: 0.25,\n\t\teconomy: { workers: 6, expansions: 0 },\n\t\tarmy: { firstAttack: 240, attackEvery: 70, waveSize: 4 },\n\t\tdefence: { radius: 10 },\n\t\tscouting: { lookEvery: 150 },\n\t\theroes: { most: 1 }\n\t},\n\tnormal: {},\n\thard: STRONG,\n\tinsane: { ...STRONG, vision: 'all', handicap: { income: 1.5 } }\n}\n\n/**\n * The engine's personalities: how it likes to play. Over the difficulty, so a rusher rushes on any of them\n *\n * @beta\n */\nexport const PERSONALITIES: Readonly<AiProfileTable> = {\n\tbalanced: {},\n\trusher: {\n\t\tarmy: { firstAttack: 90, attackEvery: 30, waveSize: 4 },\n\t\teconomy: { expansions: 0 },\n\t\tdefence: { towers: 0 },\n\t\tweights: { creep: 0.5, harass: 1.2, expand: 0.5 },\n\t\tflags: { noMercy: true }\n\t},\n\tturtle: {\n\t\tarmy: { firstAttack: 300 },\n\t\tdefence: { towers: 2, odds: 0.8 },\n\t\teconomy: { expansions: 0 },\n\t\tweights: { attack: 0.8, creep: 0.6, raid: 0.5, harass: 0.2, expand: 1.2 },\n\t\tflags: { workersFlee: true }\n\t},\n\texpander: {\n\t\teconomy: { expansions: 3, expandWhen: { all: [{ time: { after: 150 } }, { units: { role: 'barracks' } }] } },\n\t\tweights: { attack: 0.9, expand: 1.5 }\n\t},\n\tharasser: {\n\t\tarmy: { attackEvery: 30, waveSize: 4 },\n\t\tweights: { creep: 1.2, raid: 1.5, harass: 1.5 },\n\t\tflags: { kite: true, heroesFlee: 0.5, noMercy: true }\n\t}\n}\n\n/**\n * What a game says of its computer players' profiles (`Rules.ai`): difficulties and personalities of its own, and\n * defaults over the engine's\n *\n * @beta\n */\nexport interface GameAi {\n\t/** Difficulties of its own, by name, beside (or over) the engine's */\n\tdifficulties?: AiProfileTable\n\t/** Personalities of its own, by name */\n\tpersonalities?: AiProfileTable\n\t/** Conditions of its own, by id, for the data form (`{ is: 'mygame.bridgeDown', args }`), a map's file among them */\n\tconditions?: Record<string, AiConditionTest>\n\t/** Defaults over the engine's, under the difficulty */\n\tdefaults?: AiProfile\n\t/**\n\t * How its computers play each of its races (`Rules.races`), by race id: a layer over `defaults` and under the\n\t * difficulty, for a seat of that race (its build order, heroes, composition, flags; how often it thinks). Its\n\t * `difficulty` and `personality` are the seat's where the lobby and the map say none\n\t */\n\traces?: AiProfileTable\n\t/** Whether a lobby offers its seats a difficulty and a personality (`seatSettingsOf`): yes when left out */\n\tlobby?: boolean\n}\n\n/**\n * The difficulties a game's computers may play at, by name: the engine's, the game's over them\n *\n * @beta\n */\nexport function difficultiesOf(registry?: Pick<Registry, 'module'>): AiProfileTable {\n\treturn { ...DIFFICULTIES, ...registry?.module?.ai?.difficulties }\n}\n\n/**\n * The personalities a game's computers may have, by name: the engine's, the game's over them\n *\n * @beta\n */\nexport function personalitiesOf(registry?: Pick<Registry, 'module'>): AiProfileTable {\n\treturn { ...PERSONALITIES, ...registry?.module?.ai?.personalities }\n}\n\n/** What a profile says of how well it plays, beside its settings: layered field by field (the handicap and the budget merged) */\nconst HOW_WELL = ['brain', 'difficulty', 'personality', 'every', 'commandsPerThink', 'mistakes', 'vision', 'budget', 'handicap'] as const\n\n/**\n * A profile resolved (`resolveProfile`): what it plays by, and its settings' layers as given, lowest first, for the brain\n * to work out each think (a flag may be a function of it)\n *\n * @beta\n */\nexport interface ResolvedProfile {\n\t/** The profile, its settings layered (a flag's function left out) */\n\tprofile: AiProfile\n\t/** Its settings' layers, lowest first: the brain's, the game's, the race's, the difficulty's, the personality's, the seat's (the map's under it) */\n\tlayers: readonly AiSettings[]\n\t/** A difficulty or a personality the game does not have, passed over */\n\tunknown: string[]\n}\n\n/** A profile's settings: what is not of how well it plays */\nfunction settingsOf(profile: AiProfile | undefined): AiSettings | undefined {\n\tif (!profile) return undefined\n\tconst settings: Record<string, unknown> = { ...profile }\n\tfor (const key of HOW_WELL) delete settings[key]\n\treturn settings as AiSettings\n}\n\n/**\n * The profile a seat plays by (`Brain.profile`): the brain's settings (`BrainDef.settings`), the game's defaults, the\n * race's (`GameAi.races`, for the `race` the seat plays), the difficulty, the personality, the seat's own\n * (`AiOptions.settings`, the map's under it), each over the one before; how well it plays from the engine's defaults,\n * the game's, the race's, the difficulty, the personality and the seat's `every` and `budget`. A name the game does not\n * have is passed over, and `unknown` names it\n *\n * @beta\n */\nexport function resolveProfile(options: AiOptions, registry?: Pick<Registry, 'module'>, brain?: AiSettings, race?: string): ResolvedProfile {\n\tconst defaults = registry?.module?.ai?.defaults\n\tconst raced = race !== undefined ? registry?.module?.ai?.races?.[race] : undefined\n\tconst difficulty = options.difficulty ?? raced?.difficulty ?? defaults?.difficulty ?? 'normal'\n\tconst personality = options.personality ?? raced?.personality ?? defaults?.personality ?? 'balanced'\n\tconst difficulties = difficultiesOf(registry)\n\tconst personalities = personalitiesOf(registry)\n\tconst unknown: string[] = []\n\tif (!difficulties[difficulty]) unknown.push(`difficulty \"${difficulty}\"`)\n\tif (!personalities[personality]) unknown.push(`personality \"${personality}\"`)\n\tconst seat: AiProfile = {\n\t\t...(options.every !== undefined && { every: options.every }),\n\t\t...(options.budget !== undefined && { budget: typeof options.budget === 'number' ? { modulesPerTick: options.budget } : options.budget })\n\t}\n\tconst profile: Record<string, unknown> = {}\n\tfor (const each of [DEFAULT_PROFILE, defaults, raced, difficulties[difficulty], personalities[personality], seat])\n\t\tfor (const key of HOW_WELL) {\n\t\t\tconst value = each?.[key]\n\t\t\tif (value === undefined) continue\n\t\t\tprofile[key] = key === 'budget' || key === 'handicap' ? { ...(profile[key] as object | undefined), ...(value as object) } : value\n\t\t}\n\tprofile.difficulty = difficulty\n\tprofile.personality = personality\n\tconst layers = [\n\t\tbrain,\n\t\tsettingsOf(defaults),\n\t\tsettingsOf(raced),\n\t\tsettingsOf(difficulties[difficulty]),\n\t\tsettingsOf(personalities[personality]),\n\t\toptions.settings\n\t].filter((layer): layer is AiSettings => !!layer)\n\treturn { profile: { ...resolveSettings(layers), ...(profile as AiProfile) }, layers, unknown }\n}\n\n/**\n * A flag's value as asked now: a function of the brain worked out, data as it is. For a flag no area has a name for\n * (No Mercy, Random Paths, Allow Home Changes): the rest are the areas' (`ai.settings`)\n *\n * @beta\n */\nexport function flagOf<K extends keyof AiFlags>(ai: Brain, name: K): Exclude<AiFlags[K], (ai: Brain) => unknown> | undefined {\n\tconst value = ai.settings.flags?.[name]\n\treturn (typeof value === 'function' ? (value as (ai: Brain) => unknown)(ai) : value) as Exclude<AiFlags[K], (ai: Brain) => unknown> | undefined\n}\n"],"mappings":";;;;;;;;AA2JA,IAAa,kBAAuC;CACnD,YAAY;CACZ,aAAa;CACb,OAAO;CACP,UAAU;CACV,QAAQ;AACT;;AAGA,IAAM,SAAoB;CACzB,OAAO;CACP,SAAS;EAAE,SAAS;EAAI,YAAY;CAAE;CACtC,MAAM;EAAE,aAAa;EAAK,aAAa;EAAI,UAAU;CAAE;CACvD,SAAS,EAAE,QAAQ,GAAG;CACtB,UAAU,EAAE,WAAW,GAAG;AAC3B;;;;;;;AAQA,IAAa,eAAyC;CACrD,MAAM;EACL,OAAO;EACP,kBAAkB;EAClB,UAAU;EACV,SAAS;GAAE,SAAS;GAAG,YAAY;EAAE;EACrC,MAAM;GAAE,aAAa;GAAK,aAAa;GAAI,UAAU;EAAE;EACvD,SAAS,EAAE,QAAQ,GAAG;EACtB,UAAU,EAAE,WAAW,IAAI;EAC3B,QAAQ,EAAE,MAAM,EAAE;CACnB;CACA,QAAQ,CAAC;CACT,MAAM;CACN,QAAQ;EAAE,GAAG;EAAQ,QAAQ;EAAO,UAAU,EAAE,QAAQ,IAAI;CAAE;AAC/D;;;;;;AAOA,IAAa,gBAA0C;CACtD,UAAU,CAAC;CACX,QAAQ;EACP,MAAM;GAAE,aAAa;GAAI,aAAa;GAAI,UAAU;EAAE;EACtD,SAAS,EAAE,YAAY,EAAE;EACzB,SAAS,EAAE,QAAQ,EAAE;EACrB,SAAS;GAAE,OAAO;GAAK,QAAQ;GAAK,QAAQ;EAAI;EAChD,OAAO,EAAE,SAAS,KAAK;CACxB;CACA,QAAQ;EACP,MAAM,EAAE,aAAa,IAAI;EACzB,SAAS;GAAE,QAAQ;GAAG,MAAM;EAAI;EAChC,SAAS,EAAE,YAAY,EAAE;EACzB,SAAS;GAAE,QAAQ;GAAK,OAAO;GAAK,MAAM;GAAK,QAAQ;GAAK,QAAQ;EAAI;EACxE,OAAO,EAAE,aAAa,KAAK;CAC5B;CACA,UAAU;EACT,SAAS;GAAE,YAAY;GAAG,YAAY,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,WAAW,EAAE,CAAC,EAAE;EAAE;EAC3G,SAAS;GAAE,QAAQ;GAAK,QAAQ;EAAI;CACrC;CACA,UAAU;EACT,MAAM;GAAE,aAAa;GAAI,UAAU;EAAE;EACrC,SAAS;GAAE,OAAO;GAAK,MAAM;GAAK,QAAQ;EAAI;EAC9C,OAAO;GAAE,MAAM;GAAM,YAAY;GAAK,SAAS;EAAK;CACrD;AACD;;;;;;AAgCA,SAAgB,eAAe,UAAqD;CACnF,OAAO;EAAE,GAAG;EAAc,GAAG,UAAU,QAAQ,IAAI;CAAa;AACjE;;;;;;AAOA,SAAgB,gBAAgB,UAAqD;CACpF,OAAO;EAAE,GAAG;EAAe,GAAG,UAAU,QAAQ,IAAI;CAAc;AACnE;;AAGA,IAAM,WAAW;CAAC;CAAS;CAAc;CAAe;CAAS;CAAoB;CAAY;CAAU;CAAU;AAAU;;AAkB/H,SAAS,WAAW,SAAwD;CAC3E,IAAI,CAAC,SAAS,OAAO,KAAA;CACrB,MAAM,WAAoC,EAAE,GAAG,QAAQ;CACvD,KAAK,MAAM,OAAO,UAAU,OAAO,SAAS;CAC5C,OAAO;AACR;;;;;;;;;;AAWA,SAAgB,eAAe,SAAoB,UAAqC,OAAoB,MAAgC;CAC3I,MAAM,WAAW,UAAU,QAAQ,IAAI;CACvC,MAAM,QAAQ,SAAS,KAAA,IAAY,UAAU,QAAQ,IAAI,QAAQ,QAAQ,KAAA;CACzE,MAAM,aAAa,QAAQ,cAAc,OAAO,cAAc,UAAU,cAAc;CACtF,MAAM,cAAc,QAAQ,eAAe,OAAO,eAAe,UAAU,eAAe;CAC1F,MAAM,eAAe,eAAe,QAAQ;CAC5C,MAAM,gBAAgB,gBAAgB,QAAQ;CAC9C,MAAM,UAAoB,CAAC;CAC3B,IAAI,CAAC,aAAa,aAAa,QAAQ,KAAK,eAAe,WAAW,EAAE;CACxE,IAAI,CAAC,cAAc,cAAc,QAAQ,KAAK,gBAAgB,YAAY,EAAE;CAC5E,MAAM,OAAkB;EACvB,GAAI,QAAQ,UAAU,KAAA,KAAa,EAAE,OAAO,QAAQ,MAAM;EAC1D,GAAI,QAAQ,WAAW,KAAA,KAAa,EAAE,QAAQ,OAAO,QAAQ,WAAW,WAAW,EAAE,gBAAgB,QAAQ,OAAO,IAAI,QAAQ,OAAO;CACxI;CACA,MAAM,UAAmC,CAAC;CAC1C,KAAK,MAAM,QAAQ;EAAC;EAAiB;EAAU;EAAO,aAAa;EAAa,cAAc;EAAc;CAAI,GAC/G,KAAK,MAAM,OAAO,UAAU;EAC3B,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,KAAA,GAAW;EACzB,QAAQ,OAAO,QAAQ,YAAY,QAAQ,aAAa;GAAE,GAAI,QAAQ;GAA6B,GAAI;EAAiB,IAAI;CAC7H;CACD,QAAQ,aAAa;CACrB,QAAQ,cAAc;CACtB,MAAM,SAAS;EACd;EACA,WAAW,QAAQ;EACnB,WAAW,KAAK;EAChB,WAAW,aAAa,WAAW;EACnC,WAAW,cAAc,YAAY;EACrC,QAAQ;CACT,CAAC,CAAC,QAAQ,UAA+B,CAAC,CAAC,KAAK;CAChD,OAAO;EAAE,SAAS;GAAE,GAAG,gBAAgB,MAAM;GAAG,GAAI;EAAsB;EAAG;EAAQ;CAAQ;AAC9F;;;;;;;AAQA,SAAgB,OAAgC,IAAW,MAAkE;CAC5H,MAAM,QAAQ,GAAG,SAAS,QAAQ;CAClC,OAAQ,OAAO,UAAU,aAAc,MAAiC,EAAE,IAAI;AAC/E"}

package/dist/ai/reach.js

@@ -0,0 +1,54 @@
+//#region src/ai/reach.ts
+/**
+* The distances and times the AI kit measures by (design review B13), each named once with why it is what it is
+*/
+/**
+* The side of a cell of the view's grid, in units of the map: a few units, so that "near" looks at a few cells. The
+* threat map and the knowledge share it
+*
+* @internal
+*/
+var CELL = 8;
+/**
+* How far from its centre a building is still of a base: the view's own and the knowledge's of an enemy
+*
+* @internal
+*/
+var BASE_REACH = 24;
+/**
+* How far from a mine a hall is that mine's: the economy's deposits, the hall built by a mine, the way kept clear
+* between them
+*
+* @internal
+*/
+var HALL_REACH = 16;
+/**
+* How near the middle of a squad a fight is: what is this near is in it (the squads' and the micro's measure)
+*
+* @internal
+*/
+var FIGHT_REACH = 14;
+/**
+* How near one of its units a foe is for it to be in a fight: a squad that may turn back, a unit in the fight, a
+* worker a raid is on
+*
+* @internal
+*/
+var ENGAGED = 8;
+/**
+* How near one of theirs a lanes hero is in a fight (a hero with nothing this near walks on): a lane is wider than a
+* squad's reach
+*
+* @internal
+*/
+var LANE_ENGAGED = 9;
+/**
+* Seconds before an order that was lost is sent again: what keeps a stuck unit from being told every think
+*
+* @internal
+*/
+var RESEND = 3;
+//#endregion
+export { BASE_REACH, CELL, ENGAGED, FIGHT_REACH, HALL_REACH, LANE_ENGAGED, RESEND };
+
+//# sourceMappingURL=reach.js.map

package/dist/ai/reach.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reach.js","names":[],"sources":["../../src/ai/reach.ts"],"sourcesContent":["/**\n * The distances and times the AI kit measures by (design review B13), each named once with why it is what it is\n */\n\n/**\n * The side of a cell of the view's grid, in units of the map: a few units, so that \"near\" looks at a few cells. The\n * threat map and the knowledge share it\n *\n * @internal\n */\nexport const CELL = 8\n\n/**\n * How far from its centre a building is still of a base: the view's own and the knowledge's of an enemy\n *\n * @internal\n */\nexport const BASE_REACH = 24\n\n/**\n * How far from a mine a hall is that mine's: the economy's deposits, the hall built by a mine, the way kept clear\n * between them\n *\n * @internal\n */\nexport const HALL_REACH = 16\n\n/**\n * How near the middle of a squad a fight is: what is this near is in it (the squads' and the micro's measure)\n *\n * @internal\n */\nexport const FIGHT_REACH = 14\n\n/**\n * How near one of its units a foe is for it to be in a fight: a squad that may turn back, a unit in the fight, a\n * worker a raid is on\n *\n * @internal\n */\nexport const ENGAGED = 8\n\n/**\n * How near one of theirs a lanes hero is in a fight (a hero with nothing this near walks on): a lane is wider than a\n * squad's reach\n *\n * @internal\n */\nexport const LANE_ENGAGED = 9\n\n/**\n * Seconds before an order that was lost is sent again: what keeps a stuck unit from being told every think\n *\n * @internal\n */\nexport const RESEND = 3\n"],"mappings":";;;;;;;;;;AAUA,IAAa,OAAO;;;;;;AAOpB,IAAa,aAAa;;;;;;;AAQ1B,IAAa,aAAa;;;;;;AAO1B,IAAa,cAAc;;;;;;;AAQ3B,IAAa,UAAU;;;;;;;AAQvB,IAAa,eAAe;;;;;;AAO5B,IAAa,SAAS"}

package/dist/ai/report.d.ts

@@ -33,6 +33,7 @@ export interface AiDecision {
  * @beta
  */
 export interface KnowledgeReport {
+    /** The enemy bases known, each with its owner, where, how many structures, how many seconds ago it was seen and whether it is gone */
     bases: {
         owner: PlayerId;
         at: [number, number];
@@ -40,12 +41,15 @@ export interface KnowledgeReport {
         seen: number;
         gone?: true;
     }[];
+    /** The enemy armies as last seen, each with where, how many fighters and how many seconds ago */
     army: {
         at: [number, number];
         count: number;
         seen: number;
     }[];
+    /** The enemy tech seen: the types of their finished buildings */
     tech: string[];
+    /** How many of its own things were lost */
     lost: number;
 }
 /**
@@ -79,9 +83,13 @@ export interface AiStats {
  * @beta
  */
 export interface ThreatReport {
+    /** The side of a grid cell, in cells of the map */
     cell: number;
+    /** How many grid cells across */
     cols: number;
+    /** How many grid cells down */
     rows: number;
+    /** Each grid cell with something in it as `[col, row, friendly, enemy]`, the strength of each side */
     cells: [col: number, row: number, friendly: number, enemy: number][];
 }
 /**