megaproxy/rimlike
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Job: target_node claim so pawns don't cluster on the same target

Browse source 
Visible bug: with 1 wall ghost queued, all 3 pawns picked the same site;
2 stood idle while 1 built. Same shape would affect chop/mine/haul/etc.

Design: Job carries an untyped target_node ref (the tree/rock/build-site/
crop/item/patient/workbench/etc the job is acting on). Job.is_target_taken_
by_other(target, excluding_pawn) does an O(pawns) scan of live job state to
ask 'is anyone else already working this?'. Each WorkProvider's find_best_
for() now skips claimed targets in its scan and sets j.target_node before
returning. No per-entity claim state, no .claim()/.release() bookkeeping,
no save-format change — target_node is intentionally not serialized
because pawns re-decide and re-bind naturally after load.

Providers updated: construction / chop / mine / plant (harvest path) /
hauling (item AND corpse) / cleaning (target is Vector2i tile not Node;
field is untyped, doc'd) / doctor / crafting (workbench).

Not touched: rest (everyone shares the rest tile, that's fine), eat /
sleep (food and beds have their own availability gates; flagged as a
followup if multi-pawn food contention surfaces).

Verified MCP runtime: fresh boot, 3 pawns picked 3 distinct wall sites
(44,28)/(45,28)/(44,27) with distinct target_node refs.

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
This commit is contained in:
megaproxy 2026-05-12 13:45:44 +01:00
parent 07fb66608a
commit e7a2407af2
9 changed files with 70 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

6
scenes/ai/doctor_provider.gd
View file

@ -54,7 +54,8 @@ func find_best_for(pawn) -> Job:
if pawn.carried_item != null:
return null
# Find the nearest downed pawn that isn't this pawn.
# Find the nearest downed pawn that isn't this pawn and has no other doctor
# already assigned (prevents two doctors converging on one wounded pawn).
var best_patient = null
var best_dist: int = 999999
for p in World.pawns:
@ -62,6 +63,8 @@ func find_best_for(pawn) -> Job:
continue
if p == pawn:
continue
if Job.is_target_taken_by_other(p, pawn):
continue
var d: int = abs(p.tile.x - pawn.tile.x) + abs(p.tile.y - pawn.tile.y)
if d < best_dist:
best_dist = d
@ -81,6 +84,7 @@ func find_best_for(pawn) -> Job:
var j := Job.new()
j.label = "Rescue %s → bed at %s" % [best_patient.pawn_name, medical_bed.tile]
j.target_node = best_patient
# 4-toil sequence per the doctor rescue model above.
j.toils.append(Toil.walk_to(best_patient.tile))
j.toils.append(Toil.rescue(best_patient.get_path()))