ID: 
Title:tweaky bird and pushy cat 21Marco Tullio 202
Author:srachFabio Carnevale
Date:2008-05-07 11:55:182008-05-07 11:59:47
Score:13374.019713427.8624
Result:133071.00 (cyc: 21, node: 7229)133932.00 (cyc: 16, node: 6610)
CPU Time:47.885136.0041
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; + tLiF=315; + PwKm = rand(43,1); + W=zjuq(B); + WEUK = ta1t(B,W); + [Rq7L,hpCC] = size(B); + rrPF = B(Rq7L:-1:1,:); + rrPF = rrPF.'; + [Nxel,rvjg] = BRzs(rrPF,[1 2],[1 2],4*Rq7L*hpCC); + if WEUK > rvjg + W = [Rq7L-Nxel(:,2)+1 Nxel(:,1) Rq7L-Nxel(:,4)+1 Nxel(:,3)]; + WEUK=rvjg; 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; + I243=rand('state'); + rand(tLiF,1); + if WEUK>1000 && rand<.5 + [Nxel,rvjg] = BRzs(rrPF,[1 2],[1 2],4*Rq7L*hpCC); + if WEUK > rvjg + W = [Rq7L-Nxel(:,2)+1 Nxel(:,1) Rq7L-Nxel(:,4)+1 Nxel(:,3)]; + WEUK=rvjg; 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; + if WEUK>1000 && rand<.5 + [Nxel,rvjg] = BRzs(rrPF,[1 2],[1 2],4*Rq7L*hpCC); + if WEUK > rvjg + W = [Rq7L-Nxel(:,2)+1 Nxel(:,1) Rq7L-Nxel(:,4)+1 Nxel(:,3)]; + WEUK=rvjg; + end + end + rand('state',I243); + end + function [W,WEUK] = BRzs(W03D,cSCD,gGc9,gLkm) + [PINX,uHCZ]=size(W03D); + SMGQ= -ones(PINX+2,uHCZ+2); + SMGQ(2:end-1,2:end-1)=W03D; + vGvV = SMGQ; + i_xW = 4; + if size(vGvV,2) > 20 + QNDn = 4; + owB4 = 8; + egft = 18; else - cutfirst = 3; - cutsecond = 7; - cutoff = 13; + QNDn = 3; + owB4 = 7; + egft = 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 + WEUK = inf; + vute = [1 2;2 1]; + CbZP = [1 3;3 1]; + CzZ_ = [3 2 1;1 2 3]; + for ZZON = cSCD + if ZZON == 2 + [U589 jdb7] = sGcU(vGvV,QNDn,vute(ZZON,:)); + [nQIc cXjD] = RR5c(jdb7,U589,owB4,CbZP(ZZON,:)); + [M_GG YXwo] = RR5c(cXjD,nQIc,egft,CbZP(ZZON,:)); + else + [U589 jdb7] = sGcU(vGvV,4,vute(ZZON,:)); + [M_GG YXwo] = RR5c(jdb7,U589,11,CbZP(ZZON,:)); end + for i2EC = gGc9 + QEF7 = z1RN(vGvV,YXwo,M_GG,i_xW,egft,CzZ_(i2EC,:))-1; + GqYP = ta1t(W03D,QEF7); + if GqYP <= WEUK + WEUK = GqYP; + W = QEF7; + i_xW = i_xW - 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 KA6y = ta1t(B,W) + PINX=size(B,1); + B(W(:,1)+(W(:,2)-1)*PINX)=0; + B(W(:,3)+(W(:,4)-1)*PINX)=0; + KA6y=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 [giF_ GIw3] = OXlT(B,T01x) + Th9N = sort(B(B>0),'descend'); + S7tE = size(Th9N,1); + if S7tE < 1 + giF_ = []; + GIw3 = 0; + return + end + FUxR=Th9N(diff([0;Th9N])~=0); + giF_ = zeros(nnz(FUxR),3); + FnAg=histc(Th9N,FUxR(end:-1:1)); + giF_(:,1)=FUxR; + giF_(:,2)=FnAg(end:-1:1); + GIw3=nnz(FUxR); + if T01x < 3, return, end + for qwUC = 1:GIw3 + if giF_(qwUC,2) >= 2 + HO4I = giF_(qwUC,1); + [sixk D13Q] = find(B == HO4I); + WiqQ = 0; + KmMM = size(sixk,1); + WiqQ=sum(abs(diff(sixk))+abs(diff(D13Q))); + giF_(qwUC,3) = giF_(qwUC,2)*HO4I - 0.85 * WiqQ; + end + end + end + function [W B] = sGcU(B,egft,T01x) W = []; - - [pincount k] = analyzeboard(B,rz); - - if k < 1 - return + [giF_ GIw3] = OXlT(B,T01x); + if GIw3 < 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 + giF_=sortrows(giF_,-T01x); + for qwUC = 1:GIw3 + if giF_(qwUC,2) >= 2 + HO4I = giF_(qwUC,1); + [sixk D13Q] = find(B == HO4I); + KmMM = size(sixk,1); + B3EU = KmMM*(KmMM-1)/2; + dist = zeros(B3EU,3); + [KqDr dCNg]=find(tril(ones(KmMM),-1)); + dist(:,1)=dCNg; + dist(:,2)=KqDr; + dist(:,3)=abs(D13Q(KqDr)-D13Q(dCNg))+abs(sixk(KqDr)-sixk(dCNg)); + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + S7tE = 0; + for ZZON = 1:B3EU + if dist(ZZON,3) > egft+1 + break end + tbC4 = dist(ZZON,1); + vaj5 = dist(ZZON,2); + path = FUz5(B,[sixk(tbC4); sixk(vaj5)], [D13Q(tbC4); D13Q(vaj5)], -HO4I, egft, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + S7tE = 2; + edit = [1:(tbC4-1) (tbC4+1):(vaj5-1) (vaj5+1):KmMM]; + sixk = [sixk(tbC4); sixk(vaj5); sixk(edit)]; + D13Q = [D13Q(tbC4); D13Q(vaj5); D13Q(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 S7tE < 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 eT4N = 3:KmMM + [SLvu NR1w] = find(B == -HO4I); + uQuc = size(SLvu,1); + B3EU = uQuc * (KmMM - S7tE); + uGHw = (1:uQuc*KmMM)'; + vaj5=mod(uGHw-1,KmMM)+1; + tbC4=ceil(uGHw/KmMM); + cJd8 = (vaj5>S7tE); + tbC4 = tbC4(cJd8); + vaj5 = vaj5(cJd8); + WiqQ = abs(SLvu(tbC4)-sixk(vaj5)) + abs(NR1w(tbC4)-D13Q(vaj5)); + dist = [tbC4,vaj5,WiqQ]; + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + c7mQ = false(KmMM,1); + BZyp = false; + for ZZON = 1:B3EU + if dist(ZZON,3) > egft+1 + break end - + vaj5 = dist(ZZON,2); + if c7mQ(vaj5) + 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 - + tbC4 = dist(ZZON,1); + path = FUz5(B,[SLvu(tbC4); sixk(vaj5)], [NR1w(tbC4); D13Q(vaj5)], -HO4I, egft, HO4I); + c7mQ(vaj5)=true; + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + S7tE = S7tE + 1; + BZyp = true; + sixk([eT4N vaj5]) = sixk([vaj5 eT4N]); + D13Q([eT4N vaj5]) = D13Q([vaj5 eT4N]); + 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 ~BZyp + 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] = RR5c(B,W,cT1x,T01x) + [giF_ GIw3] = OXlT(B,T01x); + if GIw3 < 1, return, end + giF_=sortrows(giF_,-T01x); + for qwUC = 1:GIw3 + HO4I = giF_(qwUC,1); + uQuc = sum(B == -HO4I); + if uQuc == 0 + if giF_(qwUC,2) >= 2 + [sixk D13Q] = find(B == HO4I); + KmMM = size(sixk,1); + B3EU = KmMM*(KmMM-1)*.5; + uGHw = (1:KmMM*KmMM)'; + vaj5=mod(uGHw-1,KmMM)+1; + tbC4=ceil(uGHw/KmMM); + cJd8 = (tbC4<vaj5); + tbC4 = tbC4(cJd8); + vaj5 = vaj5(cJd8); + WiqQ = abs(sixk(tbC4)-sixk(vaj5)) + abs(D13Q(tbC4)-D13Q(vaj5)); + dist = [tbC4,vaj5,WiqQ]; + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + maxstep = min(cT1x,2*HO4I+1); + BZyp = false; + for ZZON = 1:B3EU + if dist(ZZON,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; + tbC4 = dist(ZZON,1); + vaj5 = dist(ZZON,2); + path = FUz5(B,[sixk(tbC4); sixk(vaj5)], [D13Q(tbC4); D13Q(vaj5)], -HO4I, cT1x, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + BZyp = true; + break + end + end + if ~BZyp + continue + end + end + end + [sixk D13Q] = find(B == HO4I); + FlSc = size(sixk,1); + maxstep = min(cT1x,HO4I+1); + for eT4N = 1:FlSc + [SLvu NR1w] = find(B == -HO4I); + uQuc = size(SLvu,1); + B3EU = uQuc * (FlSc-eT4N+1); + dist = zeros(B3EU,3); + ZZON = 0; + uGHw = (1:uQuc*FlSc)'; + vaj5=mod(uGHw-1,FlSc)+1; + tbC4=ceil(uGHw/FlSc); + cJd8 = (vaj5>=eT4N); + tbC4 = tbC4(cJd8); + vaj5 = vaj5(cJd8); + WiqQ = abs(SLvu(tbC4)-sixk(vaj5)) + abs(NR1w(tbC4)-D13Q(vaj5)); + dist = [tbC4,vaj5,WiqQ]; + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + c7mQ = false(FlSc,1); + BZyp = false; + for ZZON = 1:B3EU + if dist(ZZON,3) > maxstep+1 + break + end + vaj5 = dist(ZZON,2); + if c7mQ(vaj5) + randperm(4); + continue + end + tbC4 = dist(ZZON,1); + path = FUz5(B,[SLvu(tbC4); sixk(vaj5)], [NR1w(tbC4); D13Q(vaj5)], -HO4I, cT1x, 2*HO4I); + c7mQ(vaj5)=true; + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + BZyp = true; + sixk([eT4N vaj5]) = sixk([vaj5 eT4N]); + D13Q([eT4N vaj5]) = D13Q([vaj5 eT4N]); + break + end + end + if ~BZyp + break + end + end + end + end + function [uwvp THFM] = V_5h(SMGQ,B,path) + [HMzu i0DD] = size(B); + uwvp = SMGQ == 0; + THFM = uwvp; + uwvp(:,[1 i0DD]) = false; + THFM([1 HMzu],:) = false; + for qwUC = 1:size(path,1) + if path(qwUC,1) == path(qwUC,3) + uwvp(path(qwUC,1),path(qwUC,2)) = false; + uwvp(path(qwUC,3),path(qwUC,4)) = false; + end + if path(qwUC,2) == path(qwUC,4) + THFM(path(qwUC,1),path(qwUC,2)) = false; + THFM(path(qwUC,3),path(qwUC,4)) = false; + end + end + end + function B = F694(B,path,Mtfl) + B(path(1,1),path(1,2)) = Mtfl; + for qwUC = 1:size(path,1); + B(path(qwUC,3),path(qwUC,4)) = Mtfl; + end + end + function path = bncW(N6vt,qoQn,HMzu,fcJS) + path = zeros(fcJS,4); + jtzZ = mod(N6vt,HMzu); + nB9k = ceil(N6vt/HMzu); + for eT4N = 1:fcJS + path(eT4N,1:2) = [jtzZ nB9k]; + N6vt = qoQn(N6vt); + jtzZ = mod(N6vt,HMzu); + nB9k = ceil(N6vt/HMzu); + path(eT4N,3:4) = [jtzZ nB9k]; + end + end + function path = FUz5(B,sixk,D13Q,Mtfl,egft,Q613) + [HMzu i0DD] = size(B); + qoQn = zeros(HMzu,i0DD); + fwwV = -ones(HMzu,i0DD); + fwwV(sixk(2),D13Q(2)) = 0; + fwwV(sixk(1),D13Q(1)) = -2; + fwwV( B == Mtfl ) = -2; + nVUl = zeros(HMzu*i0DD,1); + nVUl(1) = sixk(2) + (D13Q(2)-1)*HMzu; 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 + mgZZ = [-1 1 -HMzu HMzu]; + gvcI = randperm(4); + for step = 0:min(egft,Q613) + if count < 1, break, end + KmMM = count; + N6vt = nVUl; + count = 0; + for qwUC = 1:KmMM + HhIr = N6vt(qwUC); + for ECxh=1:4 + UPFW = HhIr + mgZZ(gvcI(ECxh)); + oeO4 = fwwV(UPFW); + if oeO4 == -2 + qoQn(UPFW) = HhIr; + path = bncW(UPFW,qoQn,HMzu,step+1); + return end + if oeO4 == -1 && B(UPFW) == 0 + fwwV(UPFW) = step+1; + qoQn(UPFW) = HhIr; + count = count + 1; + nVUl(count) = UPFW; + 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 = gYJA(B,uwvp,THFM,sixk,D13Q,Mtfl,i_xW,cT1x,Q613) + [HMzu i0DD] = size(B); + BIcb = false(HMzu,i0DD); + qoQn = zeros(HMzu,i0DD); + fwwV = -ones(HMzu,i0DD); + fwwV(sixk(1),D13Q(1)) = -2; + fwwV( B == Mtfl ) = -2; + maxstep = min((i_xW*27)+cT1x,Q613+1); + CPYt = zeros(maxstep+28,1); + ZBR8 = sixk(2) + (D13Q(2)-1)*HMzu; + CPYt(1) = ZBR8; + mgZZ = [-HMzu HMzu -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 CPYt(step)>0 + HhIr = CPYt(step); + CPYt(step)=fwwV(HhIr); + for ECxh = 1:4 + UPFW = HhIr + mgZZ(ECxh); + oeO4 = fwwV(UPFW); + if oeO4==-1 + if B(UPFW) == 0 + fwwV(UPFW) = CPYt(step+1); + CPYt(step+1) = UPFW; + qoQn(UPFW) = HhIr; + elseif (uwvp(UPFW)&&(ECxh<3)) || (THFM(UPFW)&&(ECxh>2)) + fwwV(UPFW) = CPYt(step+26); + CPYt(step+26) = UPFW; + qoQn(UPFW) = HhIr; + BIcb(UPFW) = true; end + end + if oeO4==-2 + qoQn(UPFW) = HhIr; + jtzZ=mod(UPFW,HMzu); + nB9k=ceil(UPFW/HMzu); + path = zeros(step+1,4); + eT4N = 0; + while UPFW~=ZBR8 + eT4N = eT4N + 1; + path(eT4N,1:2) = [jtzZ nB9k]; UPFW = qoQn(UPFW); + jtzZ=mod(UPFW,HMzu); + nB9k=ceil(UPFW/HMzu); + path(eT4N,3:4) = [jtzZ nB9k]; + if BIcb(jtzZ,nB9k) + eT4N = eT4N + 1; + path(eT4N,:) = [jtzZ nB9k jtzZ nB9k]; + end + end + path = path(1:eT4N,:); + 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 = zjuq(B) + [W,WEUK] = iIYY(B); + RA5M = 0; + KM7D = round(mod(B(:),2)); + if WEUK < 2100 + return end - [kJfcOitU9b,ZqDtJmqMeb] = size(B); + [tmzZ,Ckko] = 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]; + [CbpP,JL_U] = iIYY(B); + if WEUK > JL_U + W = [tmzZ-CbpP(:,2)+1 Ckko-CbpP(:,1)+1 tmzZ-CbpP(:,4)+1 Ckko-CbpP(:,3)+1]; end - if d2F7TC2nTS~=IN55LEuuYN; W = zeros(0,4); end + if KM7D~=RA5M; 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,WEUK] = iIYY(B) + [PINX,uHCZ]=size(B); + TvS3=nan(PINX+2,uHCZ+2); + TvS3(2:end-1,2:end-1)=B; + vGvV = TvS3; + i_xW = 4; + if size(vGvV,2) > 20 + QNDn = 4; + owB4 = 8; + egft = 12; else - cutfirst = 3; - cutsecond = 7; - cutoff = 11; + QNDn = 3; + owB4 = 7; + egft = 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 + WEUK = inf; + vute = [1 2;2 1]; + CbZP = [1 3;3 1]; + CzZ_ = [3 2 1;1 2 3]; + for ZZON = 1:2 + if ZZON == 2 + [U589 jdb7] = DxIJ(vGvV,QNDn,vute(ZZON,:)); + [nQIc cXjD] = OZro(jdb7,U589,owB4,CbZP(ZZON,:)); + [M_GG YXwo] = OZro(cXjD,nQIc,egft,CbZP(ZZON,:)); + else + [U589 jdb7] = DxIJ(vGvV,4,vute(ZZON,:)); + [M_GG YXwo] = OZro(jdb7,U589,11,CbZP(ZZON,:)); 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 i2EC = 1:2 + if ZZON == 2 && i2EC == 2 && WEUK > 2100, return, end + QEF7 = z1RN(vGvV,YXwo,M_GG,i_xW,egft,CzZ_(i2EC,:))-1; + GqYP = ta1t(B,QEF7); + if GqYP <= WEUK + WEUK = GqYP; + W = QEF7; + i_xW = i_xW - 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 PINX*uHCZ > 290; return; end + Vw4g = sum(W(:,1)==W(:,3)&W(:,2)==W(:,4)); + if Vw4g <= 4 + XFBm = Nv0d(B); + NYga = ta1t(B,XFBm); + if NYga < WEUK + W = XFBm; + WEUK = NYga; 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 = ySbC(B,sixk,D13Q,Mtfl,egft,Q613) + function path = k_r_(WBzF,XNQN,Di8u) + AO8X(WBzF,XNQN) = A3Du(qwUC); + KUUd(WBzF,XNQN) = X1WJ(qwUC); + path = zeros(Di8u,4); + for bif9 = 1:Di8u + path(bif9,1:2) = [WBzF XNQN]; + zzao = AO8X(WBzF,XNQN); + VkEz = KUUd(WBzF,XNQN); + path(bif9,3:4) = [zzao VkEz]; + WBzF = zzao; + XNQN = VkEz; + end + end + [HMzu i0DD] = size(B); + AO8X = zeros(HMzu,i0DD); + KUUd = zeros(HMzu,i0DD); + fwwV = -ones(HMzu,i0DD); + fwwV(sixk(2),D13Q(2)) = 0; + fwwV(sixk(1),D13Q(1)) = -2; + fwwV( B == Mtfl ) = -2; + bQea = zeros(HMzu*i0DD,1); + LTpa = zeros(HMzu*i0DD,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 + bQea(1) = sixk(2); + LTpa(1) = D13Q(2); + hCg6=[-1 1 0 0]; + D04X=[0 0 -1 1]; + for step = 0:min(egft,Q613) + if count < 1, break, end + KmMM = count; + A3Du = bQea(1:KmMM); + X1WJ = LTpa(1:KmMM); + count = 0; + for qwUC = 1:KmMM + BTPl = X1WJ(qwUC); + HhIr = A3Du(qwUC); + for ECxh=1:4 + WBzF = HhIr + hCg6(ECxh); + XNQN = BTPl + D04X(ECxh); + UPFW = WBzF + (XNQN-1)*HMzu; + oeO4 = fwwV(UPFW); + if oeO4 == -2 + path = k_r_(WBzF,XNQN,step+1); + return + elseif oeO4 == -1 && B(UPFW) == 0 + fwwV(UPFW) = step+1; + AO8X(UPFW) = HhIr; + KUUd(UPFW) = BTPl; + count = count + 1; bQea(count) = WBzF; LTpa(count) = XNQN; 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 fK6b = Nv0d(vaj5) + HO4I = unique(vaj5); + HO4I(1) = []; + ztks = zeros(size(HO4I)); + for qwUC = 1:length(ztks) + ztks(qwUC) = nnz(HO4I(qwUC) == vaj5(:)); end - for i = 1:length(n) - if n(i) == 1 - b(p(i) == b(:)) = -1; - end + for qwUC = 1:length(ztks) + if ztks(qwUC) == 1 + vaj5(HO4I(qwUC) == vaj5(:)) = -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 + vu2N = zeros(size(vaj5)+2); + O8_o = repmat(-1,size(vu2N)); + O8_o(2:end-1,2:end-1) = vaj5; + fK6b = []; + [yEDk, C9GU] = find(O8_o>0); + WiqQ = (size(O8_o,1)/2 - yEDk).^2 + (size(O8_o,2)/2 - C9GU).^2; + [WiqQ, order] = sort(WiqQ); 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 GIw3 = 1:length(yEDk)-1 + gFM0 = 0; + kL0Q = 32; + for qwUC = order + if vu2N(yEDk(qwUC), C9GU(qwUC)) + continue end - w = w - 1; + [KA6y, o7PH, KobU] = KiT5(O8_o, vu2N, yEDk(qwUC), C9GU(qwUC), kL0Q); + if KA6y > gFM0 + gFM0 = KA6y; + unqH = o7PH; + kL0Q = KobU; + if kL0Q == 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 gFM0 == 0 + fK6b = fK6b - 1; + return end - bestscore = b(z,zC) - minsteps; - if minsteps == 1 - bestmove = [z, zC, Cw4BfzRNQ6, qpF1lfOV53]; - return + vu2N = F694(vu2N, unqH, O8_o(unqH(1,1), unqH(1,2))); + O8_o = F694(O8_o, unqH, O8_o(unqH(1,1), unqH(1,2))); + fK6b = [fK6b; unqH]; 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; + fK6b = fK6b - 1; end + function [gFM0, unqH, kL0Q] = KiT5(vaj5, vu2N, N6vt, X1WJ, Aw07) + gFM0 = 0; + unqH = []; + bif9 = [1 -1 0 0]; + GIw3 = [0 0 1 -1]; + if ~any(vu2N(:)==vaj5(N6vt,X1WJ)) + vu2N = vaj5; end - - - function [W B] = phase1_a(B,cutoff,rz) + O8_o = vaj5; + O8_o(O8_o>0) = -1; + O8_o(N6vt,X1WJ) = 1; + kL0Q = Inf; + HO4I = vaj5(N6vt,X1WJ); + for qwUC = 1:Aw07-2 + [yEDk, C9GU] = find(O8_o==qwUC); + for ztks = 1:length(yEDk) + for vmdW = 1:4 + l8Vd = yEDk(ztks) + bif9(vmdW); + n2bg = C9GU(ztks) + GIw3(vmdW); + if vu2N(l8Vd,n2bg) == HO4I && ~(l8Vd == N6vt && n2bg == X1WJ) + kL0Q = qwUC; + break + end + hn9i = O8_o(l8Vd,n2bg); + if hn9i == 0 + O8_o(l8Vd,n2bg) = qwUC+1; + end + end + if kL0Q < Inf + break + end + end + if kL0Q < Inf + break + end + end + if kL0Q == Inf + return + end + gFM0 = vaj5(N6vt,X1WJ) - kL0Q; + if kL0Q == 1 + unqH = [N6vt, X1WJ, l8Vd, n2bg]; + return + end + unqH = zeros(kL0Q,4); + for step = kL0Q:-1:1 + for vmdW = 1:4 + rhkl = l8Vd + bif9(vmdW); + BVHE = n2bg + GIw3(vmdW); + if O8_o(rhkl, BVHE) == step + break + end + end + unqH(step,:) = [rhkl, BVHE, l8Vd, n2bg]; + l8Vd = rhkl; + n2bg = BVHE; + end + end + function [W B] = DxIJ(B,egft,T01x) W = []; - [pincount k] = analyzeboard(B,rz); - if k < 1 - return + [giF_ GIw3] = OXlT(B,T01x); + if GIw3 < 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 + giF_=sortrows(giF_,-T01x); + for qwUC = 1:GIw3 + if giF_(qwUC,2) >= 2 + HO4I = giF_(qwUC,1); + [sixk D13Q] = find(B == HO4I); + KmMM = size(sixk,1); + B3EU = KmMM*(KmMM-1)/2; + dist = zeros(B3EU,3); + ZZON = 0; + for tbC4 = 1:KmMM + for vaj5 = (tbC4+1):KmMM + ZZON = ZZON + 1; + dist(ZZON,1) = tbC4; + dist(ZZON,2) = vaj5; + dist(ZZON,3) = abs(sixk(tbC4)-sixk(vaj5)) + abs(D13Q(tbC4)-D13Q(vaj5)); 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 + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + b9sn = reshape(dist(:,1:2)',[],1); + S7tE = 0; + UJk2 = 1; + SJM2 = false(KmMM,1); + for qwUC=1:KmMM + yeoz = find( ~SJM2(b9sn(UJk2:end)) , 1 , 'first'); + if isempty(yeoz) + break end + tbC4 = b9sn(yeoz); + Distance = abs(sixk([1:tbC4-1,tbC4+1:end]')-sixk(tbC4)) + abs(D13Q([1:tbC4-1,tbC4+1:end]')-D13Q(tbC4)); + if max(Distance)>egft-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 = YRI6(B,sixk(tbC4),D13Q(tbC4),sixk([1:tbC4-1,tbC4+1:end]'),D13Q([1:tbC4-1,tbC4+1:end]'), -HO4I, egft, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + S7tE = 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 S7tE < 2 + continue end + for bif9 = 3:KmMM + [SLvu NR1w] = find(B == -HO4I); + [sixk D13Q] = find(B == HO4I); + [JdGf,UHsB] = meshgrid(sixk,SLvu); + [WQZn,jMWa] = meshgrid(sixk,SLvu); + Distance = abs(JdGf-UHsB) + abs(WQZn-jMWa); + if max(Distance(:))>egft-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 = YRI6(B,SLvu,NR1w,sixk,D13Q, -HO4I, egft, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + BZyp = true; + else + break + end + end + end + end + end + function [W B] = OZro(B,W,ys1O,T01x) + [giF_ GIw3] = OXlT(B,T01x); + if GIw3 < 1, return, end + giF_=sortrows(giF_,-T01x); + for qwUC = 1:GIw3 + HO4I = giF_(qwUC,1); + uQuc = sum(B == -HO4I); + if uQuc == 0 + if giF_(qwUC,2) >= 2 + [sixk D13Q] = find(B == HO4I); + KmMM = size(sixk,1); + B3EU = KmMM*(KmMM-1)/2; + dist = zeros(B3EU,3); + ZZON = 0; + for tbC4 = 1:KmMM + for vaj5 = (tbC4+1):KmMM + ZZON = ZZON + 1; + dist(ZZON,1) = tbC4; + dist(ZZON,2) = vaj5; + dist(ZZON,3) = abs(sixk(tbC4)-sixk(vaj5)) + abs(D13Q(tbC4)-D13Q(vaj5)); + end + end + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + maxstep = min(ys1O,2*HO4I+1); + BZyp = false; + for ZZON = 1:B3EU + if dist(ZZON,3) > maxstep+1 + break + end + tbC4 = dist(ZZON,1); + vaj5 = dist(ZZON,2); + path = ySbC(B,[sixk(tbC4); sixk(vaj5)], [D13Q(tbC4); D13Q(vaj5)], -HO4I, ys1O, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + BZyp = true; + break + end + end + if ~BZyp + continue + end + end + end + [sixk D13Q] = find(B == HO4I); + HDcu = size(sixk,1); + maxstep = min(ys1O,HO4I+1); + for bif9 = 1:HDcu + [SLvu NR1w] = find(B == -HO4I); + [sixk D13Q] = find(B == HO4I); + BZyp = false; + path = YRI6(B,SLvu,NR1w,sixk,D13Q, -HO4I, ys1O, HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + BZyp = true; + end + if ~BZyp + break + end + end + end + end + function [W B] = z1RN(TvS3,B,W,i_xW,ys1O,T01x) + function GnDY() + for fK6b = 1:size(path,1); + if path(fK6b,1) == path(fK6b,3) + eYmK(path(fK6b,1),path(fK6b,2)) = false; + eYmK(path(fK6b,3),path(fK6b,4)) = false; + if path(fK6b,2) == path(fK6b,4) + B(path(fK6b,1),path(fK6b,2)) = -9999; + end + end + if path(fK6b,2) == path(fK6b,4) + Jtlc(path(fK6b,1),path(fK6b,2)) = false; + Jtlc(path(fK6b,3),path(fK6b,4)) = false; + end + end + end + [eYmK Jtlc] = V_5h(TvS3,B,W); + [giF_ GIw3] = OXlT(B,T01x); + if GIw3 < 1, return, end + giF_=sortrows(giF_,-T01x); + for qwUC = 1:GIw3 + HO4I = giF_(qwUC,1); + uQuc = sum(B == -HO4I); + if uQuc == 0 + if giF_(qwUC,2) >= 2 + [sixk D13Q] = find(B == HO4I); + KmMM = size(sixk,1); + B3EU = KmMM*(KmMM-1)/2; + dist = zeros(B3EU,3); + ZZON = 0; + for tbC4 = 1:KmMM + for vaj5 = (tbC4+1):KmMM + ZZON = ZZON + 1; + dist(ZZON,1) = tbC4; + dist(ZZON,2) = vaj5; + dist(ZZON,3) = abs(sixk(tbC4)-sixk(vaj5)) + abs(D13Q(tbC4)-D13Q(vaj5)); + end + end + [WiqQ eVfq] = sort(dist(:,3)); + dist = dist(eVfq,:); + maxstep = min((i_xW*25)+ys1O,2*HO4I+1); + BZyp = false; + for ZZON = 1:B3EU + if dist(ZZON,3) > maxstep+1 + break + end + tbC4 = dist(ZZON,1); + vaj5 = dist(ZZON,2); + path = gYJA(B,eYmK,Jtlc,[sixk(tbC4); sixk(vaj5)], [D13Q(tbC4); D13Q(vaj5)], -HO4I, i_xW, ys1O, 2*HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + GnDY(); + BZyp = true; + break + end + end + if ~BZyp + continue + end + end + end + [sixk D13Q] = find(B == HO4I); + HDcu = size(sixk,1); + maxstep = min((i_xW*25)+ys1O,HO4I+1); + for bif9 = 1:HDcu + [SLvu NR1w] = find(B == -HO4I); + [sixk D13Q] = find(B == HO4I); + BZyp = false; + path = nSUA(B,eYmK,Jtlc,SLvu,NR1w,sixk,D13Q, -HO4I, i_xW, ys1O, HO4I); + if size(path,1) > 0 + W = [W; path]; + B = F694(B,path,-HO4I); + GnDY(); + BZyp = true; + end + if ~BZyp + break + end + end + end + end + function path = nSUA(B,uwvp,THFM,rowS,colS,Mzw2,AVHH,Mtfl,i_xW,cT1x,Q613) + function path = bncW(UPFW,step) + qoQn(UPFW) = HhIr; + path = zeros(step,4); + eT4N = 0; + QrT5 = 0; + usfW = zeros(step,1); + pq1c = zeros(step,1); + B7TG = zeros(step,1); + while isempty(find(zfqO==UPFW,1)) + eT4N = eT4N + 1; + usfW(eT4N,1) = UPFW; + bOW1 = qoQn(UPFW); + pq1c(eT4N,1) = bOW1; + UPFW = bOW1; + if BIcb(UPFW) + QrT5 = QrT5 + 1; + B7TG(QrT5,1) = UPFW; + end + end + usfW = [ usfW(1:eT4N,:) ; B7TG(1:QrT5,1) ]; + pq1c = [ pq1c(1:eT4N,:) ; B7TG(1:QrT5,1) ]; + path = [ mod(usfW,HMzu) , ceil(usfW/HMzu) , mod(pq1c,HMzu) , ceil(pq1c/HMzu) ]; + end + [HMzu i0DD] = size(B); + BIcb = false(HMzu,i0DD); + qoQn = zeros(HMzu,i0DD); + fwwV = -ones(HMzu,i0DD); + zfqO = rowS + (colS-1)*HMzu; + fwwV(zfqO) = 0; + fwwV(Mzw2 + (AVHH-1)*HMzu) = -2; + maxstep = min((i_xW*25)+cT1x,Q613+1); + xpV0 = zeros(maxstep+26,1); + oIzf = [-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 + N6vt = zfqO; + elseif xpV0(step) == 0 + continue + else + N6vt = find(fwwV == step); end + KmMM = numel(N6vt); + for qwUC = 1:KmMM + HhIr = N6vt(qwUC); + for yiuE = 1:2 + UPFW = HhIr + oIzf(yiuE) * HMzu; + oeO4 = fwwV(UPFW); + if oeO4 == -2 + path = bncW(UPFW,step+1); + return + elseif oeO4 == -1 + if B(UPFW) == 0 + fwwV(UPFW) = step+1; xpV0(step+1) = 1; + qoQn(UPFW) = HhIr; + elseif uwvp(UPFW) + fwwV(UPFW) = step+26; xpV0(step+26) = 1; + qoQn(UPFW) = HhIr; + BIcb(UPFW) = true; + end + end + end + for yiuE = 1:2 + UPFW = HhIr + oIzf(yiuE); + oeO4 = fwwV(UPFW); + if oeO4 == -2 + path = bncW(UPFW,step+1); + return + elseif oeO4 == -1 + if B(UPFW) == 0 + fwwV(UPFW) = step+1; xpV0(step+1) = 1; + qoQn(UPFW) = HhIr; + elseif THFM(UPFW) + fwwV(UPFW) = step+26; xpV0(step+26) = 1; + qoQn(UPFW) = HhIr; + BIcb(UPFW) = 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 = YRI6(B,rowS,colS,LJNi,XTzf,Mtfl,egft,Q613) + [HMzu i0DD] = size(B); + AO8X = zeros(HMzu,i0DD); + KUUd = zeros(HMzu,i0DD); + fwwV = -ones(HMzu,i0DD); + fwwV(rowS+(colS-1)*HMzu) = 0; + fwwV(LJNi+(XTzf-1)*HMzu) = -2; + nVUl = zeros(HMzu*i0DD,1); + LTpa = zeros(HMzu*i0DD,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 + nVUl(1:count) = rowS; + LTpa(1:count) = colS; + hCg6=[-1 1 0 0]; + D04X=[0 0 -1 1]; + for step = 0:min(egft,Q613) + if count < 1, break, end + KmMM = count; + A3Du = nVUl(1:KmMM); + X1WJ = LTpa(1:KmMM); + count = 0; + for qwUC = 1:KmMM + BTPl = X1WJ(qwUC); + HhIr = A3Du(qwUC); + for ECxh=1:4 + WBzF = HhIr + hCg6(ECxh); + XNQN = BTPl + D04X(ECxh); + UPFW = WBzF + (XNQN-1)*HMzu; + oeO4 = fwwV(UPFW); + if oeO4 == -2 + Di8u=step+1; + AO8X(WBzF,XNQN) = A3Du(qwUC); + KUUd(WBzF,XNQN) = X1WJ(qwUC); + path = zeros(Di8u,4); + for bif9 = 1:Di8u + path(bif9,1:2) = [WBzF XNQN]; + zzao = AO8X(WBzF,XNQN); + VkEz = KUUd(WBzF,XNQN); + path(bif9,3:4) = [zzao VkEz]; + WBzF = zzao; + XNQN = VkEz; end + return + end + if oeO4 == -1 && B(UPFW) == 0 + fwwV(UPFW) = step+1; + AO8X(UPFW) = HhIr; + KUUd(UPFW) = BTPl; + count = count + 1; nVUl(count) = WBzF; LTpa(count) = XNQN; + end + end + end + end path = []; - end+ end