2017-11-19 17:52:02 +01:00
|
|
|
#define MAX_ABSTRAX 1
|
2017-11-19 22:53:00 +01:00
|
|
|
#define structdebug
|
2017-11-18 22:48:40 +01:00
|
|
|
|
2017-11-17 22:10:36 +01:00
|
|
|
|
2017-11-19 23:03:11 +01:00
|
|
|
#include "header.h"
|
|
|
|
#include "../Codicil/test_puzzle_long40x40.h"
|
2017-11-18 22:48:40 +01:00
|
|
|
|
|
|
|
|
2017-11-17 22:10:36 +01:00
|
|
|
int main()
|
|
|
|
{
|
2017-11-18 22:48:40 +01:00
|
|
|
|
2017-11-28 21:35:49 +01:00
|
|
|
int cols=4, rows=4;
|
2017-11-18 22:48:40 +01:00
|
|
|
//some basic part stuff
|
2017-11-17 22:10:36 +01:00
|
|
|
vector<Part> myFirstPuzzle;
|
|
|
|
Part myFirstPart;
|
|
|
|
myFirstPart.setConnections(0b00101000);
|
|
|
|
myFirstPuzzle.push_back(myFirstPart);
|
2017-11-18 22:48:40 +01:00
|
|
|
|
|
|
|
//some basic random puzzle stuff
|
2017-11-19 17:52:02 +01:00
|
|
|
randomBox myRandomBox(cols,rows);
|
|
|
|
myRandomBox.createRandomPuzzle();
|
|
|
|
vector<PuzzlePiece> myFirstBox = myRandomBox.shuffle();
|
2017-11-18 22:48:40 +01:00
|
|
|
|
2017-11-19 23:03:11 +01:00
|
|
|
//undo everything and make this puzzle fucking imba hard!!!
|
|
|
|
//need 40x40 for this, so check your status
|
2017-11-21 16:05:38 +01:00
|
|
|
|
2017-11-22 16:06:23 +01:00
|
|
|
//makehard4040puzzle(myFirstBox);
|
2017-11-18 22:48:40 +01:00
|
|
|
|
|
|
|
//some advanced solver stuff
|
|
|
|
vector<LogEntry> log;
|
|
|
|
vector<PuzzlePiece*> p_myFirstBox;
|
2017-11-19 17:52:02 +01:00
|
|
|
|
2017-11-21 11:19:51 +01:00
|
|
|
//BoxClassify myFirstBox();
|
2017-11-19 23:03:11 +01:00
|
|
|
|
2017-11-19 22:53:00 +01:00
|
|
|
cout << "original puzzle: " << endl;
|
|
|
|
myRandomBox.printPuzzle();
|
|
|
|
cout << endl;
|
2017-11-18 22:48:40 +01:00
|
|
|
for(int i=0;i<myFirstBox.size();i++)
|
2017-11-19 22:53:00 +01:00
|
|
|
p_myFirstBox.push_back(&myFirstBox[i]);
|
2017-11-18 22:48:40 +01:00
|
|
|
Puzzle puzzleMat(cols, rows);
|
|
|
|
|
2017-11-21 11:19:51 +01:00
|
|
|
//vector<vector<PuzzlePiece*>> ab1class = abstractionLayer1classify(log, p_myFirstBox,puzzleMat);
|
2017-11-28 21:35:49 +01:00
|
|
|
for(int i=0;i<myFirstBox.size();i++)
|
|
|
|
cout << (*p_myFirstBox[i]).getShift() << endl;
|
2017-11-18 22:48:40 +01:00
|
|
|
while(next(log, p_myFirstBox,puzzleMat));
|
2017-11-19 22:53:00 +01:00
|
|
|
|
|
|
|
puzzleMat.printPuzzle();
|
2017-11-17 22:10:36 +01:00
|
|
|
}
|