英语翻译#include int map[9][9]={0,0,3,8,1,0,0,0,9,5,0,0,4,0,0,0,8,0,0,6,0,9,0,0,1,0,0,0,0,8,0,3,0,0,0,6,0,0,0,0,0,0,0,0,0,9,0,0,6,0,0,5,0,0,0,0,6,0,0,9,0,1,0,0,1,0,0,0,5,0,0,4,2,0,0,0,4,8,7,0,0}; void display() { int i; int j; for(i=0;i

英语翻译#include int map[9][9]={0,0,3,8,1,0,0,0,9,5,0,0,4,0,0,0,8,0,0,6,0,9,0,0,1,0,0,0,0,8,0,3,0,0,0,6,0,0,0,0,0,0,0,0,0,9,0,0,6,0,0,5,0,0,0,0,6,0,0,9,0,1,0,0,1,0,0,0,5,0,0,4,2,0,0,0,4,8,7,0,0}; void display() { int i; int j; for(i=0;i
英语翻译
#include
int map[9][9]={0,0,3,8,1,0,0,0,9,
5,0,0,4,0,0,0,8,0,
0,6,0,9,0,0,1,0,0,
0,0,8,0,3,0,0,0,6,
0,0,0,0,0,0,0,0,0,
9,0,0,6,0,0,5,0,0,
0,0,6,0,0,9,0,1,0,
0,1,0,0,0,5,0,0,4,
2,0,0,0,4,8,7,0,0};
void display()
{
int i;
int j;
for(i=0;i

英语翻译#include int map[9][9]={0,0,3,8,1,0,0,0,9,5,0,0,4,0,0,0,8,0,0,6,0,9,0,0,1,0,0,0,0,8,0,3,0,0,0,6,0,0,0,0,0,0,0,0,0,9,0,0,6,0,0,5,0,0,0,0,6,0,0,9,0,1,0,0,1,0,0,0,5,0,0,4,2,0,0,0,4,8,7,0,0}; void display() { int i; int j; for(i=0;i
仅仅在你的基础上改了一下,主要是小心递归不退出的情况.
function sudoku
map=[
0,0,3,8,1,0,0,0,9;
5,0,0,4,0,0,0,8,0;
0,6,0,9,0,0,1,0,0;
0,0,8,0,3,0,0,0,6;
0,0,0,0,0,0,0,0,0;
9,0,0,6,0,0,5,0,0;
0,0,6,0,0,9,0,1,0;
0,1,0,0,0,5,0,0,4;
2,0,0,0,4,8,7,0,0;
];
disp('The game is:');
Mydisp
disp('-------------');
flag=crack;
if flag==1
disp('OK')
end

function flag=crack
mincount=10;
ci=-1;
for i=1:9
for j=1:9
if map(i,j)
continue;
end
[count,mark]=check(i,j);
if (count==0) %无法填入数
flag=0;
return;
end
if count