奇葩初一二班吧 关注:34贴子:4,441
  • 0回复贴,共1

clear allmap = zeros(20,20);ma

只看楼主收藏回复

clear all
map = zeros(20,20);
map(1,1)=1;
px = [2,2,-2,-2,-1,-1,1,1,0];
py = [1,-1,1,-1,2,-2,2,-2,0];
horse = [7,6];
for i=1:9
map(px(i)+horse(1),py(i)+horse(2))= -1;
end
% mark control points of the hourse
for i = 1:11
for j = 1:11
if(i==1 && j==1)
continue;
elseif i == 1
map(i,j)=map(i,j-1);
elseif j == 1
map(i,j)=map(i-1,j);
elseif map(i,j)== -1
map(i,j) = 0;
else
map(i,j)=map(i-1,j)+map(i,j-1);
% dyanamic programming to conut routes
end
end
end
map(i,j)


IP属地:江苏来自Android客户端1楼2019-10-16 21:15回复