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
+
+ [m,b]=solveri(tb,nM,1);
+ sthis=sum(sum(b));
+ if (sthis > 1000)
+ [m2,b]=solveri(tb,nM,0.9);
+ sthis2=sum(sum(b));
+ if sthis2<sthis
+ m=m2;
+ end
+ end;
+
+ function [moves,board] =solveri(tboard,nMoves,z)
+
+ board=zeros(size(tboard,1)+1,size(tboard,2)+2);
+ board(2:end,2:end-1)=tboard;
+ [rows, cols] = size(board);
+ moves = ones(nMoves,3);
+ count=0;
+
+ zz=zeros(1,floor(((rows-1)*(cols-2))/2));
+ i=1;
+ for r=rows:-1:2
+ for cl=cols-2:-1:1
+ if mod(r+cl,2)
+ zz(i)=(cl*rows)+r;
+ i=i+1;
+ end
+ end
end
- break
- 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
- end
- if (I7(k)<I1*I7(1))
- break;end
- 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;
- 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
+
+ celbuf=zeros(1,900);
+ valbuf=zeros(1,900);
+ ibuf=zeros(1,400);
+ new_mask_l=zeros(numel(board),1);
+
+ % set move calculation parameters
+ if (rows*cols) > 10.5*nMoves
+ next_move_count = 40;
+ choke_factor = .817;
+ depth_factor = 2.93;
+ rot = 1.566;
+ elseif (rows*cols) > 8.5*nMoves
+ next_move_count = 29;
+ choke_factor = .817;
+ depth_factor = 2.93;
+ rot = 1.566;
+ elseif rows*cols >= 256
+ next_move_count = 26;
+ choke_factor = .951;
+ depth_factor = 2.8;
+ rot = 1.4;
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
+ next_move_count = 26;
+ choke_factor = 0.945;
+ depth_factor = 2.97;
+ rot = 1.46;
end
- if (Y==np || Y==jj)
- W6=true;
+ choke_factor=choke_factor*z;
+ % adjust block weights
+ board = nthroot(board,rot);
+
+ depth = ceil(depth_factor*nMoves/10);
+ flip = floor(0.66*nMoves);
+ while 1
+ % restore original colour values half-way through game
+ if count==flip, board = nthroot(board,2/(1+rot)); end
+ % find highest value moves
+ [cell_list,value_list,mask] = CalculateMoves(board);
+ if isempty(cell_list),
+ [swapmv,board]=CheckForSwap(board);
+ if swapmv(1)
+ count = count+1;
+ moves(count,:) = swapmv;
+ if (count==nMoves)
+ break;
+ end
+ continue
+ end
+ break
+ end
+
+ % check future move values and re-weight current moves
+ if count<nMoves-1
+ [value_list,pos]=sort(value_list,2,'descend');
+ cell_list=cell_list(pos);
+ for k=1:min(numel(cell_list),next_move_count)
+ new_board = ProcessMove(board,mask,cell_list(k));
+ [new_cell_list,new_value_list] = CalculateMoves(new_board);
+
+ if (~isempty(new_cell_list))
+ depth_ = max(min(depth,nMoves-count-3),1);
+ if numel(new_value_list)<=depth_
+ value_list(k) = value_list(k) + sum(new_value_list);
+ else
+ new_value_list=sort(new_value_list,2,'descend');
+ value_list(k) = value_list(k) + sum(new_value_list(1:depth_));
+ end
+ end
+ if (value_list(k) < choke_factor * value_list(1))
+ break;
+ end
+ end
+ end
+
+ % take new most-valuable move
+ [max_val,pos] = max(value_list); %#ok
+ max_cell = cell_list(pos);
+ count = count+1;
+ moves(count,:) = [mod(max_cell-1,rows),ceil(max_cell/rows)-1,0];
+ board = ProcessMove(board,mask,max_cell);
+
+ if (count==nMoves)
+ break;
+ end
end
- if (W6)
- Q0=max(W4);Q7=jj;Q8=Q3;Q9=np;
+ moves = moves(1:count,:);
+
+ % function [cell_list,value_list,mask] = CalculateMoves(board)
+
+
+ function [new_cell_list,new_value_list,new_mask] = CalculateMoves(board);
+ [rows,cols]=size(board);
+ % N=true(rows,cols);
+ % areal=rows*cols;
+ % new_mask_l=zeros(numel(board),1);
+ group_index=0;
+ % tscore=0;
+ ii=0;
+ prev=0;
+ readpoint=0;
+ writepoint=0;
+ c=0;
+ % for r=rows:-1:rw
+ % for cl=cols-2:-1:1
+ % i=(cl*rows)+r;
+ for zi=1:numel(zz)
+ % if N(i)
+ i=zz(zi);
+ c=board(i);
+ if c && (board(i+1)==c || board(i+rows)==c || board(i-1)==c || board(i-rows)==c)
+ group_index=group_index+1;
+ % tscore=row_offset(i);
+ ibuf(1)=i;
+ board(i)=0;
+ prev=i;
+ readpoint=0;
+ writepoint=1;
+ while (writepoint-readpoint)
+ readpoint=readpoint+1;
+ ii=ibuf(readpoint);
+ % if N(ii)
+ % N(ii)=false;
+ % tscore=tscore+c;
+ new_mask_l(ii)=prev;
+ % celbuf(group_index)=ii;
+ prev=ii;
+ if board(ii+1)==c
+ writepoint=writepoint+1;
+ ibuf(writepoint)=ii+1;
+ board(ii+1)=0;
+ end
+ if board(ii-1)==c
+ writepoint=writepoint+1;
+ ibuf(writepoint)=ii-1;
+ board(ii-1)=0;
+ end
+ if board(ii+rows)==c
+ writepoint=writepoint+1;
+ ibuf(writepoint)=ii+rows;
+ board(ii+rows)=0;
+ end
+ if board(ii-rows)==c
+ writepoint=writepoint+1;
+ ibuf(writepoint)=ii-rows;
+ board(ii-rows)=0;
+ end
+ % end
+ end
+ % valbuf(group_index)=tscore;
+ valbuf(group_index)=c*readpoint;%+row_offset(i);
+ celbuf(group_index)=ii;
+ end
+ % end
+ end
+ new_cell_list=celbuf(1:group_index);
+ new_value_list=valbuf(1:group_index);
+ new_mask=new_mask_l;
end
+
+ function B=ProcessMove(B,dj,y)
+ % R=size(B,1);
+ B(y)=0;
+ col=ceil(y/rows);
+ minCol=col;maxCol=col;
+ while dj(y)~=y
+ y=dj(y);
+ B(y)=0;
+ col=ceil(y/rows);
+ minCol=min(minCol, col);
+ maxCol=max(maxCol, col);
+ end;
+ for ip=minCol:maxCol,
+ kp=B(B(:,ip)>0,ip);
+ B(:,ip)=0;B(rows-numel(kp)+1:rows,ip)=kp;
end
end
+
+ function [swapmv,outboard]=CheckForSwap(board)
+ [rows cols]=size(board);
+ swapper=[-1 rows 1 -rows];
+ lentmp=rows*cols;
+ swapmv=zeros(1,3);
+ outboard=board;
+ maxswap=0;
+ list=find(board~=0)';
+ nList=numel(list);
+ for kc=1:nList
+ jj=list(kc);
+ for swapdir=1:4
+ np=jj+swapper(swapdir);
+ if np>0 && np<=lentmp && board(np)>0 && board(np)~=board(jj)
+ tboard=DoSwap(board,jj,np);
+ [s_ceil,s_value]=CalculateMoves(tboard);
+ if (~isempty(s_value))
+ if (max(s_value)> maxswap)
+ maxswap=max(s_value);
+ idxq=jj;idxr=swapdir;idxs=np;
+ end
+ else
+ for k2=max(1,kc-20):min(nList,kc+20)
+ jj2=list(k2);
+ for swapdir2=1:4
+ np2=jj2+swapper(swapdir2);
+ if np2>0 && np2<=lentmp && tboard(np2)>0 && tboard(np2)~=tboard(jj2)
+ tboard2=DoSwap(tboard,jj2,np2);
+ [s_ceil2,s_value2,s_mask2]=CalculateMoves(tboard2);
+ if (~isempty(s_value2) && max(s_value2)>maxswap)
+ isok=false;
+ [s_max,s_idx]=max(s_value2);
+ Y=s_ceil2(s_idx);
+ while (s_mask2(Y)~=Y)
+ Y = s_mask2(Y);
+ if (Y==np || Y==jj)
+ isok=true;
+ end
+ end
+ if (Y==np || Y==jj)
+ isok=true;
+ end
+ if (isok)
+ maxswap=max(s_value2);
+ idxq=jj;idxr=swapdir;idxs=np;
+ end
+ end
+ end
+ end
+ end
+ end
+ end
+ end
end
+ if (maxswap>0)
+ swapmv = [mod(idxq-1,rows),ceil(idxq/rows)-1,idxr];
+ outboard=DoSwap(board,idxq,idxs);
end
end
+
+ function board = DoSwap(board,el1,el2)
+ board([el1,el2]) = board([el2,el1]);
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
|