2012-11-07 16:00:00 UTC

# Warp 40

Status: Passed
Results: 1218 (cyc: 8, node: 1141)
CPU Time: 169.381
Score: 1081880000.0
Submitted at: 2012-11-07 00:49:52 UTC
Scored at: 2012-11-07 01:31:38 UTC

Current Rank: 1891st (Highest: 1573rd )
Based on: Tu Warp (diff)
Basis for: Warp 40 Bonus 8 (diff)
Basis for: Warp 40 Bonus 16 (diff)
Basis for: Warp 42 Bonus 4x8 (diff)
...and 1 other.

Code
```function xyOut = solver(a, xyIn, wts)
diag(sum(a));
[V,~]=eig(ans-a,ans);
N = length(a);
[p1i,p2i] = find( triu(a,1));
[pickr,pickc] = find(tril(true(nnz(triu(a,1))),-1));

for ss=1:3
[xy{ss} xy{ss+3}] = solver_alfonsoz (a, ss+1, N, V+rand(size(V))/25); % (Biswas)
end
[xy{7} xy{8}] = solver_alfonsoz (a, 1, N, V);
xy{9} = solver_hannes(xyIn, N, V(:,2:3),0);

parfor ss=1:9
end

[ZBest,best] = min(NN);
xyOut = xy{best};

xyOut = bsxfun(@minus,xyOut,round(wts*(xyOut-xyIn)./sum(wts)));

sprev = rng(0,'twister');

for ii=1:4
for jiggle=1:40
xyOutZ=xyOut+randi([-ii ii],N,2);
xyOut=xyOutZ;
end
end
end

rng(sprev);

for jiggle=2:min(40,N)
xyOutJ1=xyOut;
xyOutJ2=xyOut;
idx=jiggle:jiggle:2*N;

xyOutJ1(idx)=xyOut(idx)+1;
xyOutJ2(idx)=xyOut(idx)-1;
end
end

xyOut=xyOutJ1; % Use jiggle enhanced for more jiggling
%break % Greedy
xyOut=xyOutJ2; % Use jiggle enhanced for more jiggling
%break % Greedy
end
end

function [xyOut xyOut1] = solver_alfonsoz(a, ss, N, V)
randn('seed',ss);
xyOut=V(:,2:3);
sN=sqrt(N);
for ncut=1:2
Mbeta=((1-ss/15)*eye(N)+(ss/15)*bsxfun(@rdivide,a+eye(N),sum(a,2)+1))^10;
for n1=1:(117+ss)
xyOut=Mbeta*xyOut;
xc = bsxfun(@minus,xyOut,sum(xyOut)/N);
[c1,D]=svd(xc');
xyOut=xc*c1*diag(sN./(.1+D([1 4])))*c1';
end
[i,j]=find(a>0.002+ss*5.1e-4);
dd=sum((xyOut(i,:)-xyOut(j,:)).^2,2);
k=find(dd>(3.15 + ss*0.102)*mean(dd));
if isempty(k), break; end
a(i(k)+N*(j(k)-1))=0.002+ss*5.1e-4;
end

xyOutH=xyOut;
single_idx = find(sum(a)==1);

for zsingle=1:2
xyOut0=sqrt(N)*detrend(xyOut,'constant')*diag(1./std(xyOut,1,1));
k=5;
[sxyOut0,idxequal]=sortrows(round(15*xyOut0));
idxequal=idxequal(all(~diff(sxyOut0,1,1),2));
xyOut=round(xyOut0);
while size(unique(xyOut,'rows'),1)~=N
k=k*(1.0+ss*0.055);
xyOut=xyOut0*k;
xyOut(idxequal,:)=(xyOut0(idxequal,:)+randn(numel(idxequal),2)/(9+ss))*k;
xyOut=round(xyOut);
end
if zsingle==1
xyOut1=xyOut;
xyOut=xyOutH;
end
end
end

function xyOut = solver_hannes(xyIn, N, V,xyOut)
mult    = norm(max(xyIn)-min(xyIn))/norm(max(V)-min(V));
%xyOut   = [];
while size(unique(xyOut,'rows'),1)<N
xyOut       = round(V*mult);
[~,i]       = unique(xyOut,'rows');
m           = setdiff(1:N,i);
xyOut(m,:)  = xyOut(m,:) + round(rand(length(m),2))*2 - 1;
mult        = mult*1.5;
end
end

X = [XYnew(p1i,:) XYnew(p2i,:)];
xa = X(pickr,:);
xb = X(pickc,:);
a = xa(:,1).*xa(:,4) - xa(:,2).*xa(:,3);
b = xb(:,1).*xb(:,4) - xb(:,2).*xb(:,3);
Px_n = a.*(xb(:,1) - xb(:,3)) - b.*(xa(:,1) - xa(:,3));
Py_n = a.*(xb(:,2) - xb(:,4)) - b.*(xa(:,2) - xa(:,4));
Pxy_d = (xa(:,1) - xa(:,3)).*(xb(:,2) - xb(:,4)) - ...
(xa(:,2) - xa(:,4)).*(xb(:,1) - xb(:,3));

sum(all([(xa(:,1).*Pxy_d - Px_n).*(Px_n - xa(:,3).*Pxy_d) >=0   ...
(xa(:,2).*Pxy_d - Py_n).*(Py_n - xa(:,4).*Pxy_d) >=0  ...
(xb(:,1).*Pxy_d - Px_n).*(Px_n - xb(:,3).*Pxy_d) >=0  ...
(xb(:,2).*Pxy_d - Py_n).*(Py_n - xb(:,4).*Pxy_d) >=0],2));
end```