我看到了一些數獨求解器的實現,但我無法弄清楚我的代碼中的問題。我有一個功能sudokusolver成爲sudoku董事會,必須返回解決sudoku板。用python跟回溯的數獨求解器
def sudokutest(s,i,j,z):
# z is the number
isiValid = np.logical_or((i+1<1),(i+1>9));
isjValid = np.logical_or((j+1<1),(j+1>9));
iszValid = np.logical_or((z<1),(z>9));
if s.shape!=(9,9):
raise(Exception("Sudokumatrix not valid"));
if isiValid:
raise(Exception("i not valid"));
if isjValid:
raise(Exception("j not valid"));
if iszValid:
raise(Exception("z not valid"));
if(s[i,j]!=0):
return False;
for ii in range(0,9):
if(s[ii,j]==z):
return False;
for jj in range(0,9):
if(s[i,jj]==z):
return False;
row = int(i/3) * 3;
col = int(j/3) * 3;
for ii in range(0,3):
for jj in range(0,3):
if(s[ii+row,jj+col]==z):
return False;
return True;
def possibleNums(s , i ,j):
l = [];
ind = 0;
for k in range(1,10):
if sudokutest(s,i,j,k):
l.insert(ind,k);
ind+=1;
return l;
def sudokusolver(S):
zeroFound = 0;
for i in range(0,9):
for j in range(0,9):
if(S[i,j]==0):
zeroFound=1;
break;
if(zeroFound==1):
break;
if(zeroFound==0):
return S;
x = possibleNums(S,i,j);
for k in range(len(x)):
S[i,j]=x[k];
sudokusolver(S);
S[i,j] = 0;
return S;
sudokutest和possibleNums是正確的,只是sudokusolver給予RecursionError
爲什麼在sudokusolver中使用S [i,j] = 0;?以及你如何用Numpy構建矩陣S [i,j]或? –
是的,有numpy,我用s [i,j] = 0來回溯,當num不是正確的時候 –
好的...然後檢查我要安裝numpy :-)讓我們來看看。要啓動你的軟件,那麼我只需要s = numpy.zeros(shape =(9,9)) sudokusolver(s),對嗎? –