@v12-engine/engine 0.1.1 → 0.4.0

package/dist/ai/tasks/retreat.js

@@ -0,0 +1,28 @@
+import { defineTask } from "../task.js";
+import { arrive } from "./shared.js";
+//#region src/ai/tasks/retreat.ts
+/**
+* Falls back to a place: done `retreated`
+*
+* @beta
+*/
+var RETREAT = defineTask({
+	id: "retreat",
+	fighting: false,
+	start(ai, squad, state) {
+		state.phase = "going";
+		state.phaseSince = ai.tick;
+		const at = state.data.at;
+		if (at) squad.order({
+			type: "move",
+			point: at
+		});
+	},
+	think: arrive("retreated"),
+	where: (_ai, _squad, state) => state.data.at,
+	handles: ["retreat", "regroup"]
+});
+//#endregion
+export { RETREAT };
+
+//# sourceMappingURL=retreat.js.map

package/dist/ai/tasks/retreat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retreat.js","names":[],"sources":["../../../src/ai/tasks/retreat.ts"],"sourcesContent":["/**\n * The kit's `retreat` task (design review B10): falls back to a place: done `retreated`\n */\nimport type { Vec2 } from '#engine/math'\nimport { defineTask, type TaskMemory } from '../task'\nimport { arrive } from './shared'\n\n/**\n * What the `retreat` task is given: where to (home when left out), and why, for the report\n *\n * @beta\n */\nexport type RetreatData = {\n\tat?: Vec2\n\twhy?: string\n}\n\n/**\n * Falls back to a place: done `retreated`\n *\n * @beta\n */\nexport const RETREAT = defineTask<RetreatData, TaskMemory>({ id: 'retreat', fighting: false,\n\tstart(ai, squad, state) {\n\t\tstate.phase = 'going'\n\t\tstate.phaseSince = ai.tick\n\t\tconst at = state.data.at\n\t\tif (at) squad.order({ type: 'move', point: at })\n\t},\n\tthink: arrive('retreated'),\n\twhere: (_ai, _squad, state) => state.data.at,\n\thandles: ['retreat', 'regroup'] })\n"],"mappings":";;;;;;;;AAsBA,IAAa,UAAU,WAAoC;CAAE,IAAI;CAAW,UAAU;CACrF,MAAM,IAAI,OAAO,OAAO;EACvB,MAAM,QAAQ;EACd,MAAM,aAAa,GAAG;EACtB,MAAM,KAAK,MAAM,KAAK;EACtB,IAAI,IAAI,MAAM,MAAM;GAAE,MAAM;GAAQ,OAAO;EAAG,CAAC;CAChD;CACA,OAAO,OAAO,WAAW;CACzB,QAAQ,KAAK,QAAQ,UAAU,MAAM,KAAK;CAC1C,SAAS,CAAC,WAAW,SAAS;AAAE,CAAC"}

package/dist/ai/tasks/scout.js

@@ -0,0 +1,73 @@
+import { distSq } from "../../math.js";
+import { defineTask } from "../task.js";
+//#region src/ai/tasks/scout.ts
+/**
+* The kit's `scout` task (design review B10): looks at places in turn: done `arrived` after the last
+*/
+/**
+* Looks at places in turn: done `arrived` after the last
+*
+* @beta
+*/
+var SCOUT_TASK = defineTask({
+	id: "scout",
+	fighting: false,
+	start(ai, squad, state) {
+		const points = state.data.points;
+		const next = state.memory.next ?? 0;
+		state.memory.next = next;
+		state.phase = "going";
+		state.phaseSince = ai.tick;
+		if (points[next]) squad.order({
+			type: "move",
+			point: points[next]
+		});
+	},
+	think(ai, squad, state) {
+		const points = state.data.points;
+		let next = state.memory.next ?? 0;
+		const knows = ai.def.knowledge !== false;
+		const at = points[next];
+		if (!at) {
+			squad.finish("arrived");
+			return;
+		}
+		const seen = knows && ai.knowledge.map.inSight(at);
+		const stopped = ai.tick > state.phaseSince && squad.idleUnits().length === squad.data.units.length;
+		if (!seen && !stopped) return;
+		if (!seen) {
+			const middle = squad.centre();
+			if (!(!!middle && distSq(middle, at) <= 256)) {
+				const tries = (state.memory.tries ?? 0) + 1;
+				if (tries <= 2 && ai.tick - state.phaseSince <= 5 * ai.session.tickRate) return;
+				state.memory.tries = tries;
+				if (tries <= 2) {
+					state.phaseSince = ai.tick;
+					squad.order({
+						type: "move",
+						point: at
+					});
+					return;
+				}
+			} else if (knows) ai.knowledge.map.look(at);
+		}
+		delete state.memory.tries;
+		next++;
+		state.memory.next = next;
+		if (next >= points.length) {
+			squad.finish("arrived");
+			return;
+		}
+		state.phaseSince = ai.tick;
+		squad.order({
+			type: "move",
+			point: points[next]
+		});
+	},
+	where: (_ai, _squad, state) => state.data.points[state.memory.next ?? 0],
+	handles: ["regroup", "retreat"]
+});
+//#endregion
+export { SCOUT_TASK };
+
+//# sourceMappingURL=scout.js.map

