273 lines
8.0 KiB
C++
273 lines
8.0 KiB
C++
void status(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat);
|
|
|
|
|
|
bool next(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//status(log,p_Box,puzzleMat);
|
|
//log not yet started
|
|
if(!(log.size()))
|
|
{
|
|
//cout << "creating new log" << endl;
|
|
log.push_back(LogEntry());
|
|
log.back().myCoor = calculateFirstCoor(log, p_Box, puzzleMat);
|
|
solve(log, p_Box,puzzleMat);
|
|
}
|
|
|
|
//last log element is set, create new log element
|
|
else if(log.back().isSet())
|
|
{
|
|
if(!(p_Box.size()))
|
|
{
|
|
cout << "box done" << endl;
|
|
return 0;
|
|
}
|
|
log.push_back(LogEntry());
|
|
log.back().myCoor = calculateNextCoor(log, p_Box, puzzleMat);
|
|
solve(log, p_Box,puzzleMat);
|
|
}
|
|
|
|
//last log element is empty, backtrack
|
|
else if(!(log.back().PieceCollector.size()))
|
|
{
|
|
//cout << "backtracking" << endl;
|
|
backtrack(log,p_Box,puzzleMat);
|
|
}
|
|
|
|
//case last log element has multiple entries
|
|
else if(log.back().PieceCollector.size() > 1)
|
|
{
|
|
//is not yet max abstracted
|
|
if(log.back().abstractionLevel < MAX_ABSTRAX)
|
|
{
|
|
//cout << "advancing abstraction layer" << endl;
|
|
log.back().advance();
|
|
solve(log,p_Box,puzzleMat);
|
|
}
|
|
//no more layers, pick first
|
|
else
|
|
{
|
|
//cout << "setting first as solution" << endl;
|
|
log.back().advanceRandomed();
|
|
setsolution(log,p_Box,puzzleMat);
|
|
}
|
|
}
|
|
|
|
//case last log exactly one solution
|
|
else if(log.back().PieceCollector.size() == 1)
|
|
{
|
|
//cout << "exactly one solution" << endl;
|
|
if(log.back().hasRandomed())
|
|
{
|
|
if(log.back().abstractionLevel < MAX_ABSTRAX)
|
|
{
|
|
//cout << "advancing abstraction layer" << endl;
|
|
log.back().advance();
|
|
solve(log,p_Box,puzzleMat);
|
|
}
|
|
else
|
|
{
|
|
//cout << "setting as solution bec fit" << endl;
|
|
setsolution(log,p_Box,puzzleMat);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
//cout << "setting as solution bec trivial" << endl;
|
|
setsolution(log,p_Box,puzzleMat);
|
|
}
|
|
}
|
|
//cout << "next" << endl;
|
|
if(log.back().myCoor.n>8)
|
|
{
|
|
cout << "m: " << log.back().myCoor.m << " n: " << log.back().myCoor.n << endl;
|
|
// status(log,p_Box,puzzleMat);
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
|
|
coor calculateFirstCoor(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//returns coor of first piece
|
|
coor firstCoor(0,0);
|
|
return firstCoor;
|
|
}
|
|
|
|
coor calculateNextCoor(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//level 1:
|
|
//go left to right, then increase current row
|
|
int m= log.rbegin()[1].myCoor.m;
|
|
int n= log.rbegin()[1].myCoor.n;
|
|
if(m<puzzleMat.getCols()-1) m++;
|
|
else if(n<puzzleMat.getRows()-1){ m=0; n++;}
|
|
else return coor();
|
|
|
|
;
|
|
return coor(m,n);
|
|
//return nextCoor;
|
|
}
|
|
|
|
void solve(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//status(log,p_Box,puzzleMat);
|
|
switch(log.back().abstractionLevel)
|
|
{
|
|
//abstraction layer = 0
|
|
//go to abstraction layer 0 solver
|
|
case 0:
|
|
abstractionlayer0solver(log,p_Box,puzzleMat);
|
|
break;
|
|
|
|
//abstraction layer = 1
|
|
//go to abstraction layer 1 solver
|
|
case 1:
|
|
abstractionlayer1solver(log,p_Box,puzzleMat);
|
|
break;
|
|
|
|
default:
|
|
break;
|
|
}
|
|
//status(log,p_Box,puzzleMat);
|
|
}
|
|
|
|
void abstractionlayer0solver(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//throw all remaining puzzle pieces into newest log
|
|
for(int i=0;i<p_Box.size();i++)
|
|
log.back().PieceCollector.push_back(p_Box[i]);
|
|
}
|
|
|
|
void abstractionlayer1solver(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//remove all that do not fit according to abstraction layer 0
|
|
for(int i=0;i<(log.back().PieceCollector.size());)
|
|
{
|
|
//TODO: change checker from checking every box piece to only checking the simplifyed version ob the box with abstraction layer one
|
|
if(!(puzzleMat.testRotationPiece(log.back().myCoor.m, log.back().myCoor.n, *(log.back().PieceCollector[i]))))
|
|
{
|
|
log.back().PieceCollector.erase(log.back().PieceCollector.begin()+i);
|
|
}
|
|
else
|
|
i++; //otherwise loop stops before end!
|
|
}
|
|
//for(int i=0;i<log.back().PieceCollector.size();i++)
|
|
//{
|
|
// (*(log.back().PieceCollector[i])).printPiece();
|
|
// cout << endl;
|
|
//}
|
|
}
|
|
|
|
void setsolution(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//remove first element in last logelement from box
|
|
for(int i=0;i<p_Box.size();)
|
|
if(p_Box[i]==log.back().PieceCollector[0])
|
|
p_Box.erase(p_Box.begin()+i);
|
|
else
|
|
i++;
|
|
|
|
//turn piece until it fits and then set element into matrix
|
|
if(puzzleMat.testRotationPiece(log.back().myCoor.m, log.back().myCoor.n,*(log.back().PieceCollector[0])))
|
|
puzzleMat.setPiece(log.back().myCoor.m, log.back().myCoor.n, *(log.back().PieceCollector[0]));
|
|
else
|
|
{
|
|
cout << "fatal error, wrong piece saved" << endl;
|
|
exit;
|
|
}
|
|
//tell log entry that it is set
|
|
log.back().Set();
|
|
|
|
}
|
|
|
|
bool backtrack(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
//following possibilities:
|
|
//last log entry empty
|
|
//delete last log + backtrack
|
|
|
|
if(!(log.back().PieceCollector.size()))
|
|
{
|
|
//cout << "none" << endl;
|
|
puzzleMat.removePiece(log.back().myCoor.m, log.back().myCoor.n);
|
|
log.pop_back();
|
|
//status(log,p_Box,puzzleMat);
|
|
backtrack(log,p_Box,puzzleMat);
|
|
return 1;
|
|
}
|
|
|
|
//last log entry only one solution
|
|
//delete last logd put back into box + backtrack
|
|
else if((log.back().PieceCollector.size())==1)
|
|
{
|
|
//cout << "one" << endl;
|
|
p_Box.push_back(log.back().PieceCollector[0]);
|
|
//shuffleup
|
|
random_shuffle(p_Box.begin(),p_Box.end());
|
|
puzzleMat.removePiece(log.back().myCoor.m, log.back().myCoor.n);
|
|
log.pop_back();
|
|
//cout << "removed" << endl;
|
|
//status(log,p_Box,puzzleMat);
|
|
backtrack(log,p_Box,puzzleMat);
|
|
return 1;
|
|
}
|
|
//last log entry multiple solutions (and current one was randomed)
|
|
//delete randomed piece from PieceCollector and go to next (which might random again depending on function)
|
|
else if((log.back().PieceCollector.size())>1)
|
|
{
|
|
//cout << "multiple" << endl;
|
|
p_Box.push_back(log.back().PieceCollector[0]);
|
|
//shuffleup
|
|
random_shuffle(p_Box.begin(),p_Box.end());
|
|
log.back().PieceCollector.erase(log.back().PieceCollector.begin());
|
|
|
|
if(log.back().PieceCollector.size()==1)
|
|
log.back().decreaseRandomed();
|
|
|
|
//cout << "erased first element" << endl;
|
|
//status(log,p_Box,puzzleMat);
|
|
setsolution(log,p_Box,puzzleMat);
|
|
return 1;
|
|
//no need to remove from puzzle mat, as sersolution overwrites it anyway
|
|
}
|
|
else
|
|
return 0;
|
|
|
|
}
|
|
|
|
void status(vector<LogEntry>& log, vector<PuzzlePiece*>& p_Box, Puzzle& puzzleMat)
|
|
{
|
|
cout << "----------------------------" << endl;
|
|
cout << "status:" << endl;
|
|
cout << "hasrandomed: " << log[0].hasRandomed() << endl;
|
|
for(int i=0;i<log.size();i++)
|
|
{
|
|
cout << "log #" << i << ":" << endl;
|
|
cout << "piecenr " << log[i].PieceCollector.size() << endl;
|
|
if(log[i].isSet())
|
|
cout << "isset: 1" << endl;
|
|
else
|
|
cout << "isset: 0" << endl;
|
|
|
|
//cout << "Abstraction: " << log[i].abstractionLevel << endl;
|
|
//cout << "m: " << log[i].myCoor.m << " n: " << log[i].myCoor.n << endl;
|
|
/*for(int j=0;j<log[i].PieceCollector.size();j++)
|
|
{
|
|
(*(log[i].PieceCollector[j])).printPiece();
|
|
cout << endl;
|
|
}*/
|
|
}
|
|
|
|
cout << endl;
|
|
cout << "Box:" << endl;
|
|
cout << "size: " << p_Box.size() << endl;
|
|
for(vector<PuzzlePiece*>::iterator i = p_Box.begin();i!=p_Box.end();i++)
|
|
{
|
|
(*(*i)).printPiece();
|
|
cout << endl;
|
|
}
|
|
|
|
cout << "Puzzle:" << endl;
|
|
puzzleMat.printPuzzle();
|
|
cout << "----------------------------" << endl;
|
|
} |