90 lines
2.2 KiB
C++
Executable File
90 lines
2.2 KiB
C++
Executable File
//
|
|
// Created by mpapa on 05.12.2017.
|
|
//
|
|
#pragma once
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <opencv2/highgui/highgui.hpp>
|
|
#include <opencv2/imgproc/imgproc.hpp>
|
|
|
|
#include "../functions/AbstractionLayers/Layer1/AbstractionLayer_1.h"
|
|
#include "../functions/AbstractionLayers/DestructionPower/DestructionPower.h"
|
|
|
|
using namespace std;
|
|
|
|
class LogEntry
|
|
{
|
|
public:
|
|
qualityVector PieceCollector;
|
|
int abstractionLevel;
|
|
coor myCoor;
|
|
|
|
void advance(){abstractionLevel++;}
|
|
void Set(){set=1;}
|
|
bool isSet(){return set;}
|
|
void advanceRandomed() { randomed++;}
|
|
void decreaseRandomed() { randomed--;}
|
|
int hasRandomed(){return randomed;}
|
|
|
|
explicit LogEntry(coor newCoor = coor(0,0)): myCoor(newCoor){
|
|
abstractionLevel=-1;
|
|
set=false;
|
|
}
|
|
private:
|
|
bool set;
|
|
static int randomed;
|
|
};
|
|
|
|
class Puzzle
|
|
{
|
|
public:
|
|
|
|
Puzzle(unsigned int newcols,unsigned int newrows):cols(newcols),rows(newrows) {}
|
|
|
|
bool PreProcessing()
|
|
{
|
|
createBox(); createp_box();
|
|
dp.PreProcessing({cols,rows}, nullptr);
|
|
a1.PreProcessing({cols,rows}, &p_myBox);
|
|
return true;
|
|
}
|
|
|
|
coor getSizeAsCoor() {return {cols,rows};}
|
|
|
|
DestructionPower dp;
|
|
AbstractionLayer_1 a1;
|
|
|
|
void removeConstrains(coor removeCoordinates);
|
|
void setConstraints(coor setConstraints, Part *constraintPiece);
|
|
void printPuzzle();
|
|
void printBox();
|
|
|
|
void createRandomBox(){createRandomPuzzle();putIntoBox();shuffle();createp_box();}
|
|
void createRandomPuzzle();
|
|
void putIntoBox();
|
|
void shuffle();
|
|
void createBox();
|
|
void createp_box();
|
|
|
|
bool allSet();
|
|
|
|
vector<Part> myBox;
|
|
vector<Part*> p_myBox;
|
|
|
|
qualityVector combinedQualityVector;
|
|
|
|
private:
|
|
|
|
unsigned int cols;
|
|
unsigned int rows;
|
|
};
|
|
|
|
bool next(vector<LogEntry>& log,Puzzle& puzzleMat);
|
|
coor calculateNextCoor(vector<LogEntry>& log, Puzzle& puzzleMat);
|
|
void solve(vector<LogEntry>& log, Puzzle& puzzleMat);
|
|
void setsolution(vector<LogEntry>& log, Puzzle& puzzleMat);
|
|
bool backtrack(vector<LogEntry>& log,Puzzle& puzzleMat);
|
|
|
|
void createNextLogElement(vector<LogEntry>& log,Puzzle& puzzleMat);
|
|
|