ID: 
Title:typ2SHsolver2
Author:utrStijn Helsen
Date:2006-04-12 16:51:302006-04-05 15:42:51
Score:840.26771258.4149
Result:83691125841
CPU Time:64.952112.6984
Status:PassedPassed
Code: 
- function m=solver(tb,nM)
- [m,b]=l0(tb,nM,1);st=sum(sum(b));if(st > 800)
- [m2,b]=l0(tb,nM,0.9);st2=sum(sum(b));if st2<st
- m=m2;end;end
- function [l1,l2]=l0(tl2,nl1,z)
- l2=zeros(size(tl2,1)+1,size(tl2,2)+2);l2(2:end,2:end-1)=tl2;[l3,l4]=size(l2);l1=ones(nl1,3);l5=0;
- zz=zeros(1,floor(((l3-1)*(l4-2))/2));i=1;for r=l3:-1:2
- for cl=l4-2:-1:1
- if mod(r+cl,2)
- zz(i)=(cl*l3)+r;i=i+1;end;end;end
- l6=zeros(1,900);l7=zeros(1,900);l8=zeros(1,400);l9=zeros(numel(l2),1);
- if (l3*l4)>10.5*nl1
- I0=40;I1=.817;I2=2.93;I3=1.566;elseif (l3*l4)>8.5*nl1
- I0=29;I1=.817;I2=2.93;I3=1.566;elseif l3*l4>=256
- I0=26;I1=.951;I2=2.8;I3=1.4;else
- I0=26;I1=.945;I2=2.97;I3=1.46;end
- I1=I1*z;l2=a37(l2,I3);I4=ceil(I2*nl1/10);I5=floor(0.66*nl1);while 1
- if l5==I5,l2=a37(l2,2/(1+I3));end
- [I6,I7,I8] = I9(l2);if isempty(I6),[O0,l2]=O1(l2);
- if O0(1)
- l5=l5+1;l1(l5,:)=O0;if(l5==nl1)
- break;end
- continue
+ function moves = solver(board,nMoves)
+ %SOLVER Solve the Blockbuster Contest problem
+ %
+ % MOVES = SOLVER(BOARD,NMOVES) BlockBuster solver.
+ %
+ % MOVES -> [row,column,action]
+ % action -> 0 busts, 1 swap up, 2 swap right, 3 swap down, 4 swap left
+ 
+ [M,N]=size(board);
+ M2=M+2;
+ A=[zeros(1,N+2);zeros(M,1) board zeros(M,1);zeros(1,N+2)];
+ b=unique(board(:));
+ nb=b;
+ for i=1:length(b)
+ 	nb(i)=sum(board(:)==b(i));
  end
- break
+ nb1=nb==1;
+ nb(nb1)=[];
+ if isempty(nb)
+ 	% probably not necessary
+ 	moves=zeros(0,3);
+ 	return
  end
