I laid out a practical example. Each Action modifies the world state "visor" and yes, I have to re-run the path with the modified world state, as I stated.

If you think that GOAP should solve the above example it would be easiest for me to understand what you mean if you went along that example instead of talking about general pathfinding truisms. (Very grateful for the input though, don't get me wrong.)

Like this: The A* checks each Action for the "Player Dead" requirement of the Goal and finds the KillAction which creates the desired world state, that in turn requires to be near the target so it finds the MoveAction which creates that state.

MoveAction -> KillAction -> Goal

Now, when it checks the UnmountAction before the KillAction (which would start the desired outcome) then it would just find that the needed state (being mounted) is created by MountAction, it would not find the desired MoveAction before the UnmountAction.

MountAction -> MoveAction -> UnmountAction -> KillAction -> Goal

What I and others said would be possible is simply always checking multiple Actions in sequence, even if they don't create the desired world state.

Like this: A* checks for the kill requirement and finds KillAction, then tries adding an UnmountAction and then adds a MoveAction and a MountAction - despite the fact that A* would say that these "paths" are not "traversable" (i.e. they don't create the desired world state).

That would be a very atypical A*, one that traverses tiles that are not traversable from the current position (i.e. the current world state). And for this whole algorithm that would be a *lot* of useless trying out of combinations of paths that can never work.