Problem Statement

Given a jumbled list of the numbers   1   to   9   that are definitely   not   in ascending order. Show the list,   and then ask the player how many digits from the left to reverse. Reverse those digits,   then ask again,   until all the digits end up in ascending order.

The score is the count of the reversals needed to attain the ascending order.

Note: Assume the player's input does not need extra validation.

Let's start with the solution:

game()={
  my(v=numtoperm(9,random(9!-1)),score,in,t); \\ Create vector with 1..9, excluding the one sorted in ascending order
  while(v!=vecsort(v),
    print(concat(concat([""],v)));
    in=input();
    for(i=0,in\2-1,
      t=v[9-i];
	  v[9-i]=v[10-in+i];
	  v[10-in+i]=t
    );
    score++
  );
  score
};