restart;

n:=10:

A:=Matrix(n, (i,j)->`if`(i=j,0,n*(n-i)^4+2*j+(n-i)^2+j^3)):A[1,2]:=100*n^3:A;

with(GraphTheory):

G:=Graph(A);

t:=time[real]():
TravelingSalesman(G);
'time'=time[real]()-t;

############### brute-force #############

t:=time[real]():
P:=Iterator:-Permute([seq(2..n)]):
cmin:=infinity: ord:=<"none">:
for  v in P do
  f:=add(A[v[k],v[k+1]],k=1..n-2) + A[1,v[1]]+A[v[n-1],1];
  if f<cmin then cmin:=f; ord:=copy(v) fi;
od:
cmin,[1, entries(ord,'nolist',indexorder),1];
'time'=time[real]()-t;

# And for n=11 I had to interrupt TravelingSalesman;
# brute-force still works for n=12.

restart;

Digits:=10;
to 10 do
evalf(add(sin(k), k = 1 .. 10000)) od;

restart;   # execute several times to obtain randomness

interface(version);

Digits:=18;

to 10 do  
evalf(add(sin(k), k = 1 .. 10000)) od;