Sudoku/main.cpp at master · werag55/Sudoku · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <iostream>
#include <chrono>

#include "Sudoku.h"
#include "PencilMarkStrategy.h"

#include "BackTracingStrategy.h"
#include "EfficiencyTests.h"
#include "GeneticAlgorithmStrategy.h"
#include "GeneticAlgorithmBuilder.h"

void PrintDuration(std::chrono::microseconds duration) {
	auto minutes = std::chrono::duration_cast<std::chrono::minutes>(duration);
	duration -= minutes;
	auto seconds = std::chrono::duration_cast<std::chrono::seconds>(duration);
	duration -= seconds;
	auto milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(duration);
	duration -= milliseconds;
	auto microseconds = std::chrono::duration_cast<std::chrono::microseconds>(duration);

	std::cout << "Duration: "
		<< minutes.count() << ":"
		<< seconds.count() << ":"
		<< milliseconds.count() << "."
		<< microseconds.count() << std::endl;
}

int main(int argc, char* argv[])
{
	srand(static_cast<unsigned int>(time(nullptr)));


	Sudoku sudoku4 = Sudoku(3, new int[81] {
		0, 1, 0, 6, 0, 4, 3, 0, 7,
		3, 5, 6, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 5, 3, 6, 9, 0,
		0, 8, 3, 2, 6, 0, 4, 0, 9,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		4, 0, 5, 0, 7, 8, 2, 6, 0,
		0, 4, 2, 5, 3, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 7, 2, 4,
		7, 0, 9, 4, 0, 2, 0, 8, 0,
		});

	Sudoku sudoku = Sudoku(3, new int[81] {0, 8, 0, 0, 0, 0, 0, 9, 0,
		0, 0, 7, 5, 0, 2, 8, 0, 0,
		6, 0, 0, 8, 0, 7, 0, 0, 5,
		3, 7, 0, 0, 8, 0, 0, 5, 1,
		2, 0, 0, 0, 0, 0, 0, 0, 8,
		9, 5, 0, 0, 4, 0, 0, 3, 2,
		8, 0, 0, 1, 0, 4, 0, 0, 9,
		0, 0, 1, 9, 0, 3, 6, 0, 0,
		0, 4, 0, 0, 0, 0, 0, 2, 0, });

	Sudoku sudoku3 = Sudoku(3, new int[81] {0, 0, 6, 0, 0, 0, 0, 0, 0,
		0, 8, 0, 0, 5, 4, 2, 0, 0,
		0, 4, 0, 0, 9, 0, 0, 7, 0,
		0, 0, 7, 9, 0, 0, 3, 0, 0,
		0, 0, 0, 0, 8, 0, 4, 0, 0,
		6, 0, 0, 0, 0, 0, 1, 0, 0,
		2, 0, 3, 0, 0, 0, 0, 0, 1,
		0, 0, 0, 5, 0, 0, 0, 4, 0,
		0, 0, 8, 3, 0, 0, 5, 0, 2, });

	Sudoku sudoku2 = Sudoku(3, new int[81] {0, 0, 2, 0, 0, 0, 0, 0, 0,
		0, 0, 3, 0, 1, 0, 0, 0, 6,
		0, 4, 0, 0, 2, 0, 0, 3, 0,
		1, 0, 0, 0, 0, 3, 0, 0, 9,
		0, 0, 5, 0, 0, 0, 4, 0, 0,
		2, 0, 0, 6, 0, 0, 0, 0, 8,
		0, 9, 0, 0, 7, 0, 0, 4, 0,
		7, 0, 0, 0, 8, 0, 5, 0, 0,
		0, 0, 0, 0, 0, 0, 3, 0, 0, });

	//{0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0,
	//0, 0, 0, 0, 0, 0, 0, 0, 0, }

	//sudoku2.Print();

	GeneticAlgorithmTester tester(sudoku4, "result.txt");
	tester.Config();
	tester.runTests();
}