Assume that:

the length of string moves is within the range $[1.\mathrm{.}100]$;

string moves is made only of the following characters: and$/$or $\text{'}$v$\text{'}$;

the robot never visits the, point twice, except for the starting point, which may be visited at the start and end of the robot's path.