rimlike/scenes/ai/chop_provider.gd
megaproxy e7a2407af2 Job: target_node claim so pawns don't cluster on the same target
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>
2026-05-12 13:45:44 +01:00

52 lines
1.7 KiB
GDScript

class_name ChopProvider extends WorkProvider
## WorkProvider for the "chop" work category.
##
## Scans World.trees for the nearest choppable Tree (Manhattan distance from
## the requesting pawn) and returns a two-toil Job:
## walk_to(tree.tile) → interact(tree.get_path(), "on_chop_tick")
##
## The INTERACT toil calls Tree.on_chop_tick() once per sim tick; the Tree
## internally tracks chop_progress and calls fell() when CHOP_TICKS is
## reached. The toil finishes automatically when is_choppable() returns
## false (felled) or when the node is freed.
##
## Phase 4 simplification: trees do not block pathfinding, so walking directly
## to tree.tile is valid. No adjacency-offset needed.
##
## Duck-typing note: Tree is referenced without class_name (class may not be
## registered yet when this provider loads). We rely only on:
## tree.tile: Vector2i
## tree.is_choppable() -> bool
## tree.get_path() -> NodePath
func _init() -> void:
category = &"chop"
priority = 5 # Higher than rest (priority 0); scanned before it by Decision.
## Returns a Job targeting the nearest choppable Tree, or null if none exists.
## `pawn` is duck-typed: must expose .tile (Vector2i).
func find_best_for(pawn) -> Job:
var best = null
var best_dist: int = 999999
for tree in World.trees:
if not tree.is_choppable():
continue
if Job.is_target_taken_by_other(tree, pawn):
continue
var d: int = abs(tree.tile.x - pawn.tile.x) + abs(tree.tile.y - pawn.tile.y)
if d < best_dist:
best_dist = d
best = tree
if best == null:
return null
var j := Job.new()
j.label = "Chop tree at %s" % best.tile
j.target_node = best
j.toils.append(Toil.walk_to(best.tile))
j.toils.append(Toil.interact(best.get_path(), &"on_chop_tick"))
return j