Another Example of Value Iteration (Software Implementation) Consider the same one-dimensional grid with reward values as in the first few problems in this vertical. However, consider the following change to the transition probabilities: At any given grid location the agent can choose to either stay at the location or move to an adjacent grid location. If the agent chooses to stay at the location, such an action is successful with probability $1/2$ and if the agent is at the leftmost or rightmost grid location it ends up at its neighboring grid location with probability $1/2$ , if the agent is at any of the inner grid locations it has a probability $1/4$ each of ending up at either of the neighboring locations. If the agent chooses to move (either left or right) at any of the inner grid locations, such an action is successful with probability $1/3$ and with probability $2/3$ it fails to move, and if the agent chooses to move left at the leftmost grid location, then