ID: 
Title:tweaky bird and pushy cat 21Marco Tullio 139
Author:srachFabio Carnevale
Date:2008-05-07 11:55:182008-05-07 11:57:02
Score:13374.019713424.6646
Result:133071.00 (cyc: 21, node: 7229)133893.00 (cyc: 17, node: 6544)
CPU Time:47.885135.8456
Status:PassedPassed
Code:
function W = solv(B) - tweak = rand(43,1); - W=solverF(B); - S = mygrade(B,W); - - [nr,nc] = size(B); - [W2,S2] = sunday(B,[1 2],[1 2],4*nr*nc); - if S > S2 - W = W2; - S=S2; + PShF=1562; + f8Ii = rand(43,1); + W=EdPD(B); + kDT3 = lPE1(B,W); + [Ry7u,WbAf] = size(B); + vwi7 = B(Ry7u:-1:1,:); + vwi7 = vwi7.'; + [VBNf,dERH] = BdjM(vwi7,[1 2],[1 2],4*Ry7u*WbAf); + if kDT3 > dERH + W = [Ry7u-VBNf(:,2)+1 VBNf(:,1) Ry7u-VBNf(:,4)+1 VBNf(:,3)]; + kDT3=dERH; end - - - X = B(nr:-1:1,:); - X = X.'; - - [W2,S2] = sunday(X,[1 2],[1 2],4*nr*nc); - if S > S2 - W = [nr-W2(:,2)+1 W2(:,1) nr-W2(:,4)+1 W2(:,3)]; - S=S2; + uJln=rand('state'); + rand(PShF,1); + if kDT3>1000 + [VBNf,dERH] = BdjM(vwi7,[1 2],[1 2],4*Ry7u*WbAf); + if kDT3 > dERH + W = [Ry7u-VBNf(:,2)+1 VBNf(:,1) Ry7u-VBNf(:,4)+1 VBNf(:,3)]; + kDT3=dERH; end - end - - - function [W,S] = sunday(B0,x000,y000,th000) - [nR,nC]=size(B0); - Borig= -ones(nR+2,nC+2); - Borig(2:end-1,2:end-1)=B0; - Bedit = Borig; - - maxbridges = 4; - - if size(Bedit,2) > 18 - cutfirst = 4; - cutsecond = 8; - cutoff = 18; + rand('state',uJln); + end + function [W,kDT3] = BdjM(szhU,KANa,dMHM,TXvQ) + [zFQ6,WYCZ]=size(szhU); + DUxB= -ones(zFQ6+2,WYCZ+2); + DUxB(2:end-1,2:end-1)=szhU; + LOEe = DUxB; + bbQx = 4; + if size(LOEe,2) > 20 + QTLP = 4; + Qxak = 8; + Ks71 = 18; else - cutfirst = 3; - cutsecond = 7; - cutoff = 13; + QTLP = 3; + Qxak = 7; + Ks71 = 13; end - - S = inf; - X1 = [1 2;2 1]; - X2 = [1 3;3 1]; - Y = [3 2 1;1 2 3]; - - % fprintf('\n'); - - for x = x000 - if x == 2 - [U BU] = phase1(Bedit,cutfirst,X1(x,:)); - [UU BUU] = phase3(BU,U,cutsecond,X2(x,:)); - [V BX] = phase3(BUU,UU,cutoff,X2(x,:)); - else - [U BU] = phase1(Bedit,4,X1(x,:)); - [V BX] = phase3(BU,U,11,X2(x,:)); - end - - for y = y000 - % if x == 1 && y == 2, continue, end - %if x == 2 && y == 2 && S > th000, return, end - W1 = phase2_a(Bedit,BX,V,maxbridges,cutoff,Y(y,:))-1; - S1 = mygrade(B0,W1); - % fprintf('x=%d, y=%d, %d', x, y, S1); - % if isfinite(S), fprintf(' (%4d)\n', S1 - S), else, - % fprintf('\n'), end - if S1 <= S - S = S1; - W = W1; - maxbridges = maxbridges - 1; - end - end + kDT3 = inf; + fbMU = [1 2;2 1]; + CNS4 = [1 3;3 1]; + QDCZ = [3 2 1;1 2 3]; + for cq5g = KANa + if cq5g == 2 + [uPVz hHv8] = BBcO(LOEe,QTLP,fbMU(cq5g,:)); + [yAUb T15I] = Tnn0(hHv8,uPVz,Qxak,CNS4(cq5g,:)); + [VGSy Tw_F] = Tnn0(T15I,yAUb,Ks71,CNS4(cq5g,:)); + else + [uPVz hHv8] = BBcO(LOEe,4,fbMU(cq5g,:)); + [VGSy Tw_F] = Tnn0(hHv8,uPVz,11,CNS4(cq5g,:)); end + for RCWw = dMHM + V8ZD = cxLA(LOEe,Tw_F,VGSy,bbQx,Ks71,QDCZ(RCWw,:))-1; + oN11 = lPE1(szhU,V8ZD); + if oN11 <= kDT3 + kDT3 = oN11; + W = V8ZD; + bbQx = bbQx - 1; end - - %% - function score = mygrade(B,W) - nR=size(B,1); - B(W(:,1)+(W(:,2)-1)*nR)=0; - B(W(:,3)+(W(:,4)-1)*nR)=0; - score=sum(B(:))+size(W,1)+sum(W(:,1)==W(:,3)&W(:,2)==W(:,4))*24; end - - %% - function [pincount k] = analyzeboard(B,rz) - - % make a sorted list of all pins - pin = sort(B(B>0),'descend'); - npins = size(pin,1); - if npins < 1 - pincount = []; - k = 0; - return end - - uniPins=pin(diff([0;pin])~=0); - % pin, count, benefit - - pincount = zeros(nnz(uniPins),3); - thesepins=histc(pin,uniPins(end:-1:1)); - pincount(:,1)=uniPins; - pincount(:,2)=thesepins(end:-1:1); - k=nnz(uniPins); - - if rz < 3, return, end - % calculate the benefit of a path - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - d = 0; - N = size(row,1); - d=sum(abs(diff(row))+abs(diff(col))); - pincount(i,3) = pincount(i,2)*p - 0.85 * d; - end end + function a_hU = lPE1(B,W) + zFQ6=size(B,1); + B(W(:,1)+(W(:,2)-1)*zFQ6)=0; + B(W(:,3)+(W(:,4)-1)*zFQ6)=0; + a_hU=sum(B(:))+size(W,1)+sum(W(:,1)==W(:,3)&W(:,2)==W(:,4))*24; end - - %% - function [W B] = phase1(B,cutoff,rz) - % fprintf('-- phase 1 --\n'); - + function [Nh_K M_Ok] = FMI2(B,McbD) + LAnr = sort(B(B>0),'descend'); + W4qT = size(LAnr,1); + if W4qT < 1 + Nh_K = []; + M_Ok = 0; + return + end + lRNU=LAnr(diff([0;LAnr])~=0); + Nh_K = zeros(nnz(lRNU),3); + YGG3=histc(LAnr,lRNU(end:-1:1)); + Nh_K(:,1)=lRNU; + Nh_K(:,2)=YGG3(end:-1:1); + M_Ok=nnz(lRNU); + if McbD < 3, return, end + for G1xR = 1:M_Ok + if Nh_K(G1xR,2) >= 2 + IBj0 = Nh_K(G1xR,1); + [PpGv aHm1] = find(B == IBj0); + g3tC = 0; + GRaz = size(PpGv,1); + g3tC=sum(abs(diff(PpGv))+abs(diff(aHm1))); + Nh_K(G1xR,3) = Nh_K(G1xR,2)*IBj0 - 0.85 * g3tC; + end + end + end + function [W B] = BBcO(B,Ks71,McbD) W = []; - - [pincount k] = analyzeboard(B,rz); - - if k < 1 - return + [Nh_K M_Ok] = FMI2(B,McbD); + if M_Ok < 1 + return end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - [I J]=find(tril(ones(N),-1)); - dist(:,1)=J; - dist(:,2)=I; - dist(:,3)=abs(col(I)-col(J))+abs(row(I)-row(J)); - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect the closest pair possible - npins = 0; - for x = 1:Npairs - if dist(x,3) > cutoff+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = simplepath([row(a); row(b)], [col(a); col(b)], -p); - path = complexpath(B,[row(a); row(b)], [col(a); col(b)], -p, cutoff, 2*p); - if size(path,1) > 0 - % fprintf('p = %d, connect a=%d, b=%d, dist = %d\n', p, a, b, dist(x,3)); - % fprintf('\nFound path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - - % pinlist = [row(a) col(a); row(b) col(b)]; - npins = 2; - edit = [1:(a-1) (a+1):(b-1) (b+1):N]; - row = [row(a); row(b); row(edit)]; - col = [col(a); col(b); col(edit)]; - break - else - % fprintf('p = %d, cannot connect a=%d, b=%d, dist = %d\n', p, a, b, dist(x,3)); - end - end - - if npins < 2 - continue - end - - for j = 3:N - % find all pins and wires - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - % fprintf('npins = %d, nwires = %d\n', npins, Npinwires - npins); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (N - npins); - - - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = (npins+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > cutoff+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = simplepath([row2(a); row(b)], [col2(a); col(b)], -p); - path = complexpath(B,[row2(a); row(b)], [col2(a); col(b)], -p, cutoff, p); - if size(path,1) > 0 - W = [W; path]; - - B = addwirepath(B,path,-p); - - npins = npins + 1; - connected = true; - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - - end + Nh_K=sortrows(Nh_K,-McbD); + for G1xR = 1:M_Ok + if Nh_K(G1xR,2) >= 2 + IBj0 = Nh_K(G1xR,1); + [PpGv aHm1] = find(B == IBj0); + GRaz = size(PpGv,1); + ORnM = GRaz*(GRaz-1)/2; + dist = zeros(ORnM,3); + [okPk QCb9]=find(tril(ones(GRaz),-1)); + dist(:,1)=QCb9; + dist(:,2)=okPk; + dist(:,3)=abs(aHm1(okPk)-aHm1(QCb9))+abs(PpGv(okPk)-PpGv(QCb9)); + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + W4qT = 0; + for cq5g = 1:ORnM + if dist(cq5g,3) > Ks71+1 + break end + XqJT = dist(cq5g,1); + nquD = dist(cq5g,2); + path = O9tx(B,[PpGv(XqJT); PpGv(nquD)], [aHm1(XqJT); aHm1(nquD)], -IBj0, Ks71, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + W4qT = 2; + edit = [1:(XqJT-1) (XqJT+1):(nquD-1) (nquD+1):GRaz]; + PpGv = [PpGv(XqJT); PpGv(nquD); PpGv(edit)]; + aHm1 = [aHm1(XqJT); aHm1(nquD); aHm1(edit)]; + break + else end - - %% - function [W B] = phase2(Borig,B,W,maxbridges,kappa,rz) - - function addbridgewirepath() - for w = 1:size(path,1); - if path(w,1) == path(w,3) % horizontal - BH(path(w,1),path(w,2)) = false; - BH(path(w,3),path(w,4)) = false; - if path(w,2) == path(w,4) - B(path(w,1),path(w,2)) = -9999; - end - end - if path(w,2) == path(w,4) % vertical - BV(path(w,1),path(w,2)) = false; - BV(path(w,3),path(w,4)) = false; - end end + if W4qT < 2 + continue end - - % fprintf('-- phase 2 --\n'); - - [BH BV] = buildbridges(Borig,B,W); - - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - p = pincount(i,1); - - Npinwires = sum(B == -p); - - if Npinwires == 0 - % fprintf('p = %d, no previous pinwires\n', p); - - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)*.5; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - maxstep = min((maxbridges*25)+kappa,2*p+1); - - % try to connect the closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,BH,BV,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, kappa, ceil(1.85*p)); - if size(path,1) > 0 - % fprintf('\nBRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - addbridgewirepath(); - - connected = true; - break - end - end - if ~connected - continue - end - end - end - - [row col] = find(B == p); - Npins = size(row,1); - - maxstep = min((maxbridges*25)+kappa,p+1); - - for j = 1:Npins - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (Npins-j+1); - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = j:Npins - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,BH,BV,[row2(a); row(b)], [col2(a); col(b)], -p, maxbridges, kappa, p); - if size(path,1) > 0 - % fprintf('\nEXTRA BRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row2(a), col2(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - addbridgewirepath(); - - connected = true; - - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - + for uYiE = 3:GRaz + [bn6R W3To] = find(B == -IBj0); + ZmwJ = size(bn6R,1); + ORnM = ZmwJ * (GRaz - W4qT); + DGXj = (1:ZmwJ*GRaz)'; + nquD=mod(DGXj-1,GRaz)+1; + XqJT=ceil(DGXj/GRaz); + WIU8 = (nquD>W4qT); + XqJT = XqJT(WIU8); + nquD = nquD(WIU8); + g3tC = abs(bn6R(XqJT)-PpGv(nquD)) + abs(W3To(XqJT)-aHm1(nquD)); + dist = [XqJT,nquD,g3tC]; + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + IDYF = false(GRaz,1); + iq60 = false; + for cq5g = 1:ORnM + if dist(cq5g,3) > Ks71+1 + break end - + nquD = dist(cq5g,2); + if IDYF(nquD) + randperm(4); + continue end - - %% - function [W B] = phase3(B,W,kappa,rz) - - - % fprintf('-- phase 3 --\n'); - - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - p = pincount(i,1); - - Npinwires = sum(B == -p); - - if Npinwires == 0 - % fprintf('p = %d, no previous pinwires\n', p); - - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)*.5; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - maxstep = min(kappa,2*p+1); - - % try to connect the closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = bridgepath(B,BH,BV,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, kappa, 2*p); - path = complexpath(B,[row(a); row(b)], [col(a); col(b)], -p, kappa, 2*p); - if size(path,1) > 0 - % fprintf('\nBRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - % [B BH BV] = addbridgewirepath(B,BH,BV,path,-p); - - connected = true; - break - end - end - if ~connected - continue - end - end - end - - [row col] = find(B == p); - Npins = size(row,1); - - maxstep = min(kappa,p+1); - - for j = 1:Npins - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (Npins-j+1); - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = j:Npins - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = bridgepath(B,BH,BV,[row2(a); row(b)], [col2(a); col(b)], -p, maxbridges, kappa, p); - path = complexpath(B,[row2(a); row(b)], [col2(a); col(b)], -p, kappa, 2*p); - if size(path,1) > 0 - % fprintf('\nEXTRA BRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row2(a), col2(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - % [B BH BV] = addbridgewirepath(B,BH,BV,path,-p); - - connected = true; - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - + XqJT = dist(cq5g,1); + path = O9tx(B,[bn6R(XqJT); PpGv(nquD)], [W3To(XqJT); aHm1(nquD)], -IBj0, Ks71, IBj0); + IDYF(nquD)=true; + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + W4qT = W4qT + 1; + iq60 = true; + PpGv([uYiE nquD]) = PpGv([nquD uYiE]); + aHm1([uYiE nquD]) = aHm1([nquD uYiE]); + break end - end - - %% - function [BH BV] = buildbridges(Borig,B,path) - [NR NC] = size(B); - BH = Borig == 0; - BV = BH; - BH(:,[1 NC]) = false; - BV([1 NR],:) = false; - for i = 1:size(path,1) - if path(i,1) == path(i,3) % horizontal - BH(path(i,1),path(i,2)) = false; - BH(path(i,3),path(i,4)) = false; - end - if path(i,2) == path(i,4) % vertical - BV(path(i,1),path(i,2)) = false; - BV(path(i,3),path(i,4)) = false; - end + if ~iq60 + break end end - - %% - function B = addwirepath(B,path,label) - B(path(1,1),path(1,2)) = label; - for i = 1:size(path,1); - B(path(i,3),path(i,4)) = label; end end - - %% - function path = traceback(z,PZ,NR,t) - path = zeros(t,4); - dr = mod(z,NR); - dc = ceil(z/NR); - for j = 1:t - path(j,1:2) = [dr dc]; - z = PZ(z); - dr = mod(z,NR); - dc = ceil(z/NR); - path(j,3:4) = [dr dc]; end + function [W B] = Tnn0(B,W,bY9b,McbD) + [Nh_K M_Ok] = FMI2(B,McbD); + if M_Ok < 1, return, end + Nh_K=sortrows(Nh_K,-McbD); + for G1xR = 1:M_Ok + IBj0 = Nh_K(G1xR,1); + ZmwJ = sum(B == -IBj0); + if ZmwJ == 0 + if Nh_K(G1xR,2) >= 2 + [PpGv aHm1] = find(B == IBj0); + GRaz = size(PpGv,1); + ORnM = GRaz*(GRaz-1)*.5; + DGXj = (1:GRaz*GRaz)'; + nquD=mod(DGXj-1,GRaz)+1; + XqJT=ceil(DGXj/GRaz); + WIU8 = (XqJT<nquD); + XqJT = XqJT(WIU8); + nquD = nquD(WIU8); + g3tC = abs(PpGv(XqJT)-PpGv(nquD)) + abs(aHm1(XqJT)-aHm1(nquD)); + dist = [XqJT,nquD,g3tC]; + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + maxstep = min(bY9b,2*IBj0+1); + iq60 = false; + for cq5g = 1:ORnM + if dist(cq5g,3) > maxstep+1 + break end - - - function path = complexpath(B,row,col,label,cutoff,maxpathlen) - - % - complexpath - - [NR NC] = size(B); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - C(row(2),col(2)) = 0; % source - - % tag the targets - C(row(1),col(1)) = -2; - C( B == label ) = -2; - - znext = zeros(NR*NC,1); - znext(1) = row(2) + (col(2)-1)*NR; + XqJT = dist(cq5g,1); + nquD = dist(cq5g,2); + path = O9tx(B,[PpGv(XqJT); PpGv(nquD)], [aHm1(XqJT); aHm1(nquD)], -IBj0, bY9b, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + iq60 = true; + break + end + end + if ~iq60 + continue + end + end + end + [PpGv aHm1] = find(B == IBj0); + G3F4 = size(PpGv,1); + maxstep = min(bY9b,IBj0+1); + for uYiE = 1:G3F4 + [bn6R W3To] = find(B == -IBj0); + ZmwJ = size(bn6R,1); + ORnM = ZmwJ * (G3F4-uYiE+1); + dist = zeros(ORnM,3); + cq5g = 0; + for XqJT = 1:ZmwJ + for nquD = uYiE:G3F4 + cq5g = cq5g + 1; + dist(cq5g,1) = XqJT; + dist(cq5g,2) = nquD; + dist(cq5g,3) = abs(bn6R(XqJT)-PpGv(nquD)) + abs(W3To(XqJT)-aHm1(nquD)); + end + end + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + IDYF = false(G3F4,1); + iq60 = false; + for cq5g = 1:ORnM + if dist(cq5g,3) > maxstep+1 + break + end + nquD = dist(cq5g,2); + if IDYF(nquD) + randperm(4); + continue + end + XqJT = dist(cq5g,1); + path = O9tx(B,[bn6R(XqJT); PpGv(nquD)], [W3To(XqJT); aHm1(nquD)], -IBj0, bY9b, 2*IBj0); + IDYF(nquD)=true; + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + iq60 = true; + PpGv([uYiE nquD]) = PpGv([nquD uYiE]); + aHm1([uYiE nquD]) = aHm1([nquD uYiE]); + break + end + end + if ~iq60 + break + end + end + end + end + function [C0EY qYQG] = c3TT(DUxB,B,path) + [Bc8q C5T_] = size(B); + C0EY = DUxB == 0; + qYQG = C0EY; + C0EY(:,[1 C5T_]) = false; + qYQG([1 Bc8q],:) = false; + for G1xR = 1:size(path,1) + if path(G1xR,1) == path(G1xR,3) + C0EY(path(G1xR,1),path(G1xR,2)) = false; + C0EY(path(G1xR,3),path(G1xR,4)) = false; + end + if path(G1xR,2) == path(G1xR,4) + qYQG(path(G1xR,1),path(G1xR,2)) = false; + qYQG(path(G1xR,3),path(G1xR,4)) = false; + end + end + end + function B = TiiY(B,path,iwBe) + B(path(1,1),path(1,2)) = iwBe; + for G1xR = 1:size(path,1); + B(path(G1xR,3),path(G1xR,4)) = iwBe; + end + end + function path = Svwd(jGMD,AZNG,Bc8q,jXFo) + path = zeros(jXFo,4); + hVOU = mod(jGMD,Bc8q); + SWq4 = ceil(jGMD/Bc8q); + for uYiE = 1:jXFo + path(uYiE,1:2) = [hVOU SWq4]; + jGMD = AZNG(jGMD); + hVOU = mod(jGMD,Bc8q); + SWq4 = ceil(jGMD/Bc8q); + path(uYiE,3:4) = [hVOU SWq4]; + end + end + function path = O9tx(B,PpGv,aHm1,iwBe,Ks71,xhiv) + [Bc8q C5T_] = size(B); + AZNG = zeros(Bc8q,C5T_); + BcVP = -ones(Bc8q,C5T_); + BcVP(PpGv(2),aHm1(2)) = 0; + BcVP(PpGv(1),aHm1(1)) = -2; + BcVP( B == iwBe ) = -2; + FQMc = zeros(Bc8q*C5T_,1); + FQMc(1) = PpGv(2) + (aHm1(2)-1)*Bc8q; count = 1; - dZ = [-1 1 -NR NR]; - - [ign, ir] = sort(rand(1,4)); - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - z = znext; - count = 0; - for i = 1:N - zi = z(i); - for s=1:4 - Z = zi + dZ(ir(s)); - tag = C(Z); - if tag == -2 - PZ(Z) = zi; - path = traceback(Z,PZ,NR,step+1); - return - end - if tag == -1 && B(Z) == 0 - C(Z) = step+1; - PZ(Z) = zi; - count = count + 1; - znext(count) = Z; - end - end - end + nD77 = [-1 1 -Bc8q Bc8q]; + S_Rr = randperm(4); + for step = 0:min(Ks71,xhiv) + if count < 1, break, end + GRaz = count; + jGMD = FQMc; + count = 0; + for G1xR = 1:GRaz + Blu2 = jGMD(G1xR); + for BC3q=1:4 + vuBz = Blu2 + nD77(S_Rr(BC3q)); + cHwV = BcVP(vuBz); + if cHwV == -2 + AZNG(vuBz) = Blu2; + path = Svwd(vuBz,AZNG,Bc8q,step+1); + return end + if cHwV == -1 && B(vuBz) == 0 + BcVP(vuBz) = step+1; + AZNG(vuBz) = Blu2; + count = count + 1; + FQMc(count) = vuBz; + end + end + end + end path = []; end - - %% - function path = bridgepath(B,BH,BV,row,col,label,maxbridges,kappa,maxpathlen) - - % - bridgepath - - % fprintf('bridgepath ...\n'); - [NR NC] = size(B); - BRIDGE = false(NR,NC); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - % C(row(2),col(2)) = 0; % source - - % tag targets - C(row(1),col(1)) = -2; - C( B == label ) = -2; - - maxstep = min((maxbridges*27)+kappa,maxpathlen+1); - nextstep = zeros(maxstep+28,1); - nextstep(1) = row(2) + (col(2)-1)*NR; - dZ = [-NR NR -1 1]; - + function path = LlL4(B,C0EY,qYQG,PpGv,aHm1,iwBe,bbQx,bY9b,xhiv) + [Bc8q C5T_] = size(B); + Nbqj = false(Bc8q,C5T_); + AZNG = zeros(Bc8q,C5T_); + BcVP = -ones(Bc8q,C5T_); + BcVP(PpGv(1),aHm1(1)) = -2; + BcVP( B == iwBe ) = -2; + maxstep = min((bbQx*27)+bY9b,xhiv+1); + jNs1 = zeros(maxstep+28,1); + jNs1(1) = PpGv(2) + (aHm1(2)-1)*Bc8q; + nD77 = [-Bc8q Bc8q -1 1]; for step = 1:maxstep - while nextstep(step)>0 - zi = nextstep(step); - nextstep(step)=C(zi); - for s = 1:4 - Z = zi + dZ(s); - tag = C(Z); - if tag==-1 - if B(Z) == 0 - C(Z) = nextstep(step+1); - nextstep(step+1) = Z; - PZ(Z) = zi; - elseif (BH(Z)&&(s<3)) || (BV(Z)&&(s>2)) - C(Z) = nextstep(step+26); - nextstep(step+26) = Z; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - if tag==-2 - step=step+1; - PZ(Z) = zi; - dr=mod(Z,NR); - dc=ceil(Z/NR); - path = zeros(step,4); - j = 0; - while dr ~= row(2) || dc ~= col(2) - j = j + 1; - path(j,1:2) = [dr dc]; - Z = dr + (dc-1)*NR; - pz = PZ(Z); - pr=mod(pz,NR); - pc=ceil(pz/NR); - path(j,3:4) = [pr pc]; - dr = pr; - dc = pc; - if BRIDGE(dr,dc) - j = j + 1; - path(j,:) = [dr dc dr dc]; - end - end - path = path(1:j,:); - return - end - - end - end + while jNs1(step)>0 + Blu2 = jNs1(step); + jNs1(step)=BcVP(Blu2); + for BC3q = 1:4 + vuBz = Blu2 + nD77(BC3q); + cHwV = BcVP(vuBz); + if cHwV==-1 + if B(vuBz) == 0 + BcVP(vuBz) = jNs1(step+1); + jNs1(step+1) = vuBz; + AZNG(vuBz) = Blu2; + elseif (C0EY(vuBz)&&(BC3q<3)) || (qYQG(vuBz)&&(BC3q>2)) + BcVP(vuBz) = jNs1(step+26); + jNs1(step+26) = vuBz; + AZNG(vuBz) = Blu2; + Nbqj(vuBz) = true; end + end + if cHwV==-2 + step=step+1; + AZNG(vuBz) = Blu2; + hVOU=mod(vuBz,Bc8q); + SWq4=ceil(vuBz/Bc8q); + path = zeros(step,4); + uYiE = 0; + while hVOU ~= PpGv(2) || SWq4 ~= aHm1(2) + uYiE = uYiE + 1; + path(uYiE,1:2) = [hVOU SWq4]; + vuBz = hVOU + (SWq4-1)*Bc8q; + FlDz = AZNG(vuBz); + Lrwx=mod(FlDz,Bc8q); + gNRJ=ceil(FlDz/Bc8q); + path(uYiE,3:4) = [Lrwx gNRJ]; + hVOU = Lrwx; + SWq4 = gNRJ; + if Nbqj(hVOU,SWq4) + uYiE = uYiE + 1; + path(uYiE,:) = [hVOU SWq4 hVOU SWq4]; + end + end + path = path(1:uYiE,:); + return + end + end + end + end path = []; end - - - function W = solverF(B) - [W,S] = function1(B); - IN55LEuuYN = 0; - d2F7TC2nTS = round(mod(B(:),2)); - if S < 2100 - return + function W = EdPD(B) + [W,kDT3] = nBH8(B); + AZkC = 0; + N9HN = round(mod(B(:),2)); + if kDT3 < 2100 + return end - [kJfcOitU9b,ZqDtJmqMeb] = size(B); + [GhJs,Jvtd] = size(B); B = flipud(fliplr(B')); - [zElIwYjTOJ,FZzcxpyenz] = function1(B); - if S > FZzcxpyenz - W = [kJfcOitU9b-zElIwYjTOJ(:,2)+1 ZqDtJmqMeb-zElIwYjTOJ(:,1)+1 kJfcOitU9b-zElIwYjTOJ(:,4)+1 ZqDtJmqMeb-zElIwYjTOJ(:,3)+1]; + [K0zU,wDsZ] = nBH8(B); + if kDT3 > wDsZ + W = [GhJs-K0zU(:,2)+1 Jvtd-K0zU(:,1)+1 GhJs-K0zU(:,4)+1 Jvtd-K0zU(:,3)+1]; end - if d2F7TC2nTS~=IN55LEuuYN; W = zeros(0,4); end + if N9HN~=AZkC; W = zeros(0,4); end end - - function [W,S] = function1(B) - [nR,nC]=size(B); - Bpad=nan(nR+2,nC+2); - Bpad(2:end-1,2:end-1)=B; - Bedit = Bpad; - maxbridges = 4; - if size(Bedit,2) > 20 - cutfirst = 4; - cutsecond = 8; - cutoff = 12; + function [W,kDT3] = nBH8(B) + [zFQ6,WYCZ]=size(B); + WQFH=nan(zFQ6+2,WYCZ+2); + WQFH(2:end-1,2:end-1)=B; + LOEe = WQFH; + bbQx = 4; + if size(LOEe,2) > 20 + QTLP = 4; + Qxak = 8; + Ks71 = 12; else - cutfirst = 3; - cutsecond = 7; - cutoff = 11; + QTLP = 3; + Qxak = 7; + Ks71 = 11; end - S = inf; - X1 = [1 2;2 1]; - X2 = [1 3;3 1]; - Y = [3 2 1;1 2 3]; - for x = 1:2 - if x == 2 - [U BU] = phase1_a(Bedit,cutfirst,X1(x,:)); - [UU BUU] = phase3a(BU,U,cutsecond,X2(x,:)); - [V BX] = phase3a(BUU,UU,cutoff,X2(x,:)); - else - [U BU] = phase1_a(Bedit,4,X1(x,:)); - [V BX] = phase3a(BU,U,11,X2(x,:)); - end - for y = 1:2 - if x == 2 && y == 2 && S > 2100, return, end - W1 = phase2_a(Bedit,BX,V,maxbridges,cutoff,Y(y,:))-1; - S1 = mygrade(B,W1); - if S1 <= S - S = S1; - W = W1; - maxbridges = maxbridges - 1; - end - end + kDT3 = inf; + fbMU = [1 2;2 1]; + CNS4 = [1 3;3 1]; + QDCZ = [3 2 1;1 2 3]; + for cq5g = 1:2 + if cq5g == 2 + [uPVz hHv8] = Rlek(LOEe,QTLP,fbMU(cq5g,:)); + [yAUb T15I] = IGwc(hHv8,uPVz,Qxak,CNS4(cq5g,:)); + [VGSy Tw_F] = IGwc(T15I,yAUb,Ks71,CNS4(cq5g,:)); + else + [uPVz hHv8] = Rlek(LOEe,4,fbMU(cq5g,:)); + [VGSy Tw_F] = IGwc(hHv8,uPVz,11,CNS4(cq5g,:)); end - if nR*nC > 290; return; end - br = sum(W(:,1)==W(:,3)&W(:,2)==W(:,4)); - if br <= 4 - WSH = solverSHa(B); - ssh = mygrade(B,WSH); - if ssh < S - W = WSH; - S = ssh; - end + for RCWw = 1:2 + if cq5g == 2 && RCWw == 2 && kDT3 > 2100, return, end + V8ZD = cxLA(LOEe,Tw_F,VGSy,bbQx,Ks71,QDCZ(RCWw,:))-1; + oN11 = lPE1(B,V8ZD); + if oN11 <= kDT3 + kDT3 = oN11; + W = V8ZD; + bbQx = bbQx - 1; end end - - - function path = complexpath_a(B,row,col,label,cutoff,maxpathlen) - function path = traceback_a(r,c,pathLength) - pR(r,c) = zR(i); - pC(r,c) = zC(i); - path = zeros(pathLength,4); - for jjj = 1:pathLength - path(jjj,1:2) = [r c]; - preR = pR(r,c); - preC = pC(r,c); - path(jjj,3:4) = [preR preC]; - r = preR; - c = preC; end + if zFQ6*WYCZ > 290; return; end + XnVi = sum(W(:,1)==W(:,3)&W(:,2)==W(:,4)); + if XnVi <= 4 + RTgB = JT3p(B); + B0vb = lPE1(B,RTgB); + if B0vb < kDT3 + W = RTgB; + kDT3 = B0vb; end - [NR NC] = size(B); - pR = zeros(NR,NC); - pC = zeros(NR,NC); - C = -ones(NR,NC); - C(row(2),col(2)) = 0; - C(row(1),col(1)) = -2; - C( B == label ) = -2; - rnext = zeros(NR*NC,1); - cnext = zeros(NR*NC,1); + end + end + function path = pO_1(B,PpGv,aHm1,iwBe,Ks71,xhiv) + function path = TwV6(PeSE,Ulrf,c7oz) + WQYV(PeSE,Ulrf) = iMEc(G1xR); + L_vg(PeSE,Ulrf) = umDu(G1xR); + path = zeros(c7oz,4); + for LazW = 1:c7oz + path(LazW,1:2) = [PeSE Ulrf]; + KHKc = WQYV(PeSE,Ulrf); + VTU6 = L_vg(PeSE,Ulrf); + path(LazW,3:4) = [KHKc VTU6]; + PeSE = KHKc; + Ulrf = VTU6; + end + end + [Bc8q C5T_] = size(B); + WQYV = zeros(Bc8q,C5T_); + L_vg = zeros(Bc8q,C5T_); + BcVP = -ones(Bc8q,C5T_); + BcVP(PpGv(2),aHm1(2)) = 0; + BcVP(PpGv(1),aHm1(1)) = -2; + BcVP( B == iwBe ) = -2; + Di2c = zeros(Bc8q*C5T_,1); + dhIz = zeros(Bc8q*C5T_,1); count = 1; - rnext(1) = row(2); - cnext(1) = col(2); - dR=[-1 1 0 0]; - dC=[0 0 -1 1]; - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - zR = rnext; - zC = cnext; - count = 0; - for i = 1:N - Aa2p_xqlDq = zC(i); - zi = zR(i); - for s=1:4 - r = zi + dR(s); - c = Aa2p_xqlDq + dC(s); - Z = r + (c-1)*NR; - tag = C(Z); - if tag == -2 - path = traceback_a(r,c,step+1); - return - elseif tag == -1 && B(Z) == 0 - C(Z) = step+1; - pR(Z) = zi; - pC(Z) = Aa2p_xqlDq; - count = count + 1; rnext(count) = r; cnext(count) = c; - end - end - end + Di2c(1) = PpGv(2); + dhIz(1) = aHm1(2); + EoPt=[-1 1 0 0]; + dSpY=[0 0 -1 1]; + for step = 0:min(Ks71,xhiv) + if count < 1, break, end + GRaz = count; + iMEc = Di2c(1:GRaz); + umDu = dhIz(1:GRaz); + count = 0; + for G1xR = 1:GRaz + ZLok = umDu(G1xR); + Blu2 = iMEc(G1xR); + for BC3q=1:4 + PeSE = Blu2 + EoPt(BC3q); + Ulrf = ZLok + dSpY(BC3q); + vuBz = PeSE + (Ulrf-1)*Bc8q; + cHwV = BcVP(vuBz); + if cHwV == -2 + path = TwV6(PeSE,Ulrf,step+1); + return + elseif cHwV == -1 && B(vuBz) == 0 + BcVP(vuBz) = step+1; + WQYV(vuBz) = Blu2; + L_vg(vuBz) = ZLok; + count = count + 1; Di2c(count) = PeSE; dhIz(count) = Ulrf; end + end + end + end path = []; end - - - - - function w = solverSHa(b) - p = unique(b); - p(1) = []; - n = zeros(size(p)); - for i = 1:length(n) - n(i) = nnz(p(i) == b(:)); + function YJ_W = JT3p(nquD) + IBj0 = unique(nquD); + IBj0(1) = []; + T80x = zeros(size(IBj0)); + for G1xR = 1:length(T80x) + T80x(G1xR) = nnz(IBj0(G1xR) == nquD(:)); end - for i = 1:length(n) - if n(i) == 1 - b(p(i) == b(:)) = -1; - end + for G1xR = 1:length(T80x) + if T80x(G1xR) == 1 + nquD(IBj0(G1xR) == nquD(:)) = -1; end - g = zeros(size(b)+2); - bb = repmat(-1,size(g)); - bb(2:end-1,2:end-1) = b; - w = []; - [rr, cc] = find(bb>0); - d = (size(bb,1)/2 - rr).^2 + (size(bb,2)/2 - cc).^2; - [d, order] = sort(d); + end + nYic = zeros(size(nquD)+2); + jHwu = repmat(-1,size(nYic)); + jHwu(2:end-1,2:end-1) = nquD; + YJ_W = []; + [sf1p, YTiw] = find(jHwu>0); + g3tC = (size(jHwu,1)/2 - sf1p).^2 + (size(jHwu,2)/2 - YTiw).^2; + [g3tC, order] = sort(g3tC); order = order'; - for k = 1:length(rr)-1 - bestscore = 0; - minsteps = 32; - for i = order - if g(rr(i), cc(i)) - continue - end - [score, mv, steps] = findBestMove_a(bb, g, rr(i), cc(i), minsteps); - if score > bestscore - bestscore = score; - bestmove = mv; - minsteps = steps; - if minsteps == 1 - break - end - end - end - if bestscore == 0 - w = w - 1; - return - end - g = addwirepath(g, bestmove, bb(bestmove(1,1), bestmove(1,2))); - bb = addwirepath(bb, bestmove, bb(bestmove(1,1), bestmove(1,2))); - w = [w; bestmove]; + for M_Ok = 1:length(sf1p)-1 + m9vf = 0; + T2Lw = 32; + for G1xR = order + if nYic(sf1p(G1xR), YTiw(G1xR)) + continue end - w = w - 1; + [a_hU, LWzD, uIbD] = uMOs(jHwu, nYic, sf1p(G1xR), YTiw(G1xR), T2Lw); + if a_hU > m9vf + m9vf = a_hU; + Uzic = LWzD; + T2Lw = uIbD; + if T2Lw == 1 + break end - - - function [bestscore, bestmove, minsteps] = findBestMove_a(b, g, z, zC, tniOHnFTWS) - bestscore = 0; - bestmove = []; - jjj = [1 -1 0 0]; - k = [0 0 1 -1]; - if ~any(g(:)==b(z,zC)) - g = b; end - bb = b; - bb(bb>0) = -1; - bb(z,zC) = 1; - minsteps = Inf; - p = b(z,zC); - for i = 1:tniOHnFTWS-2 - [rr, cc] = find(bb==i); - for n = 1:length(rr) - for GEOY9vqvEy = 1:4 - Cw4BfzRNQ6 = rr(n) + jjj(GEOY9vqvEy); - qpF1lfOV53 = cc(n) + k(GEOY9vqvEy); - if g(Cw4BfzRNQ6,qpF1lfOV53) == p && ~(Cw4BfzRNQ6 == z && qpF1lfOV53 == zC) - minsteps = i; - break - end - wzyazJbPVF = bb(Cw4BfzRNQ6,qpF1lfOV53); - if wzyazJbPVF == 0 - bb(Cw4BfzRNQ6,qpF1lfOV53) = i+1; - end - end - if minsteps < Inf - break - end - end - if minsteps < Inf - break - end end - if minsteps == Inf - return + if m9vf == 0 + YJ_W = YJ_W - 1; + return end - bestscore = b(z,zC) - minsteps; - if minsteps == 1 - bestmove = [z, zC, Cw4BfzRNQ6, qpF1lfOV53]; - return + nYic = TiiY(nYic, Uzic, jHwu(Uzic(1,1), Uzic(1,2))); + jHwu = TiiY(jHwu, Uzic, jHwu(Uzic(1,1), Uzic(1,2))); + YJ_W = [YJ_W; Uzic]; end - bestmove = zeros(minsteps,4); - for step = minsteps:-1:1 - for GEOY9vqvEy = 1:4 - RugyNPRQTT = Cw4BfzRNQ6 + jjj(GEOY9vqvEy); - Wlfr8gQkkJ = qpF1lfOV53 + k(GEOY9vqvEy); - if bb(RugyNPRQTT, Wlfr8gQkkJ) == step - break - end - end - bestmove(step,:) = [RugyNPRQTT, Wlfr8gQkkJ, Cw4BfzRNQ6, qpF1lfOV53]; - Cw4BfzRNQ6 = RugyNPRQTT; - qpF1lfOV53 = Wlfr8gQkkJ; + YJ_W = YJ_W - 1; end + function [m9vf, Uzic, T2Lw] = uMOs(nquD, nYic, jGMD, umDu, vMSV) + m9vf = 0; + Uzic = []; + LazW = [1 -1 0 0]; + M_Ok = [0 0 1 -1]; + if ~any(nYic(:)==nquD(jGMD,umDu)) + nYic = nquD; end - - - function [W B] = phase1_a(B,cutoff,rz) + jHwu = nquD; + jHwu(jHwu>0) = -1; + jHwu(jGMD,umDu) = 1; + T2Lw = Inf; + IBj0 = nquD(jGMD,umDu); + for G1xR = 1:vMSV-2 + [sf1p, YTiw] = find(jHwu==G1xR); + for T80x = 1:length(sf1p) + for M8zm = 1:4 + tBrt = sf1p(T80x) + LazW(M8zm); + NoZC = YTiw(T80x) + M_Ok(M8zm); + if nYic(tBrt,NoZC) == IBj0 && ~(tBrt == jGMD && NoZC == umDu) + T2Lw = G1xR; + break + end + v7DM = jHwu(tBrt,NoZC); + if v7DM == 0 + jHwu(tBrt,NoZC) = G1xR+1; + end + end + if T2Lw < Inf + break + end + end + if T2Lw < Inf + break + end + end + if T2Lw == Inf + return + end + m9vf = nquD(jGMD,umDu) - T2Lw; + if T2Lw == 1 + Uzic = [jGMD, umDu, tBrt, NoZC]; + return + end + Uzic = zeros(T2Lw,4); + for step = T2Lw:-1:1 + for M8zm = 1:4 + Ec9p = tBrt + LazW(M8zm); + wkwq = NoZC + M_Ok(M8zm); + if jHwu(Ec9p, wkwq) == step + break + end + end + Uzic(step,:) = [Ec9p, wkwq, tBrt, NoZC]; + tBrt = Ec9p; + NoZC = wkwq; + end + end + function [W B] = Rlek(B,Ks71,McbD) W = []; - [pincount k] = analyzeboard(B,rz); - if k < 1 - return + [Nh_K M_Ok] = FMI2(B,McbD); + if M_Ok < 1 + return end - pincount=sortrows(pincount,-rz); - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - qfUlAeE6ke = reshape(dist(:,1:2)',[],1); - npins = 0; - qYyU89IINf = 1; - OEmC4q5N3Q = false(N,1); - for i=1:N - lNue6SeFoq = find( ~OEmC4q5N3Q(qfUlAeE6ke(qYyU89IINf:end)) , 1 , 'first'); - if isempty(lNue6SeFoq) - break - end - a = qfUlAeE6ke(lNue6SeFoq); - Distance = abs(row([1:a-1,a+1:end]')-row(a)) + abs(col([1:a-1,a+1:end]')-col(a)); - if max(Distance)>cutoff-1 - break - end - path = DqbHRtn5ft(B,row(a),col(a),row([1:a-1,a+1:end]'),col([1:a-1,a+1:end]'), -p, cutoff, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - npins = 2; - break - end - end - if npins < 2 - continue - end - for jjj = 3:N - [row2 col2] = find(B == -p); - [row col] = find(B == p); - [AM3xhXGopY,pXUGUzzwiB] = meshgrid(row,row2); - [sb9p2RYeiU,Je3dFDJNL9] = meshgrid(row,row2); - Distance = abs(AM3xhXGopY-pXUGUzzwiB) + abs(sb9p2RYeiU-Je3dFDJNL9); - if max(Distance(:))>cutoff-1 - break - end - path = DqbHRtn5ft(B,row2,col2,row,col, -p, cutoff, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - else - break - end - end - end + Nh_K=sortrows(Nh_K,-McbD); + for G1xR = 1:M_Ok + if Nh_K(G1xR,2) >= 2 + IBj0 = Nh_K(G1xR,1); + [PpGv aHm1] = find(B == IBj0); + GRaz = size(PpGv,1); + ORnM = GRaz*(GRaz-1)/2; + dist = zeros(ORnM,3); + cq5g = 0; + for XqJT = 1:GRaz + for nquD = (XqJT+1):GRaz + cq5g = cq5g + 1; + dist(cq5g,1) = XqJT; + dist(cq5g,2) = nquD; + dist(cq5g,3) = abs(PpGv(XqJT)-PpGv(nquD)) + abs(aHm1(XqJT)-aHm1(nquD)); end end - - - function [W B] = phase3a(B,W,XDfVAc3Mmp,rz) - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - pincount=sortrows(pincount,-rz); - for i = 1:k - p = pincount(i,1); - Npinwires = sum(B == -p); - if Npinwires == 0 - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - maxstep = min(XDfVAc3Mmp,2*p+1); - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - break - end - a = dist(x,1); - b = dist(x,2); - path = complexpath_a(B,[row(a); row(b)], [col(a); col(b)], -p, XDfVAc3Mmp, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - break - end - end - if ~connected - continue - end - end - end - [row col] = find(B == p); - wibFptvq9Y = size(row,1); - maxstep = min(XDfVAc3Mmp,p+1); - for jjj = 1:wibFptvq9Y - [row2 col2] = find(B == -p); - [row col] = find(B == p); - connected = false; - path = DqbHRtn5ft(B,row2,col2,row,col, -p, XDfVAc3Mmp, p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - end - if ~connected - break - end - end + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + kwnO = reshape(dist(:,1:2)',[],1); + W4qT = 0; + LII9 = 1; + DaY5 = false(GRaz,1); + for G1xR=1:GRaz + jh2z = find( ~DaY5(kwnO(LII9:end)) , 1 , 'first'); + if isempty(jh2z) + break end + XqJT = kwnO(jh2z); + Distance = abs(PpGv([1:XqJT-1,XqJT+1:end]')-PpGv(XqJT)) + abs(aHm1([1:XqJT-1,XqJT+1:end]')-aHm1(XqJT)); + if max(Distance)>Ks71-1 + break end - - - function [W B] = phase2_a(Bpad,B,W,maxbridges,XDfVAc3Mmp,rz) - function hr2OdLy5K5() - for w = 1:size(path,1); - if path(w,1) == path(w,3) - YTx56DA5U8(path(w,1),path(w,2)) = false; - YTx56DA5U8(path(w,3),path(w,4)) = false; - if path(w,2) == path(w,4) - B(path(w,1),path(w,2)) = -9999; - end - end - if path(w,2) == path(w,4) - P9_FTG1hds(path(w,1),path(w,2)) = false; - P9_FTG1hds(path(w,3),path(w,4)) = false; - end + path = F0uZ(B,PpGv(XqJT),aHm1(XqJT),PpGv([1:XqJT-1,XqJT+1:end]'),aHm1([1:XqJT-1,XqJT+1:end]'), -IBj0, Ks71, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + W4qT = 2; + break end end - [YTx56DA5U8 P9_FTG1hds] = buildbridges(Bpad,B,W); - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - pincount=sortrows(pincount,-rz); - for i = 1:k - p = pincount(i,1); - Npinwires = sum(B == -p); - if Npinwires == 0 - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - maxstep = min((maxbridges*25)+XDfVAc3Mmp,2*p+1); - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,YTx56DA5U8,P9_FTG1hds,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, XDfVAc3Mmp, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - hr2OdLy5K5(); - connected = true; - break - end - end - if ~connected - continue - end - end - end - row = find(B == p); - wibFptvq9Y = size(row,1); - % maxstep = min((maxbridges*25)+XDfVAc3Mmp,p+1); - for jjj = 1:wibFptvq9Y - z2 = find(B == -p); - z = find(B == p); - connected = false; - path = d4TZerDbiG(B,YTx56DA5U8,P9_FTG1hds,z2,z, maxbridges, XDfVAc3Mmp, p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - hr2OdLy5K5(); - connected = true; - end - if ~connected - break - end - end + if W4qT < 2 + continue end + for LazW = 3:GRaz + [bn6R W3To] = find(B == -IBj0); + [PpGv aHm1] = find(B == IBj0); + [SWtQ,GPpb] = meshgrid(PpGv,bn6R); + [yAfI,y26l] = meshgrid(PpGv,bn6R); + Distance = abs(SWtQ-GPpb) + abs(yAfI-y26l); + if max(Distance(:))>Ks71-1 + break end - - %% - function path = d4TZerDbiG(B,BH,BV,zS,zT,maxbridges,kappa,maxpathlen) - function path = traceback_b(Z,step) - PZ(Z) = zi; - r=mod(Z,NR); - c=ceil(Z/NR); - path = zeros(step,4); - jjj = 0; - - while ~any(zS==Z) - jjj = jjj + 1; - path(jjj,1:2) = [r c]; - Z = PZ(Z); - r=mod(Z,NR); - c=ceil(Z/NR); - path(jjj,3:4) = [r c]; - if BRIDGE(r,c) - jjj = jjj + 1; - path(jjj,:) = [r c r c]; - end - end - path = path(1:jjj,:); - end - [NR NC] = size(B); - BRIDGE = false(NR,NC); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - C(zS) = 0; - C(zT) = -2; - maxstep = min((maxbridges*25)+kappa,maxpathlen+1); - nextstep = zeros(maxstep+26,1); + path = F0uZ(B,bn6R,W3To,PpGv,aHm1, -IBj0, Ks71, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + iq60 = true; + else + break + end + end + end + end + end + function [W B] = IGwc(B,W,ov0g,McbD) + [Nh_K M_Ok] = FMI2(B,McbD); + if M_Ok < 1, return, end + Nh_K=sortrows(Nh_K,-McbD); + for G1xR = 1:M_Ok + IBj0 = Nh_K(G1xR,1); + ZmwJ = sum(B == -IBj0); + if ZmwJ == 0 + if Nh_K(G1xR,2) >= 2 + [PpGv aHm1] = find(B == IBj0); + GRaz = size(PpGv,1); + ORnM = GRaz*(GRaz-1)/2; + dist = zeros(ORnM,3); + cq5g = 0; + for XqJT = 1:GRaz + for nquD = (XqJT+1):GRaz + cq5g = cq5g + 1; + dist(cq5g,1) = XqJT; + dist(cq5g,2) = nquD; + dist(cq5g,3) = abs(PpGv(XqJT)-PpGv(nquD)) + abs(aHm1(XqJT)-aHm1(nquD)); + end + end + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + maxstep = min(ov0g,2*IBj0+1); + iq60 = false; + for cq5g = 1:ORnM + if dist(cq5g,3) > maxstep+1 + break + end + XqJT = dist(cq5g,1); + nquD = dist(cq5g,2); + path = pO_1(B,[PpGv(XqJT); PpGv(nquD)], [aHm1(XqJT); aHm1(nquD)], -IBj0, ov0g, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + iq60 = true; + break + end + end + if ~iq60 + continue + end + end + end + [PpGv aHm1] = find(B == IBj0); + LLdQ = size(PpGv,1); + maxstep = min(ov0g,IBj0+1); + for LazW = 1:LLdQ + [bn6R W3To] = find(B == -IBj0); + [PpGv aHm1] = find(B == IBj0); + iq60 = false; + path = F0uZ(B,bn6R,W3To,PpGv,aHm1, -IBj0, ov0g, IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + iq60 = true; + end + if ~iq60 + break + end + end + end + end + function [W B] = cxLA(WQFH,B,W,bbQx,ov0g,McbD) + function YEGI() + for YJ_W = 1:size(path,1); + if path(YJ_W,1) == path(YJ_W,3) + Fog9(path(YJ_W,1),path(YJ_W,2)) = false; + Fog9(path(YJ_W,3),path(YJ_W,4)) = false; + if path(YJ_W,2) == path(YJ_W,4) + B(path(YJ_W,1),path(YJ_W,2)) = -9999; + end + end + if path(YJ_W,2) == path(YJ_W,4) + om_Q(path(YJ_W,1),path(YJ_W,2)) = false; + om_Q(path(YJ_W,3),path(YJ_W,4)) = false; + end + end + end + [Fog9 om_Q] = c3TT(WQFH,B,W); + [Nh_K M_Ok] = FMI2(B,McbD); + if M_Ok < 1, return, end + Nh_K=sortrows(Nh_K,-McbD); + for G1xR = 1:M_Ok + IBj0 = Nh_K(G1xR,1); + ZmwJ = sum(B == -IBj0); + if ZmwJ == 0 + if Nh_K(G1xR,2) >= 2 + [PpGv aHm1] = find(B == IBj0); + GRaz = size(PpGv,1); + ORnM = GRaz*(GRaz-1)/2; + dist = zeros(ORnM,3); + cq5g = 0; + for XqJT = 1:GRaz + for nquD = (XqJT+1):GRaz + cq5g = cq5g + 1; + dist(cq5g,1) = XqJT; + dist(cq5g,2) = nquD; + dist(cq5g,3) = abs(PpGv(XqJT)-PpGv(nquD)) + abs(aHm1(XqJT)-aHm1(nquD)); + end + end + [g3tC fUZ9] = sort(dist(:,3)); + dist = dist(fUZ9,:); + maxstep = min((bbQx*25)+ov0g,2*IBj0+1); + iq60 = false; + for cq5g = 1:ORnM + if dist(cq5g,3) > maxstep+1 + break + end + XqJT = dist(cq5g,1); + nquD = dist(cq5g,2); + path = LlL4(B,Fog9,om_Q,[PpGv(XqJT); PpGv(nquD)], [aHm1(XqJT); aHm1(nquD)], -IBj0, bbQx, ov0g, 2*IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + YEGI(); + iq60 = true; + break + end + end + if ~iq60 + continue + end + end + end + [PpGv aHm1] = find(B == IBj0); + LLdQ = size(PpGv,1); + maxstep = min((bbQx*25)+ov0g,IBj0+1); + for LazW = 1:LLdQ + [bn6R W3To] = find(B == -IBj0); + [PpGv aHm1] = find(B == IBj0); + iq60 = false; + path = C4IC(B,Fog9,om_Q,bn6R,W3To,PpGv,aHm1, -IBj0, bbQx, ov0g, IBj0); + if size(path,1) > 0 + W = [W; path]; + B = TiiY(B,path,-IBj0); + YEGI(); + iq60 = true; + end + if ~iq60 + break + end + end + end + end + function path = C4IC(B,C0EY,qYQG,rowS,colS,yQBW,Hief,iwBe,bbQx,bY9b,xhiv) + function path = Svwd(vuBz,step) + AZNG(vuBz) = Blu2; + path = zeros(step,4); + uYiE = 0; + Rnka = 0; + eJV4 = zeros(step,1); + cw2f = zeros(step,1); + pKGl = zeros(step,1); + while isempty(find(H3Sc==vuBz,1)) + uYiE = uYiE + 1; + eJV4(uYiE,1) = vuBz; + FlDz = AZNG(vuBz); + cw2f(uYiE,1) = FlDz; + vuBz = FlDz; + if Nbqj(vuBz) + Rnka = Rnka + 1; + pKGl(Rnka,1) = vuBz; + end + end + eJV4 = [ eJV4(1:uYiE,:) ; pKGl(1:Rnka,1) ]; + cw2f = [ cw2f(1:uYiE,:) ; pKGl(1:Rnka,1) ]; + path = [ mod(eJV4,Bc8q) , ceil(eJV4/Bc8q) , mod(cw2f,Bc8q) , ceil(cw2f/Bc8q) ]; + end + [Bc8q C5T_] = size(B); + Nbqj = false(Bc8q,C5T_); + AZNG = zeros(Bc8q,C5T_); + BcVP = -ones(Bc8q,C5T_); + H3Sc = rowS + (colS-1)*Bc8q; + BcVP(H3Sc) = 0; + BcVP(yQBW + (Hief-1)*Bc8q) = -2; + maxstep = min((bbQx*25)+bY9b,xhiv+1); + Wwc7 = zeros(maxstep+26,1); + Jmmr = [-1 1]; for step = 0:maxstep - if step == 0 - z = zS; - elseif nextstep(step) == 0 - continue - else - z = find(C == step); - end - N = numel(z); - for i = 1:N - zi = z(i); - Z = zi - NR; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BH(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi + NR; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BH(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi - 1; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BV(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi + 1; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BV(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - end + if step == 0 + jGMD = H3Sc; + elseif Wwc7(step) == 0 + continue + else + jGMD = find(BcVP == step); end + GRaz = numel(jGMD); + for G1xR = 1:GRaz + Blu2 = jGMD(G1xR); + for ME15 = 1:2 + vuBz = Blu2 + Jmmr(ME15) * Bc8q; + cHwV = BcVP(vuBz); + if cHwV == -2 + path = Svwd(vuBz,step+1); + return + elseif cHwV == -1 + if B(vuBz) == 0 + BcVP(vuBz) = step+1; Wwc7(step+1) = 1; + AZNG(vuBz) = Blu2; + elseif C0EY(vuBz) + BcVP(vuBz) = step+26; Wwc7(step+26) = 1; + AZNG(vuBz) = Blu2; + Nbqj(vuBz) = true; + end + end + end + for ME15 = 1:2 + vuBz = Blu2 + Jmmr(ME15); + cHwV = BcVP(vuBz); + if cHwV == -2 + path = Svwd(vuBz,step+1); + return + elseif cHwV == -1 + if B(vuBz) == 0 + BcVP(vuBz) = step+1; Wwc7(step+1) = 1; + AZNG(vuBz) = Blu2; + elseif qYQG(vuBz) + BcVP(vuBz) = step+26; Wwc7(step+26) = 1; + AZNG(vuBz) = Blu2; + Nbqj(vuBz) = true; + end + end + end + end + end path = zeros(0,4); end - - function path = DqbHRtn5ft(B,rowS,colS,FIg5RLlRYM,bX69T9QEhw,label,cutoff,maxpathlen) - % function path = traceback_a(r,c,pathLength) - % pR(r,c) = zR(i); - % pC(r,c) = zC(i); - % path = zeros(pathLength,4); - % for jjj = 1:pathLength - % path(jjj,1:2) = [r c]; - % preR = pR(r,c); - % preC = pC(r,c); - % path(jjj,3:4) = [preR preC]; - % r = preR; - % c = preC; - % end - % end - [NR NC] = size(B); - pR = zeros(NR,NC); - pC = zeros(NR,NC); - C = -ones(NR,NC); - C(rowS+(colS-1)*NR) = 0; - C(FIg5RLlRYM+(bX69T9QEhw-1)*NR) = -2; - znext = zeros(NR*NC,1); - cnext = zeros(NR*NC,1); + function path = F0uZ(B,rowS,colS,n6b1,S5nU,iwBe,Ks71,xhiv) + [Bc8q C5T_] = size(B); + WQYV = zeros(Bc8q,C5T_); + L_vg = zeros(Bc8q,C5T_); + BcVP = -ones(Bc8q,C5T_); + BcVP(rowS+(colS-1)*Bc8q) = 0; + BcVP(n6b1+(S5nU-1)*Bc8q) = -2; + FQMc = zeros(Bc8q*C5T_,1); + dhIz = zeros(Bc8q*C5T_,1); count = numel(rowS); - znext(1:count) = rowS; - cnext(1:count) = colS; - dR=[-1 1 0 0]; - dC=[0 0 -1 1]; - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - zR = znext; - zC = cnext; - count = 0; - for i = 1:N - Aa2p_xqlDq = zC(i); - zi = zR(i); - for s=1:4 - r = zi + dR(s); - c = Aa2p_xqlDq + dC(s); - Z = r + (c-1)*NR; - tag = C(Z); - if tag == -2 - %path = traceback_a(r,c,step+1); - pathLength=step+1; - pR(r,c) = zR(i); - pC(r,c) = zC(i); - path = zeros(pathLength,4); - for jjj = 1:pathLength - path(jjj,1:2) = [r c]; - preR = pR(r,c); - preC = pC(r,c); - path(jjj,3:4) = [preR preC]; - r = preR; - c = preC; - end - return - end - if tag == -1 && B(Z) == 0 - C(Z) = step+1; - pR(Z) = zi; - pC(Z) = Aa2p_xqlDq; - count = count + 1; znext(count) = r; cnext(count) = c; - end - end - end + FQMc(1:count) = rowS; + dhIz(1:count) = colS; + EoPt=[-1 1 0 0]; + dSpY=[0 0 -1 1]; + for step = 0:min(Ks71,xhiv) + if count < 1, break, end + GRaz = count; + iMEc = FQMc(1:GRaz); + umDu = dhIz(1:GRaz); + count = 0; + for G1xR = 1:GRaz + ZLok = umDu(G1xR); + Blu2 = iMEc(G1xR); + for BC3q=1:4 + PeSE = Blu2 + EoPt(BC3q); + Ulrf = ZLok + dSpY(BC3q); + vuBz = PeSE + (Ulrf-1)*Bc8q; + cHwV = BcVP(vuBz); + if cHwV == -2 + c7oz=step+1; + WQYV(PeSE,Ulrf) = iMEc(G1xR); + L_vg(PeSE,Ulrf) = umDu(G1xR); + path = zeros(c7oz,4); + for LazW = 1:c7oz + path(LazW,1:2) = [PeSE Ulrf]; + KHKc = WQYV(PeSE,Ulrf); + VTU6 = L_vg(PeSE,Ulrf); + path(LazW,3:4) = [KHKc VTU6]; + PeSE = KHKc; + Ulrf = VTU6; end + return + end + if cHwV == -1 && B(vuBz) == 0 + BcVP(vuBz) = step+1; + WQYV(vuBz) = Blu2; + L_vg(vuBz) = ZLok; + count = count + 1; FQMc(count) = PeSE; dhIz(count) = Ulrf; + end + end + end + end path = []; - end+ end