- if l5<nl1-1
- [I7,O2]=sort(I7,2,'descend');I6=I6(O2);for k=1:min(numel(I6),I0)
- O3=O4(l2,I8,I6(k));[O5,O6]=I9(O3);if (~isempty(O5))
- I4_=max(min(I4,nl1-l5-3),1);if numel(O6)<=I4_
- I7(k)=I7(k)+sum(O6);else
- O6=sort(O6,2,'descend');I7(k)=I7(k)+sum(O6(1:I4_));end
+ b(nb1)=[];
+ moves=zeros(nMoves,3);
+ iMoves=0;
+ bLoop=0;
+ nblok=zeros(1,max(nb));
+ iblok=nblok;
+ 
+ while iMoves<nMoves
+ 	[mx,ib]=max(nb);
+ 	if mx<2
+ 		if bLoop
+ 			bLoop=0;
+ 			mx=0;
+ 			for i=1:length(b)
+ 				nb(i)=sum(board(:)==b(i));
+ 				if mx<nb(i)
+ 					mx=nb(i);
+ 					ib=i;
+ 				end
+ 			end
+ 		else
+ 			break
+ 		end
+ 	end
+ 	b1=b(ib);
+ 	lijst=find(A==b1);
+ 	ibl=1;
+ 	nbl=0;
+ 	i0=1;
+ 	mx=1;
+ 	while i0<length(lijst)
+ 		[lijst,nI]=contblock(lijst,A,i0,M2);
+ 		nbl=nbl+1;
+ 		n1=nI-i0;
+ 		iblok(nbl)=i0;
+ 		nblok(nbl)=n1;
+ 		i0=nI;
+ 		if n1>mx
+ 			mx=n1;
+ 			i=nbl;
+ 		end
+ 	end
+ 	
+ 	if mx>1
+ 		bLoop=1;
+ 		iMoves=iMoves+1;
+ 		i1=iblok(i);
+ 		i0=lijst(i1);
+ 		c=floor(i0/M2);
+ 		moves(iMoves,1)=i0-c*M2-1;
+ 		moves(iMoves,2)=c;
+ 		moves(iMoves,3)=0;
+ 		A=popblock(A,lijst(i1:i1+mx-1));
+ 		nb(ib)=nb(ib)-mx;
+ 		if nb(ib)<2
+ 			b(ib)=[];
+ 			nb(ib)=[];
+ 		end
+ 	else
+ 		nb(ib)=0;
+ 	end
  end
- if (I7(k)<I1*I7(1))
- break;end
+ moves = moves(1:iMoves,:);
+ 
+ function [lijst,n]=contblock(lijst,A,i0,M)
+ n=i0+1;
+ l1=lijst(i0);
+ a=A(l1);
+ A(l1)=0;
+ N=length(lijst);
+ while i0<n
+ 	if A(l1+1)==a
+ 		ii=ff(lijst,n,l1+1);
+ 		if ii>n
+ 			lijst(ii)=lijst(n);
+ 			lijst(n)=l1+1;
+ 		end
+ 		A(l1+1)=0;
+ 		n=n+1;
+ 		if n>N
+ 			break;
+ 		end
+ 	end
+ 	if A(l1-1)==a
+ 		ii=ff(lijst,n,l1-1);
+ 		if ii>n
+ 			lijst(ii)=lijst(n);
+ 			lijst(n)=l1-1;
+ 		end
+ 		A(l1-1)=0;
+ 		n=n+1;
+ 		if n>N
+ 			break;
+ 		end
+ 	end
+ 	if A(l1+M)==a
+ 		ii=ff(lijst,n,l1+M);
+ 		if ii>n
+ 			lijst(ii)=lijst(n);
+ 			lijst(n)=l1+M;
+ 		end
+ 		A(l1+M)=0;
+ 		n=n+1;
+ 		if n>N
+ 			break;
+ 		end
+ 	end
+ 	if A(l1-M)==a
+ 		ii=ff(lijst,n,l1-M);
+ 		if ii>n
+ 			lijst(ii)=lijst(n);
+ 			lijst(n)=l1-M;
+ 		end
+ 		A(l1-M)=0;
+ 		n=n+1;
+ 		if n>N
+ 			break;
+ 		end
+ 	end
+ 	i0=i0+1;
+ 	l1=lijst(i0);
  end
+ 
+ function A=popblock(A,I)
+ A(I)=0;
+ N=size(A,1);
+ c=unique(ceil(I/N))';
+ jj=N-1:-1:2;
+ for ic=c
+ 	i=N;
+ 	for j=jj
+ 		if A(j,ic)
+ 			i=i-1;
+ 			A(i,ic)=A(j,ic);
+ 		end
+ 	end
+ 	while i>1
+ 		i=i-1;
+ 		A(i,ic)=0;
+ 	end
  end
