New G2 HP Prime

[xerxes]

After reading the comments about the correct timing of the code, I checked the test code for the G2 more carefully and
found a serious bug. X has to be zero at the beginning of the execution, but this is only the case at the first iteration,
bacause X:=0 is outside the FOR loop. To have the MAKELIST outside the loop doesn't seem that critical to me, because
the execution time is surely minimal in relation to the test code itself. To minimize the overhead effect, I've used
simply more iterations for very fast results. I would suggest 100 iterations in the case of the Prime. I hope, that I've
made no mistake correcting the test code:

Code:

EXPORT NQUEENS()
 BEGIN
   R:=8;
   L1:=MAKELIST(0,X,1,R,1);
   startTime := TICKS(); // inserted code to measure start time
   // inserted code to run the problem 100 times
   FOR I FROM 1 TO 100 DO 
     S:=0;
     X:=0;
     REPEAT
       X:=X+1;
       L1(X):=R;
       REPEAT
         S:=S+1;
         Y:=X;
         WHILE Y>1 DO
           Y:=Y-1;
           T:=L1(X)-L1(Y);
           IF T==0 OR X-Y==ABS(T) THEN
             Y:=0;
             L1(X):=L1(X)-1;
             WHILE L1(X)==0 DO
               X:=X-1;
               L1(X):=L1(X)-1;
             END;
           END;
         END;
       UNTIL Y==1 END;
     UNTIL X==R END;
  END;
  endTime := TICKS(); // inserted code to measure end time
  // inserted code to calculate duration
  duration := (endTime - startTime)/1000;
  RETURN {duration,S};
 END;

Sorry for the complications to Anders.