void PartialSolver::solve()
{
while(!puzzles.empty())
{
Puzzle& front = puzzles.front();
///Clear points to find points for next puzzle
points.clear();
findPoints(front.puzzle);
list< pair<int,int> >::iterator it = points.begin();
for(;it!=points.end(); it++)
{
int row = (*it).first;
int col = (*it).second;
Puzzle back = Puzzle(front);
try
{
back.set(row, col, variable);
back.solve();
if(back.complete())
{
if(back.correct())
{
solved.push_back(back);
}
else
{
incorrect.push_back(back);
}
}
else
{
///If the puzzle is still partially correct continue search
if(partiallyCorrect(back))
puzzles.push_back(back);
}
} catch (bool& value) {
//incorrect.push_back(back);
}
}
puzzles.pop_front();
}
}
int main(int argc, char **argv){
int opterr,dim;
int **A,**B;
MyOpt.alg =0;
_VERB =0;
MyOpt.fileA=NULL;
MyOpt.fileB=NULL;
/* Processando parametros*/
opterr = 3;
int opcao; // Opção passada pelo usuário ao programa.
while ((opcao = getopt (argc, argv, "a:b:h")) != -1){
switch(opcao){
case 'a':
//Matriz A
MyOpt.fileA = optarg;
opterr--;
break;
case 'b':
//Matriz B
MyOpt.fileB = optarg;
opterr--;
break;
case 'v':
//Verbosidade
_VERB = atoi(optarg);
break;
case '?':
switch(optopt){
case 'a':
case 'b':
case 'v':
fprintf (stderr, "Opção '-%c' requer parametros\n", optopt);
break;
}
case 'h': /* Help */
mostra_uso(argv[0]);
exit(1);
break;
default:
/* Nao para aqui */
break;
}
}
if(opterr>0){
mostra_uso(argv[0]);
exit(1);
}
//Carregando Matriz A do arquivo
carrMatInt(MyOpt.fileA,&dim, &A);
printf("Processando Puzzle\n");
B = Puzzle(dim,&A);
gravaMatInt(MyOpt.fileB,&dim,&B);
exit(0);
}
PartialSolver::PartialSolver(const Puzzle& puzzle)
{
puzzles.push_back(Puzzle(puzzle));
number = puzzle.number;
}
int main(int argc, char *argv[]) {
// timer
struct timeval start, end;
long mtime, seconds, useconds;
gettimeofday(&start, NULL);
time_t startTime = time(0);
if (argc != 3) {
printf("wrong number of inputs\n");
exit(1);
}
int** grid = fileTo2dArray(argv[1], atoi(argv[2]));
Puzzle p = Puzzle(grid, atoi(argv[2]));
p.initialize();
/*
p->printGridDim();
p->printGrid();
p->printPreassigned();
p->printInitCandidates();
printf("start: %i, %i\n", p->getCurrentRow(), p->getCurrentCol());
while (p->nextSlot()) {
printf("nextslot: row is %i, col is %i\n", p->getCurrentRow(), p->getCurrentCol());
}
while (p->prevSlot()) {
printf("prevslot: row is %i, col is %i\n", p->getCurrentRow(), p->getCurrentCol());
}
printf("TEST: check candidates\n");
p->checkCandidates(p->getCurrentRow(), p->getCurrentCol());
printf("TEST: assign\n");
p->assign(p->getCurrentRow(), p->getCurrentCol());
printf("TEST: update neighbors\n");
p->updateNeighborConflicts(p->getCurrentRow(), p->getCurrentCol(), p->getCurrentAssigned(0, 0), true);
printf("TEST: check neighbors\n");
p->checkNeighborCandidates(p->getCurrentRow(), p->getCurrentCol());
*/
//int counter=10000;
while (!p.isSolved()) {
//while (!p->isSolved() && counter>0) {
//counter--;
if (testLevel > 0) printf("step 1: on (%i, %i)\n", p.getCurrentRow(), p.getCurrentCol());
//printf("step 1: current row %i, current col %i, %i\n", p->getCurrentRow(), p->getCurrentCol(), p->getCurrentAssigned(p->getCurrentRow(), p->getCurrentCol()));
bool hasCandidate = p.checkCandidates(p.getCurrentRow(), p.getCurrentCol(), false);
//printf("step 1\n");
// step 1
if (hasCandidate) {
//printf("step 3\n");
// step 3
bool succeeded;
if (p.assign(p.getCurrentRow(), p.getCurrentCol())) {
if (testLevel > 0)
printf("step 3: on (%i, %i), assigned %i\n", p.getCurrentRow(), p.getCurrentCol(), p.getCurrentAssigned(p.getCurrentRow(), p.getCurrentCol()));
//printf("step 3: assignment succeeded\n");
//printf("calling updateNeighborConflicts with %i, %i, %i\n", p->getCurrentRow(), p->getCurrentCol(), p->getCurrentAssigned(p->getCurrentRow(), p->getCurrentCol()));
//printf("pre-assign candidate list: \n");
//p->printInitCandidates();
// deprecated
//p->updateNeighborConflicts(p->getCurrentRow(), p->getCurrentCol(), p->getCurrentAssigned(p->getCurrentRow(), p->getCurrentCol()), true);
//printf("post-assign candidate list: \n");
//p->printInitCandidates();
//printf("step 3: updateNeighborConflicts succeeded\n");
succeeded = p.checkNeighborAssignments(p.getCurrentRow(), p.getCurrentCol());
}
else {
printf("error: reached slot with no candidates. shouldn't happen. exiting.\n");
exit(1);
}
if (succeeded) {
//printf("step 5\n");
// step 5
if (testLevel > 0) printf("step 5: next slot\n");
p.nextSlot();
p.copyCandidates(p.getCurrentRow(), p.getCurrentCol());
}
else {
//printf("step 4\n");
// step 4
if (testLevel > 0)
printf("step 4: on (%i, %i), unassigning %i\n", p.getCurrentRow(), p.getCurrentCol(), p.getCurrentAssigned(p.getCurrentRow(), p.getCurrentCol()));
//printf("pre-update candidate list: \n");
//p.printInitCandidates();
//deprecated
//p->updateNeighborConflicts(p->getCurrentRow(), p->getCurrentCol(), p->getCurrentAssigned(p->getCurrentRow(), p->getCurrentCol()), false);
//printf("post-update candidate list: \n");
//p->printInitCandidates();
p.removeAndInvalidate(p.getCurrentRow(), p.getCurrentCol());
// loops back to front
}
}
else {
//printf("step 2\n");
// step 2
if (testLevel > 0) printf("step 2: reversing slot\n");
p.resetCandidates(p.getCurrentRow(), p.getCurrentCol());
bool reversedSlot = p.prevSlot();
if (reversedSlot) {
//printf("step 4\n");
// step 4
if (testLevel > 0)
printf("step 4: on (%i, %i), unassigning %i\n", p.getCurrentRow(), p.getCurrentCol(), p.getCurrentAssigned(p.getCurrentRow(), p.getCurrentCol()));
//printf("pre-update candidate list: \n");
//p.printInitCandidates();
//deprecated
//p.updateNeighborConflicts(p.getCurrentRow(), p.getCurrentCol(), p.getCurrentAssigned(p.getCurrentRow(), p.getCurrentCol()), false);
//printf("post-update candidate list: \n");
//p.printInitCandidates();
p.removeAndInvalidate(p.getCurrentRow(), p.getCurrentCol());
// loops back to front
}
else {
//printf("step 2 failed\n");
break;
}
}
}
if (p.isSolved()) {
printf("solution found!\n");
p.printGrid();
}
else {
printf("no solution found\n");
}
//printf("deinitializing\n");
p.deinitialize();
//printf("deinitialized\n");
delete2dIntArray(grid, atoi(argv[2]));
//printf("deleted original array.\n");
//timer
double seconds_since_start = difftime( time(0), startTime);
printf("%f seconds to run program\n", seconds_since_start);
gettimeofday(&end, NULL);
seconds = end.tv_sec - start.tv_sec;
useconds = end.tv_usec - start.tv_usec;
mtime = ((seconds) * 1000 + useconds/1000.0) + 0.5;
printf("Elapsed time: %ld milliseconds\n", mtime);
}
