chaos_kinght_tour.m

来自「蚁群算法的C++代码和图像混沌加密解密的算法」· M 代码 · 共 24 行

% chaos and knight's tour
clear;
clc;
chessboard=[1 24 13 18 7;14 19 8 23 12; 9 2 25 6 17;20 15 4 11 22;3 10 21 16 5];
[row col]=size(chessboard);
N=30;x=zeros(1,N);
x(1)=0.6;u=4;
for i=1:N-1
    x(i+1)=u*x(i)*(1-x(i));
end
chaos=x(N-max(row,col):N);
I=reshape(1:row*col,[row col]);
I_org=I;
for i=1:row*col
    [lab_x(i) lab_y(i)]=find(chessboard==i);
end
for i=1:row
    for j=1:col
        a=fix(chaos(lab_x(i))*row)+1;b=fix(chaos(lab_x(j))*col)+1;
        P=I(i,j);I(i,j)=I(a,b);I(a,b)=P;
    end
end