- [O7,O2]=max(I7);O8=I6(O2);l5=l5+1;l1(l5,:)=[mod(O8-1,l3),ceil(O8/l3)-1,0];l2=O4(l2,I8,O8);
- if (l5==nl1)
- break;
+ 
+ 
+ function i=ff(L,i,a)
+ while L(i)~=a
+ 	i=i+1;
  end
- end
- l1=l1(1:l5,:);
- function [O5,O6,O9]=I9(l2);
- [l3,l4]=size(l2);L0=0;ii=0;L1=0;L2=0;L3=0;c=0;
- for zi=1:numel(zz)
- i=zz(zi);c=l2(i);if c && (l2(i+1)==c||l2(i+l3)==c||l2(i-1)==c||l2(i-l3)==c)
- L0=L0+1;l8(1)=i;l2(i)=0;L1=i;L2=0;L3=1;while (L3-L2)
- L2=L2+1;ii=l8(L2);l9(ii)=L1;L1=ii;if l2(ii+1)==c
- L3=L3+1;l8(L3)=ii+1;l2(ii+1)=0;end
- if l2(ii-1)==c
- L3=L3+1;l8(L3)=ii-1;l2(ii-1)=0;end
- if l2(ii+l3)==c
- L3=L3+1;l8(L3)=ii+l3;l2(ii+l3)=0;end
- if l2(ii-l3)==c
- L3=L3+1;l8(L3)=ii-l3;l2(ii-l3)=0;end
- end
- l7(L0)=c*L2;l6(L0)=ii;end
- end
- O5=l6(1:L0);O6=l7(1:L0);O9=l9;end
- function B=O4(B,dj,y)
- B(y)=0;L4=ceil(y/l3);L5=L4;L6=L4;while dj(y)~=y
- y=dj(y);B(y)=0;L4=ceil(y/l3);L5=min(L5, L4);L6=max(L6, L4);end;
- for ip=L5:L6,
- kp=B(B(:,ip)>0,ip);B(:,ip)=0;B(l3-numel(kp)+1:l3,ip)=kp;end
- end
- function [O0,L8]=O1(l2)
- [l3 l4]=size(l2);L7=[-1 l3 1 -l3];L9=l3*l4;O0=zeros(1,3);L8=l2;Q0=0;Q1=find(l2~=0)';Q2=numel(Q1);
- for kc=1:Q2
- jj=Q1(kc);for Q3=1:4
- np=jj+L7(Q3);if np>0 && np<=L9 && l2(np)>0 && l2(np)~=l2(jj)
- tl2=Q4(l2,jj,np);[Q5,Q6]=I9(tl2);if (~isempty(Q6))
- if (max(Q6)> Q0)
- Q0=max(Q6);Q7=jj;Q8=Q3;Q9=np;end
- else
- for k2=max(1,kc-20):min(Q2,kc+20)
- W0=Q1(k2);for W1=1:4
- np2=W0+L7(W1);if np2>0 && np2<=L9 && tl2(np2)>0 && tl2(np2)~=tl2(W0)
- W2=Q4(tl2,W0,np2);[W3,W4,W5]=I9(W2);if (~isempty(W4) && max(W4)>Q0)
- W6=false;[W7,W8]=max(W4);Y=W3(W8);
- while (W5(Y)~=Y)
- Y = W5(Y);if (Y==np || Y==jj)
- W6=true;end
- end
- if (Y==np || Y==jj)
- W6=true;
- end
- if (W6)
- Q0=max(W4);Q7=jj;Q8=Q3;Q9=np;
- end
- end
- end
- end
- end
- end
- end
- end
- end
- if (Q0>0)
- O0 = [mod(Q7-1,l3),ceil(Q7/l3)-1,Q8];L8=Q4(l2,Q7,Q9);
- end
- end
- function l2 = Q4(l2,el1,el2)
- l2([el1,el2]) = l2([el2,el1]);
- end
- end
- end
- function y = a37(x, n)
- y =(x.^(1/n));
- end