package/dist/ai/tasks/scout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scout.js","names":[],"sources":["../../../src/ai/tasks/scout.ts"],"sourcesContent":["/**\n * The kit's `scout` task (design review B10): looks at places in turn: done `arrived` after the last\n */\nimport { distSq, type Vec2 } from '#engine/math'\nimport { CHURN_WINDOW } from '../checks'\nimport { defineTask } from '../task'\nimport { SCOUT_NEAR } from './shared'\n\n/**\n * What the `scout` task is given\n *\n * @beta\n */\nexport type RoundData = {\n\tpoints: Vec2[]\n}\n\n/**\n * What the `scout` task remembers\n *\n * @beta\n */\nexport type RoundMemory = {\n\t/** The place of the round it is on */\n\tnext?: number\n\t/** Times it was sent again to a place it stopped short of */\n\ttries?: number\n}\n\n/**\n * Looks at places in turn: done `arrived` after the last\n *\n * @beta\n */\nexport const SCOUT_TASK = defineTask<RoundData, RoundMemory>({ id: 'scout', fighting: false,\n\tstart(ai, squad, state) {\n\t\tconst points = state.data.points\n\t\tconst next = state.memory.next ?? 0\n\t\tstate.memory.next = next\n\t\tstate.phase = 'going'\n\t\tstate.phaseSince = ai.tick\n\t\tif (points[next]) squad.order({ type: 'move', point: points[next] })\n\t},\n\tthink(ai, squad, state) {\n\t\tconst points = state.data.points\n\t\tlet next = state.memory.next ?? 0\n\t\tconst knows = ai.def.knowledge !== false\n\t\tconst at = points[next]\n\t\tif (!at) {\n\t\t\tsquad.finish('arrived')\n\t\t\treturn\n\t\t}\n\t\t// in sight now, or as near as the ground let it go: that is as looked at as it gets, and on to the next. Stopped\n\t\t// far from it (stuck on the way), it is sent again twice (once a few seconds have gone since it was last sent), then\n\t\t// the place is passed over, not counted as looked at\n\t\tconst seen = knows && ai.knowledge.map.inSight(at)\n\t\tconst stopped = ai.tick > state.phaseSince && squad.idleUnits().length === squad.data.units.length\n\t\tif (!seen && !stopped) return\n\t\tif (!seen) {\n\t\t\tconst middle = squad.centre()\n\t\t\tconst near = !!middle && distSq(middle, at) <= SCOUT_NEAR * SCOUT_NEAR\n\t\t\tif (!near) {\n\t\t\t\tconst tries = (state.memory.tries ?? 0) + 1\n\t\t\t\t// not sooner than a unit may be told the same again without its stopping and starting (`AiStats.churn`)\n\t\t\t\tif (tries <= 2 && ai.tick - state.phaseSince <= CHURN_WINDOW * ai.session.tickRate) return\n\t\t\t\tstate.memory.tries = tries\n\t\t\t\tif (tries <= 2) {\n\t\t\t\t\tstate.phaseSince = ai.tick\n\t\t\t\t\tsquad.order({ type: 'move', point: at })\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t} else if (knows) ai.knowledge.map.look(at)\n\t\t}\n\t\tdelete state.memory.tries\n\t\tnext++\n\t\tstate.memory.next = next\n\t\tif (next >= points.length) {\n\t\t\tsquad.finish('arrived')\n\t\t\treturn\n\t\t}\n\t\tstate.phaseSince = ai.tick\n\t\tsquad.order({ type: 'move', point: points[next] })\n\t},\n\twhere: (_ai, _squad, state) => state.data.points[state.memory.next ?? 0],\n\t// it goes to look, not to fight: it does not turn back at the sight of them\n\thandles: ['regroup', 'retreat'] })\n"],"mappings":";;;;;;;;;;;AAkCA,IAAa,aAAa,WAAmC;CAAE,IAAI;CAAS,UAAU;CACrF,MAAM,IAAI,OAAO,OAAO;EACvB,MAAM,SAAS,MAAM,KAAK;EAC1B,MAAM,OAAO,MAAM,OAAO,QAAQ;EAClC,MAAM,OAAO,OAAO;EACpB,MAAM,QAAQ;EACd,MAAM,aAAa,GAAG;EACtB,IAAI,OAAO,OAAO,MAAM,MAAM;GAAE,MAAM;GAAQ,OAAO,OAAO;EAAM,CAAC;CACpE;CACA,MAAM,IAAI,OAAO,OAAO;EACvB,MAAM,SAAS,MAAM,KAAK;EAC1B,IAAI,OAAO,MAAM,OAAO,QAAQ;EAChC,MAAM,QAAQ,GAAG,IAAI,cAAc;EACnC,MAAM,KAAK,OAAO;EAClB,IAAI,CAAC,IAAI;GACR,MAAM,OAAO,SAAS;GACtB;EACD;EAIA,MAAM,OAAO,SAAS,GAAG,UAAU,IAAI,QAAQ,EAAE;EACjD,MAAM,UAAU,GAAG,OAAO,MAAM,cAAc,MAAM,UAAU,CAAC,CAAC,WAAW,MAAM,KAAK,MAAM;EAC5F,IAAI,CAAC,QAAQ,CAAC,SAAS;EACvB,IAAI,CAAC,MAAM;GACV,MAAM,SAAS,MAAM,OAAO;GAE5B,IAAI,EADS,CAAC,CAAC,UAAU,OAAO,QAAQ,EAAE,KAAA,MAC/B;IACV,MAAM,SAAS,MAAM,OAAO,SAAS,KAAK;IAE1C,IAAI,SAAS,KAAK,GAAG,OAAO,MAAM,cAAA,IAA6B,GAAG,QAAQ,UAAU;IACpF,MAAM,OAAO,QAAQ;IACrB,IAAI,SAAS,GAAG;KACf,MAAM,aAAa,GAAG;KACtB,MAAM,MAAM;MAAE,MAAM;MAAQ,OAAO;KAAG,CAAC;KACvC;IACD;GACD,OAAO,IAAI,OAAO,GAAG,UAAU,IAAI,KAAK,EAAE;EAC3C;EACA,OAAO,MAAM,OAAO;EACpB;EACA,MAAM,OAAO,OAAO;EACpB,IAAI,QAAQ,OAAO,QAAQ;GAC1B,MAAM,OAAO,SAAS;GACtB;EACD;EACA,MAAM,aAAa,GAAG;EACtB,MAAM,MAAM;GAAE,MAAM;GAAQ,OAAO,OAAO;EAAM,CAAC;CAClD;CACA,QAAQ,KAAK,QAAQ,UAAU,MAAM,KAAK,OAAO,MAAM,OAAO,QAAQ;CAEtE,SAAS,CAAC,WAAW,SAAS;AAAE,CAAC"}

package/dist/ai/tasks/shared.d.ts

@@ -58,7 +58,7 @@ export declare function watchFight(ai: Brain, squad: Squad, state: TaskState<Fig
 export declare function inSight(ai: Brain, state: TaskState<FightData, FightMemory>): number | undefined;
 /** Works out the way round for a task that avoids, as it begins: kept in its memory, said in the decision log */
 export declare function planRoute(ai: Brain, squad: Squad, state: TaskState<FightData, FightMemory>): void;
-/** The capture points of the game (`withCapture`), as the report tells the brain: none for a game without them */
+/** The capture points of the game (`capturePack`), as the report tells the brain: none for a game without them */
 export declare function capturePointsOf(ai: Brain): {
     id: string;
     owner: number | null;

package/dist/ai/tasks/shared.js

@@ -0,0 +1,137 @@
+import { distSq } from "../../math.js";
+import "../reach.js";
+import { point, where } from "../geometry.js";
+/** Where a task's data says it goes: its target where it is in sight, else its place */
+function placeOf(ai, state) {
+	const target = typeof state.data.target === "number" ? ai.view.byId(state.data.target) : void 0;
+	if (target) return point(target);
+	return state.data.at;
+}
+/** Whether a place is on the map */
+function onMap(ai, at) {
+	const { width, depth } = ai.session.terrain;
+	return at.x >= 0 && at.z >= 0 && at.x < width && at.z < depth;
+}
+/** What is hostile and alive near a place: what a squad there fights */
+function foesNear(ai, at, radius = 14) {
+	return ai.view.hostile.alive().near(at, radius);
+}
+/**
+* Sets a task on its way to fight at its place: by the waypoints of a way round (`avoid`) where there are any, walking
+* them, then attack-moving there; else attack-moving, or attacking its target
+*/
+function goFight(ai, squad, state) {
+	const at = placeOf(ai, state);
+	if (!at) return;
+	state.phase = "going";
+	state.phaseSince = ai.tick;
+	const waypoints = state.memory.waypoints ?? [];
+	const target = inSight(ai, state);
+	const units = squad.data.units;
+	if (waypoints.length) {
+		const middle = squad.centre();
+		const next = middle ? waypoints.findIndex((each) => distSq(each, middle) > 64) : 0;
+		const left = next < 0 ? [] : waypoints.slice(next);
+		left.forEach((each, i) => squad.order({
+			type: "move",
+			point: each
+		}, units, i > 0));
+		if (left.length) {
+			squad.fight(at, units, target, true);
+			return;
+		}
+	}
+	squad.fight(at, units, target);
+}
+/**
+* Watches a squad on its way to fight or fighting: done once there with nothing left to fight, or once its target is
+* gone; the units that stand idle short of it sent again
+*/
+function watchFight(ai, squad, state) {
+	const target = typeof state.data.target === "number" ? state.data.target : void 0;
+	if (target !== void 0 && !ai.view.byId(target)) {
+		squad.finish("lost");
+		return;
+	}
+	const at = placeOf(ai, state);
+	if (!at || !onMap(ai, at)) {
+		squad.finish("lost");
+		return;
+	}
+	const middle = squad.centre();
+	if (!middle) return;
+	const fighting = foesNear(ai, middle).length > 0;
+	if (state.phase !== "regrouping") {
+		const phase = fighting ? "fighting" : "going";
+		if (phase !== state.phase) {
+			state.phase = phase;
+			state.phaseSince = ai.tick;
+		}
+	}
+	if (!fighting && distSq(middle, at) < 64 && !foesNear(ai, at).length) {
+		squad.finish("cleared");
+		return;
+	}
+	if (state.phase === "regrouping" || !squad.mayResend()) return;
+	const idle = squad.idleUnits().filter((unit) => distSq(unit, at) >= 64 || foesNear(ai, at).length > 0);
+	if (idle.length) squad.fight(at, idle.map((unit) => unit.id), inSight(ai, state));
+}
+/**
+* A task's target where it is in sight, to attack it by name: a building remembered out of sight (`visible: false`)
+* cannot be told to be attacked, and is attack-moved to instead
+*/
+function inSight(ai, state) {
+	if (typeof state.data.target !== "number") return void 0;
+	const entity = ai.view.byId(state.data.target);
+	return entity && entity.visible ? entity.id : void 0;
+}
+/** Works out the way round for a task that avoids, as it begins: kept in its memory, said in the decision log */
+function planRoute(ai, squad, state) {
+	const via = state.data.via;
+	if (via && !state.memory.routed) {
+		state.memory.routed = true;
+		state.memory.waypoints = [point(via)];
+		return;
+	}
+	if (state.data.avoid !== "army" || state.memory.routed) return;
+	state.memory.routed = true;
+	const from = squad.centre();
+	const to = placeOf(ai, state);
+	if (!from || !to) return;
+	const { waypoints, note } = ai.squads.route(from, to, squad);
+	if (waypoints.length) state.memory.waypoints = waypoints;
+	if (note) ai.decide(`squad ${squad.name} ${state.kind}s ${where(to)}: ${note}`, { kind: "squad" });
+}
+/** The capture points of the game (`capturePack`), as the report tells the brain: none for a game without them */
+function capturePointsOf(ai) {
+	const listed = ai.view.report?.captures;
+	return Array.isArray(listed) ? listed : [];
+}
+/**
+* A walk's think: done (as `done` says) once its middle is near the place, or once all of it stands idle as near as the
+* ground let it go; what stands idle short of it, while others walk on, is sent again
+*/
+function arrive(done) {
+	return (ai, squad, state) => {
+		const at = state.data.at;
+		const middle = squad.centre();
+		if (!at || !middle) {
+			squad.finish(done);
+			return;
+		}
+		const near = Math.max(4, squad.spread() / 2);
+		const idle = squad.idleUnits();
+		if (distSq(middle, at) <= near * near || ai.tick > state.phaseSince && idle.length === squad.data.units.length && distSq(middle, at) <= squad.spread() * squad.spread() * 4) {
+			squad.finish(done);
+			return;
+		}
+		if (idle.length && squad.mayResend()) squad.order({
+			type: "move",
+			point: at
+		}, idle.map((unit) => unit.id));
+	};
+}
+//#endregion
+export { arrive, capturePointsOf, foesNear, goFight, inSight, onMap, placeOf, planRoute, watchFight };
+
+//# sourceMappingURL=shared.js.map

package/dist/ai/tasks/shared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.js","names":[],"sources":["../../../src/ai/tasks/shared.ts"],"sourcesContent":["/**\n * What the kit's tasks share (design review B10): where a task's data says it goes, what is fighting near a place, how a\n * fight is gone to and watched, a way round, a walk's end\n */\nimport { distSq, type Vec2 } from '#engine/math'\nimport type { Brain } from '../brain'\nimport { point, where } from '../geometry'\nimport { FIGHT_REACH } from '../reach'\nimport type { Squad } from '../squads'\nimport type { TaskDone, TaskState } from '../task'\nimport type { UnitSet } from '../view'\n\n/** How near the place it was sent to a squad is there */\nexport const ARRIVE = 8\n/** How near a place of its round a patrol is there, and a little more for each of its units (they stand round it) */\nexport const PATROL_ARRIVE = 4\n/** How near the place it was sent to look at a scout that stopped short is as near as the ground lets it: further is stuck */\nexport const SCOUT_NEAR = 16\n\n/**\n * What a task that fights somewhere is given (`attack`, `harass`, `creep`): a place, or a target (an entity, as it\n * goes), a way round their army (`avoid: 'army'`) or by a place (`via`)\n *\n * @beta\n */\nexport type FightData = {\n\tat?: Vec2\n\ttarget?: number\n\tavoid?: 'army' | false\n\tvia?: Vec2\n}\n\n/**\n * What a task that fights remembers: its way round, and the worker it hunts (`harass`)\n *\n * @beta\n */\nexport type FightMemory = {\n\trouted?: boolean\n\twaypoints?: Vec2[]\n\tprey?: number\n}\n\n/** Where a task's data says it goes: its target where it is in sight, else its place */\nexport function placeOf(ai: Brain, state: TaskState<FightData, FightMemory>): Vec2 | undefined {\n\tconst target = typeof state.data.target === 'number' ? ai.view.byId(state.data.target) : undefined\n\tif (target) return point(target)\n\treturn state.data.at\n}\n\n/** Whether a place is on the map */\nexport function onMap(ai: Brain, at: Vec2): boolean {\n\tconst { width, depth } = ai.session.terrain\n\treturn at.x >= 0 && at.z >= 0 && at.x < width && at.z < depth\n}\n\n/** What is hostile and alive near a place: what a squad there fights */\nexport function foesNear(ai: Brain, at: Vec2, radius = FIGHT_REACH): UnitSet {\n\treturn ai.view.hostile.alive().near(at, radius)\n}\n\n/**\n * Sets a task on its way to fight at its place: by the waypoints of a way round (`avoid`) where there are any, walking\n * them, then attack-moving there; else attack-moving, or attacking its target\n */\nexport function goFight(ai: Brain, squad: Squad, state: TaskState<FightData, FightMemory>): void {\n\tconst at = placeOf(ai, state)\n\tif (!at) return\n\tstate.phase = 'going'\n\tstate.phaseSince = ai.tick\n\tconst waypoints = state.memory.waypoints ?? []\n\tconst target = inSight(ai, state)\n\tconst units = squad.data.units\n\tif (waypoints.length) {\n\t\t// a waypoint already passed is not gone back to: the squad goes on from the next\n\t\tconst middle = squad.centre()\n\t\tconst next = middle ? waypoints.findIndex((each) => distSq(each, middle) > ARRIVE * ARRIVE) : 0\n\t\tconst left = next < 0 ? [] : waypoints.slice(next)\n\t\tleft.forEach((each, i) => squad.order({ type: 'move', point: each }, units, i > 0))\n\t\tif (left.length) {\n\t\t\tsquad.fight(at, units, target, true)\n\t\t\treturn\n\t\t}\n\t}\n\tsquad.fight(at, units, target)\n}\n\n/**\n * Watches a squad on its way to fight or fighting: done once there with nothing left to fight, or once its target is\n * gone; the units that stand idle short of it sent again\n */\nexport function watchFight(ai: Brain, squad: Squad, state: TaskState<FightData, FightMemory>): void {\n\tconst target = typeof state.data.target === 'number' ? state.data.target : undefined\n\tif (target !== undefined && !ai.view.byId(target)) {\n\t\tsquad.finish('lost')\n\t\treturn\n\t}\n\tconst at = placeOf(ai, state)\n\tif (!at || !onMap(ai, at)) {\n\t\tsquad.finish('lost')\n\t\treturn\n\t}\n\tconst middle = squad.centre()\n\tif (!middle) return\n\tconst fighting = foesNear(ai, middle).length > 0\n\tif (state.phase !== 'regrouping') {\n\t\tconst phase = fighting ? 'fighting' : 'going'\n\t\tif (phase !== state.phase) {\n\t\t\tstate.phase = phase\n\t\t\tstate.phaseSince = ai.tick\n\t\t}\n\t}\n\tif (!fighting && distSq(middle, at) < ARRIVE * ARRIVE && !foesNear(ai, at).length) {\n\t\tsquad.finish('cleared')\n\t\treturn\n\t}\n\tif (state.phase === 'regrouping' || !squad.mayResend()) return\n\t// what stands idle short of the place lost its order (a target fell, a path ended): on to the place again\n\tconst idle = squad.idleUnits().filter((unit) => distSq(unit, at) >= ARRIVE * ARRIVE || foesNear(ai, at).length > 0)\n\tif (idle.length)\n\t\tsquad.fight(\n\t\t\tat,\n\t\t\tidle.map((unit) => unit.id),\n\t\t\tinSight(ai, state)\n\t\t)\n}\n\n/**\n * A task's target where it is in sight, to attack it by name: a building remembered out of sight (`visible: false`)\n * cannot be told to be attacked, and is attack-moved to instead\n */\nexport function inSight(ai: Brain, state: TaskState<FightData, FightMemory>): number | undefined {\n\tif (typeof state.data.target !== 'number') return undefined\n\tconst entity = ai.view.byId(state.data.target)\n\treturn entity && entity.visible ? entity.id : undefined\n}\n\n/** Works out the way round for a task that avoids, as it begins: kept in its memory, said in the decision log */\nexport function planRoute(ai: Brain, squad: Squad, state: TaskState<FightData, FightMemory>): void {\n\t// a way of its own, given: by that place\n\tconst via = state.data.via\n\tif (via && !state.memory.routed) {\n\t\tstate.memory.routed = true\n\t\tstate.memory.waypoints = [point(via)]\n\t\treturn\n\t}\n\tif (state.data.avoid !== 'army' || state.memory.routed) return\n\tstate.memory.routed = true\n\tconst from = squad.centre()\n\tconst to = placeOf(ai, state)\n\tif (!from || !to) return\n\tconst { waypoints, note } = ai.squads.route(from, to, squad)\n\tif (waypoints.length) state.memory.waypoints = waypoints\n\tif (note) ai.decide(`squad ${squad.name} ${state.kind}s ${where(to)}: ${note}`, { kind: 'squad' })\n}\n\n/** The capture points of the game (`capturePack`), as the report tells the brain: none for a game without them */\nexport function capturePointsOf(ai: Brain): { id: string; owner: number | null; x: number; z: number }[] {\n\tconst listed = (ai.view.report as { captures?: unknown } | undefined)?.captures\n\treturn Array.isArray(listed) ? (listed as { id: string; owner: number | null; x: number; z: number }[]) : []\n}\n\n/**\n * A walk's think: done (as `done` says) once its middle is near the place, or once all of it stands idle as near as the\n * ground let it go; what stands idle short of it, while others walk on, is sent again\n */\nexport function arrive(done: TaskDone): (ai: Brain, squad: Squad, state: TaskState<{ at?: Vec2 }>) => void {\n\treturn (ai, squad, state) => {\n\t\tconst at = state.data.at\n\t\tconst middle = squad.centre()\n\t\tif (!at || !middle) {\n\t\t\tsquad.finish(done)\n\t\t\treturn\n\t\t}\n\t\tconst near = Math.max(ARRIVE / 2, squad.spread() / 2)\n\t\tconst idle = squad.idleUnits()\n\t\tif (\n\t\t\tdistSq(middle, at) <= near * near ||\n\t\t\t(ai.tick > state.phaseSince && idle.length === squad.data.units.length && distSq(middle, at) <= squad.spread() * squad.spread() * 4)\n\t\t) {\n\t\t\tsquad.finish(done)\n\t\t\treturn\n\t\t}\n\t\tif (idle.length && squad.mayResend())\n\t\t\tsquad.order(\n\t\t\t\t{ type: 'move', point: at },\n\t\t\t\tidle.map((unit) => unit.id)\n\t\t\t)\n\t}\n}\n"],"mappings":";;;;AA4CA,SAAgB,QAAQ,IAAW,OAA4D;CAC9F,MAAM,SAAS,OAAO,MAAM,KAAK,WAAW,WAAW,GAAG,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI,KAAA;CACzF,IAAI,QAAQ,OAAO,MAAM,MAAM;CAC/B,OAAO,MAAM,KAAK;AACnB;;AAGA,SAAgB,MAAM,IAAW,IAAmB;CACnD,MAAM,EAAE,OAAO,UAAU,GAAG,QAAQ;CACpC,OAAO,GAAG,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,IAAI,SAAS,GAAG,IAAI;AACzD;;AAGA,SAAgB,SAAS,IAAW,IAAU,SAAA,IAA+B;CAC5E,OAAO,GAAG,KAAK,QAAQ,MAAM,CAAC,CAAC,KAAK,IAAI,MAAM;AAC/C;;;;;AAMA,SAAgB,QAAQ,IAAW,OAAc,OAAgD;CAChG,MAAM,KAAK,QAAQ,IAAI,KAAK;CAC5B,IAAI,CAAC,IAAI;CACT,MAAM,QAAQ;CACd,MAAM,aAAa,GAAG;CACtB,MAAM,YAAY,MAAM,OAAO,aAAa,CAAC;CAC7C,MAAM,SAAS,QAAQ,IAAI,KAAK;CAChC,MAAM,QAAQ,MAAM,KAAK;CACzB,IAAI,UAAU,QAAQ;EAErB,MAAM,SAAS,MAAM,OAAO;EAC5B,MAAM,OAAO,SAAS,UAAU,WAAW,SAAS,OAAO,MAAM,MAAM,IAAI,EAAe,IAAI;EAC9F,MAAM,OAAO,OAAO,IAAI,CAAC,IAAI,UAAU,MAAM,IAAI;EACjD,KAAK,SAAS,MAAM,MAAM,MAAM,MAAM;GAAE,MAAM;GAAQ,OAAO;EAAK,GAAG,OAAO,IAAI,CAAC,CAAC;EAClF,IAAI,KAAK,QAAQ;GAChB,MAAM,MAAM,IAAI,OAAO,QAAQ,IAAI;GACnC;EACD;CACD;CACA,MAAM,MAAM,IAAI,OAAO,MAAM;AAC9B;;;;;AAMA,SAAgB,WAAW,IAAW,OAAc,OAAgD;CACnG,MAAM,SAAS,OAAO,MAAM,KAAK,WAAW,WAAW,MAAM,KAAK,SAAS,KAAA;CAC3E,IAAI,WAAW,KAAA,KAAa,CAAC,GAAG,KAAK,KAAK,MAAM,GAAG;EAClD,MAAM,OAAO,MAAM;EACnB;CACD;CACA,MAAM,KAAK,QAAQ,IAAI,KAAK;CAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,GAAG;EAC1B,MAAM,OAAO,MAAM;EACnB;CACD;CACA,MAAM,SAAS,MAAM,OAAO;CAC5B,IAAI,CAAC,QAAQ;CACb,MAAM,WAAW,SAAS,IAAI,MAAM,CAAC,CAAC,SAAS;CAC/C,IAAI,MAAM,UAAU,cAAc;EACjC,MAAM,QAAQ,WAAW,aAAa;EACtC,IAAI,UAAU,MAAM,OAAO;GAC1B,MAAM,QAAQ;GACd,MAAM,aAAa,GAAG;EACvB;CACD;CACA,IAAI,CAAC,YAAY,OAAO,QAAQ,EAAE,IAAI,MAAmB,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,QAAQ;EAClF,MAAM,OAAO,SAAS;EACtB;CACD;CACA,IAAI,MAAM,UAAU,gBAAgB,CAAC,MAAM,UAAU,GAAG;CAExD,MAAM,OAAO,MAAM,UAAU,CAAC,CAAC,QAAQ,SAAS,OAAO,MAAM,EAAE,KAAK,MAAmB,SAAS,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC;CAClH,IAAI,KAAK,QACR,MAAM,MACL,IACA,KAAK,KAAK,SAAS,KAAK,EAAE,GAC1B,QAAQ,IAAI,KAAK,CAClB;AACF;;;;;AAMA,SAAgB,QAAQ,IAAW,OAA8D;CAChG,IAAI,OAAO,MAAM,KAAK,WAAW,UAAU,OAAO,KAAA;CAClD,MAAM,SAAS,GAAG,KAAK,KAAK,MAAM,KAAK,MAAM;CAC7C,OAAO,UAAU,OAAO,UAAU,OAAO,KAAK,KAAA;AAC/C;;AAGA,SAAgB,UAAU,IAAW,OAAc,OAAgD;CAElG,MAAM,MAAM,MAAM,KAAK;CACvB,IAAI,OAAO,CAAC,MAAM,OAAO,QAAQ;EAChC,MAAM,OAAO,SAAS;EACtB,MAAM,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC;EACpC;CACD;CACA,IAAI,MAAM,KAAK,UAAU,UAAU,MAAM,OAAO,QAAQ;CACxD,MAAM,OAAO,SAAS;CACtB,MAAM,OAAO,MAAM,OAAO;CAC1B,MAAM,KAAK,QAAQ,IAAI,KAAK;CAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI;CAClB,MAAM,EAAE,WAAW,SAAS,GAAG,OAAO,MAAM,MAAM,IAAI,KAAK;CAC3D,IAAI,UAAU,QAAQ,MAAM,OAAO,YAAY;CAC/C,IAAI,MAAM,GAAG,OAAO,SAAS,MAAM,KAAK,GAAG,MAAM,KAAK,IAAI,MAAM,EAAE,EAAE,IAAI,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAClG;;AAGA,SAAgB,gBAAgB,IAAyE;CACxG,MAAM,SAAU,GAAG,KAAK,QAA+C;CACvE,OAAO,MAAM,QAAQ,MAAM,IAAK,SAA0E,CAAC;AAC5G;;;;;AAMA,SAAgB,OAAO,MAAoF;CAC1G,QAAQ,IAAI,OAAO,UAAU;EAC5B,MAAM,KAAK,MAAM,KAAK;EACtB,MAAM,SAAS,MAAM,OAAO;EAC5B,IAAI,CAAC,MAAM,CAAC,QAAQ;GACnB,MAAM,OAAO,IAAI;GACjB;EACD;EACA,MAAM,OAAO,KAAK,IAAA,GAAgB,MAAM,OAAO,IAAI,CAAC;EACpD,MAAM,OAAO,MAAM,UAAU;EAC7B,IACC,OAAO,QAAQ,EAAE,KAAK,OAAO,QAC5B,GAAG,OAAO,MAAM,cAAc,KAAK,WAAW,MAAM,KAAK,MAAM,UAAU,OAAO,QAAQ,EAAE,KAAK,MAAM,OAAO,IAAI,MAAM,OAAO,IAAI,GACjI;GACD,MAAM,OAAO,IAAI;GACjB;EACD;EACA,IAAI,KAAK,UAAU,MAAM,UAAU,GAClC,MAAM,MACL;GAAE,MAAM;GAAQ,OAAO;EAAG,GAC1B,KAAK,KAAK,SAAS,KAAK,EAAE,CAC3B;CACF;AACD"}

package/dist/ai/team.d.ts

@@ -9,9 +9,11 @@ import { type AiModuleDef } from './module';
 export interface TeamRequest {
     /** Its number on the board */
     id: number;
+    /** What is asked: help, an attack, a defence or a rally */
     kind: 'help' | 'attack' | 'defend' | 'rally';
     /** Who asks: a computer of the team, or a person whose ping or plight it is */
     from: PlayerId;
+    /** Where the help is asked, in cells */
     at: Vec2;
     /** The enemy strength seen there as it was asked (0 for none seen: a ping on a place) */
     strength: number;
@@ -28,11 +30,15 @@ export interface TeamRequest {
  * @beta
  */
 export interface AttackPlan {
+    /** Where the attack goes, in cells */
     target: Vec2;
     /** The tick the waves go at */
     at: number;
+    /** The player who proposed the attack */
     by: PlayerId;
+    /** The computers that joined the attack */
     joined: PlayerId[];
+    /** The computers that declined it */
     declined: PlayerId[];
     /** The tick it was proposed at */
     since: number;
@@ -43,8 +49,11 @@ export interface AttackPlan {
  * @beta
  */
 export interface TeamBoard {
+    /** The version of the board's format: 1 so far */
     v: 1;
+    /** The requests on the board */
     requests: TeamRequest[];
+    /** The attack the computers agreed on; nothing when there is none */
     plan?: AttackPlan;
     /** What each computer of the team remembers of the enemy's bases, and when it last thought */
     known: Record<string, {
@@ -68,7 +77,7 @@ export interface TeamOptions {
     /** Whether it helps its allies, people and computers, where asked (the classic Defend Users): yes when left out */
     defendUsers?: boolean;
     /**
-     * Whether it does what an ally's ping asks besides help (`GameRules.talk.pings.meanings`): a squad sent to fight at
+     * Whether it does what an ally's ping asks besides help (`RuleSettings.talk.pings.meanings`): a squad sent to fight at
      * an `attack` (a push), one to hold a place at a `defend` (a hold), its squads out brought home at a `rally` (a
      * retreat). Yes when left out
      */
@@ -95,8 +104,11 @@ export interface TeamOptions {
  * @beta
  */
 export interface TeamPlayMemory {
+    /** The version of the memory's format: 1 so far */
     v: 1;
+    /** Up to which board request, by number, it heard */
     heard: number;
+    /** When it last said each line, by line */
     said: Record<string, number>;
 }
 /**
@@ -106,8 +118,11 @@ export interface TeamPlayMemory {
  * @beta
  */
 export interface TeamReport {
+    /** The team's number */
     team: number;
+    /** The computer players of the team */
     computers: PlayerId[];
+    /** The requests on the board, each with its number, kind, who asked, where, strength, source, who answered and how long is left */
     requests: {
         id: number;
         kind: TeamRequest['kind'];
@@ -118,6 +133,7 @@ export interface TeamReport {
         answered: PlayerId[];
         left: number;
     }[];
+    /** The attack together, with its target, how many seconds off it is, who proposed it, who joined and who declined */
     plan?: {
         target: [number, number];
         in: number;
@@ -125,6 +141,7 @@ export interface TeamReport {
         joined: PlayerId[];
         declined: PlayerId[];
     };
+    /** How many enemy bases the team knows */
     enemyBases: number;
 }
 /**