ai :: SearchSolver :: run_steps
steps_limit
Return the best solution so far (if any)
# Update `steps_limit` then just run some additional steps # Return the best solution so far (if any) fun run_steps(steps: Int): nullable SearchNode[S,A] do assert steps > 0 self.steps_limit = self.steps + steps return run end