48 |
if (m_blocked == true) |
if (m_blocked == true) |
49 |
return false; |
return false; |
50 |
for (int col=0; col<m_size; col++) { |
for (int col=0; col<m_size; col++) { |
51 |
|
|
52 |
if (checkCols(row,col) == true && |
if (checkCols(row,col) == true && |
53 |
checkCross1(row,col) == true && |
checkCross1(row,col) == true && |
54 |
checkCross2(row,col) == true) { |
checkCross2(row,col) == true) |
55 |
|
{ |
56 |
|
|
57 |
|
|
58 |
m_solution->setMatrix(row,col,true); |
m_solution->setMatrix(row,col,true); |
59 |
|
|
60 |
if (row == (m_size-1) ) { |
if (row == (m_size-1) ) |
61 |
|
{ |
62 |
if (!findAll) |
if (!findAll) |
63 |
return true; |
return true; |
64 |
else { |
else |
65 |
|
{ |
66 |
m_solutions->addSolution( m_solution->copy() ); |
m_solutions->addSolution( m_solution->copy() ); |
67 |
m_parent->foundSolution(); |
m_parent->foundSolution(); |
68 |
} |
} |