-
Notifications
You must be signed in to change notification settings - Fork 0
/
SudokuPuzzle.cpp
274 lines (168 loc) · 7.45 KB
/
SudokuPuzzle.cpp
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
#include "SudokuPuzzle.h"
#include <chrono>
#include <iostream>
using namespace std;
SudokuPuzzle::SudokuPuzzle(void)
{
Check_NumberGoing_IntotheLoop = false;
numberofcellsolved = 0;
//m_blockMatrix[2] = 0;
}
SudokuPuzzle::~SudokuPuzzle(void)
{
}
void SudokuPuzzle::solve(const char filenameIn[]) {
// Read puzzle from text file
readPuzzle(filenameIn);
const auto startTime = std::chrono::high_resolution_clock::now();
SolveSudoku();
//hiddensingle();
const auto endTime = std::chrono::high_resolution_clock::now();
const auto duration = (endTime - startTime).count();
// Sample timing output in nanoseconds
cout << duration << "ns" << endl;
cout << numberofcellsolved << " Cell solved"
<< std::endl;
DisplaySoduko_Solution();
}
bool SudokuPuzzle::SolveSudoku()
{
cout << "in here to solve soduko" <<endl;
while (solvepuzzle == false)
{
numberofcellsolved++;
solvepuzzle = true;
for (int rowlenght = 0; rowlenght < m_Lenght; ++rowlenght) {
for (int columnlength = 0; columnlength < m_Lenght; ++columnlength) {
if (m_cellRows[rowlenght].getCell(columnlength)->get_ReadValue() == 0) {
m_CellBlocks[Getblockindex2(rowlenght, columnlength)].SetCell(Getblockindexvalue(rowlenght, columnlength), m_cellRows[rowlenght].getCell(columnlength));
for (int j = 0; j < m_Lenght; ++j) {
if (m_cellRows[rowlenght].getCell(j)->get_ReadValue() != 0)
m_cellRows[rowlenght].getCell(columnlength)->delete_PossibleNumber(m_cellRows[rowlenght].getCell(j)->get_ReadValue());
if (m_CellColumns[columnlength].getCell(j)->get_ReadValue() != 0)
m_CellColumns[columnlength].getCell(rowlenght)->delete_PossibleNumber(m_CellColumns[columnlength].getCell(j)->get_ReadValue());
if (m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(j)->get_ReadValue() != 0)
m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(Getblockindexvalue(rowlenght, columnlength))->delete_PossibleNumber
(m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(j)->get_ReadValue());
}
if (m_cellRows[rowlenght].getCell(columnlength)->get_candidatecell_size() == 1)
if (!m_cellRows[rowlenght].getCell(columnlength)->Get__ReadValue_Validity())
m_cellRows[rowlenght].getCell(columnlength)->set_value(m_cellRows[rowlenght].getCell(columnlength)->get_candidateNumberPosition(0));
solvepuzzle = false;
}
}
}
}
return true;
};
bool SudokuPuzzle::hiddensingle()
{
while (solvepuzzle == false) {
numberofcellsolved++;
solvepuzzle = true;
for (int rowlenght = 0; rowlenght < m_Lenght; ++rowlenght) {
for (int columnlength = 0; columnlength < m_Lenght; ++columnlength) {
if (m_cellRows[rowlenght].getCell(columnlength)->get_ReadValue() == 0) {
m_CellBlocks[Getblockindex2(rowlenght, columnlength)].SetCell(Getblockindexvalue(rowlenght, columnlength), m_cellRows[rowlenght].getCell(columnlength));
solvepuzzle = false;
/*for (int i = 0; i < m_Lenght; i++)
{*/
//for (int i = 0; i < m_Lenght; ++i) {
// for row
for (int j = 0; j < m_Lenght; ++j) {
if (m_cellRows[rowlenght].getCell(j)->get_ReadValue() != 0)
m_cellRows[rowlenght].getCell(columnlength)->Search_CandidateList(m_cellRows[rowlenght].getCell(j)->get_ReadValue());
}
//////// for column
for (int j = 0; j < m_Lenght; ++j) {
if (m_CellColumns[columnlength].getCell(j)->get_ReadValue() != 0)
m_CellColumns[columnlength].getCell(rowlenght)->Search_CandidateList(m_CellColumns[columnlength].getCell(j)->get_ReadValue());
}
//////// for block
for (int j = 0; j < m_Lenght; ++j) {
if (m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(j)->get_ReadValue() != 0)
m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(Getblockindexvalue(rowlenght, columnlength))->Search_CandidateList(m_CellBlocks[Getblockindex2(rowlenght, columnlength)].getCell(j)->get_ReadValue());
}
//}
if (m_cellRows[rowlenght].getCell(columnlength)->getsizeofnewvector() == 1)
if (m_cellRows[rowlenght].getCell(columnlength)->Get__ReadValue_Validity())
m_cellRows[rowlenght].getCell(columnlength)->set_value(m_cellRows[rowlenght].getCell(columnlength)->get_candidatesecondvectorNumberPosition(0));
//solvepuzzle = false;
}
}
}
}
return false;
};
void SudokuPuzzle::readPuzzle(const char filenameIn[])
{
/*
this process reads the file in from the text file.
checks the numbers in the text files if its 0.
if its not, keep getting the row, set the column and get the block from the row and column.
*/
ifstream infile(filenameIn);
if (infile.is_open())
{
for (int rowlenght = 0; rowlenght < m_Lenght; rowlenght++) {
for (int columnlenght = 0; columnlenght < m_Lenght; columnlenght++) {
infile >> Check_NumberGoing_IntotheLoop;
if (Check_NumberGoing_IntotheLoop == 0)
{
Make_Everynumber_Inthe_LoopTrue = false;
m_cellRows[rowlenght].SetCell(columnlenght, new Cell(Check_NumberGoing_IntotheLoop, Make_Everynumber_Inthe_LoopTrue));
}
else {
Make_Everynumber_Inthe_LoopTrue = true;
m_cellRows[rowlenght].SetCell(columnlenght, new Cell(Check_NumberGoing_IntotheLoop, Make_Everynumber_Inthe_LoopTrue));
}
m_CellColumns[columnlenght].SetCell(rowlenght, m_cellRows[rowlenght].getCell(columnlenght));
// passing the block by address to a method that has a pointer to that address
//GetBoxIndex(rowlenght, columnlenght, &m_blockMatrix[0]);
//m_CellBlocks[m_blockMatrix[0]].SetCell(m_blockMatrix[1], m_cellRows[rowlenght].getCell(columnlenght));
m_CellBlocks[Getblockindex2(rowlenght, columnlenght)].SetCell(Getblockindexvalue(rowlenght, columnlenght), m_cellRows[rowlenght].getCell(columnlenght));
}
}
}
};
// https://stackoverflow.com/questions/9357408/creating-9-subarrays-from-a-9x9-2d-array-java
int SudokuPuzzle::Getblockindex2(int const row, int const column)const
{
return ((row / 3) * 3) + column / 3;
};
int SudokuPuzzle::Getblockindexvalue(int const row, int const column)const
{
return column % 3 + (row % 3) * 3;
};
// the main purpose of this is getting the first and second index of the array.
// parsing the address of the array and in the function the pointer points to the address
//
void SudokuPuzzle::GetBoxIndex(const int row, const int column, int* const PointerTo_m_blockMatrix_pointer_value_Indexof_theSingleBlock)const
{
// https://stackoverflow.com/questions/9357408/creating-9-subarrays-from-a-9x9-2d-array-java
// this is the formular to calculate for block index and block value index
const int blockindex = ((row / 3) * 3) + column / 3;
const int blockindexvalue = column % 3 + (row % 3) * 3;
// this is for the block index
PointerTo_m_blockMatrix_pointer_value_Indexof_theSingleBlock[0] = blockindex;
// block index value
PointerTo_m_blockMatrix_pointer_value_Indexof_theSingleBlock[1] = blockindexvalue ;
};
void SudokuPuzzle::DisplaySoduko_Solution()const
{
// This is to output the file to the textfile
ofstream output("sudoku_solution.txt");
// this checks while the file is still open
while (output.is_open())
{
for (int i = 0; i < m_Lenght; i++) {
for (int j = 0; j < m_Lenght; j++) {
// keep getting the cell row and it's value to output.
output << m_cellRows[i].getCell(j)->get_ReadValue() << " ";
}
output << endl;
}
// close the file after no value in it.
output.close();
}
};