// eventually both players reach their goal without crashing
<<p1:p2>>max=?(P[F "goal1" ] + P[F "goal2" ])

// players reach their goals within a bounded number of steps
<<p1:p2>>max=?(P[F<=k "goal1"] + P[F<=k "goal2"])

// one bounded and one unbounded
<<p1:p2>>max=?(P[F "goal1"] + P[F<=k "goal2"])