Repository navigation
Expand file tree
/
Copy pathfunctions.php
More file actions
356 lines (315 loc) · 11.6 KB
/
Copy pathfunctions.php
File metadata and controls
356 lines (315 loc) · 11.6 KB
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
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
<?php
// LOAD THE FILE REQUESTED AND PREPARES THE DATA
function loadFile($argc, $fileName, &$listaPiezas, &$width, &$height) {
$listaPiezas = array();
if (isset($argc)) {
if($argc == 2) {
$contador = 0;
$archivo = fopen($fileName . ".txt", "r") or die("No se ha podido abrir el archivo");
while(!feof($archivo)) {
$linea = fgets($archivo);
if($contador == 0) {
$aux = explode(" ", $linea);
$width = (int) $aux[0];
$height = (int) $aux[1];
$contador++;
}
else {
if(trim($linea) != '') {
$linea = str_replace(PHP_EOL,"",$linea);
$aux = explode(" ", $linea);
for($i = 0; $i < count($aux); $i++) {
$listaPiezas[$contador][$i] = $aux[$i];
}
$contador++;
}
}
}
fclose($archivo);
}
else {
echo "No se han pasado los argumentos necesarios\n";
}
}
else {
echo "argc and argv están deshabilitados\n";
}
}
// ROTATES THE GIVEN PIECE BY 90 DEGREES AND RETURNS IT
function rotate ($var) {
$aux = $var;
for($i = 0; $i < count($aux); $i++) {
if($i + 1 >= count(($aux))) {
$aux[$i] = $var[0];
}
else {
$aux[$i] = $var[$i + 1];
}
}
return $aux;
}
// CHECK THE PIECE GIVEN AND RETURNS 2 IF ITS A CORNER, 1 IF ITS A BORDER AND 0 IF ITS EITHER OF BOTHS
function checkTypePiece($piece) {
$contador = 0;
foreach($piece as $v) {
if($v == 0){
$contador++;
}
}
return $contador;
}
// CHECK IF THE PIECES IS IN THE CORRECT ROTATION GIVEN A TWO DIMENSIONAL POINT (X, Y) AND RETURNS TRUE IF IT IS, IF NOT, RETURNS FALSE
function checkIfPieceInCorrectRotation($x, $y, $width, $height, $numCorners, $piece) {
if($numCorners == 3) {
if($height == 1) {
if($x == 0 || $x == $width - 1) {
return true;
}
}
if($width == 1) {
if($y == 0 || $y == $height - 1) {
return true;
}
}
}
else if($numCorners == 2) {
if($x == 0 && $y == 0){
if($piece[0] == 0 && $piece[1] == 0){
return true;
}
}
if($x == $width - 1 && $y == 0){
if($piece[1] == 0 && $piece[2] == 0){
return true;
}
}
if($x == 0 && $y == $height - 1){
if($piece[3] == 0 && $piece[0] == 0){
return true;
}
}
if($x == $width - 1 && $y == $height - 1){
if($piece[2] == 0 && $piece[3] == 0){
return true;
}
}
if($height == 1) {
if($piece[1] == 0 && $piece[3] == 0) {
return true;
}
}
if($width == 1) {
if($piece[0] == 0 && $piece[2] == 0) {
return true;
}
}
}
else if($numCorners == 1) {
if($y != 0 && $y != $height - 1 && $x == 0) {
if($piece[0] == 0){
return true;
}
}
if($x != 0 && $x != $width - 1 && $y == 0) {
if($piece[1] == 0){
return true;
}
}
if($y != 0 && $y != $height - 1 && $x == $width - 1) {
if($piece[2] == 0){
return true;
}
}
if($x != 0 && $x != $width - 1 && $y == $height - 1) {
if($piece[3] == 0){
return true;
}
}
}
else {
return true;
}
return false;
}
// CHECK WHAT TYPE OF PIECE IS NEEDED IN THE COORDINATES GIVEN (TYPES OF PIECE EXPLAINED IN FUNCTION ROTATE)
function checkWhatPieceNeeded($x, $y, $width, $height) {
if(($height == 1 && ($x == 0 || $x == $width - 1)) || ($width == 1 && ($y == 0 || $y == $height - 1))){
echo "entra";
return 3;
}
if((($x == $width - 1 || $x == 0) && ($y == 0 || $y == $height - 1))){
return 2;
}
if(($x != 0 && $x != $width - 1 && ($y == 0 || $y == $height - 1)) || ($y != 0 && $y != $height - 1 && ($x == 0 || $x == $width - 1))) {
return 1;
}
return 0;
}
// CHECK IF THE PIECE IS CORRECTLY ROTATED RESPECT THE OTHER PIECES SURROINDING IT
function checkIfCorrectRotationRespectOthers($x, $y, $lista, $numI, $numA, $p) {
if($y != 0) {
if($lista[$numA][3] != $p[1]) {
return false;
}
}
if($x != 0) {
if($lista[$numI][2] != $p[0]) {
return false;
}
}
return true;
}
// THIS METHOD PREPARES THE DATA NEEDED TO START THE MAIN ALGORITHM
function startProcess($argc, $fileName) {
// ARRAY OF THE PIECES THAT ARE CONTAIN IN THE .TXT
$listaPiezas = array();
// WIDTH OF THE PUZZLE
$width = 0;
// HEIGHT OF THE PUZZLE
$height = 0;
// LOAD VARIABLE LISTAPIEZAS AND TAMANYO
loadFile($argc, $fileName, $listaPiezas, $width, $height);
// ARRAY OF BOOLEANS TO CHECK IF THE PIECE HAS BEEN USED
$listaProbados = array_fill(1, count($listaPiezas), false);
// ARRAY THAT WILL CONTAIN THE REARRANGE PIECES THAT WILL BE USED TO SOLVE THE PUZZLE IN ORDER OF THE PUZZLE
$listaAuxiliar = array();
// ARRAY THAT WILL CONTAIN THE INDEXES OF THE PIECES THAT WILL BE USED TO SOLVE THE PUZZLE IN ORDER OF THE PUZZLE
$listaIndices = array();
$resultado = "";
// THIS METHOD INITIALIZE WITH THE CORNER BORDER OF THE PUZZLE WITH THE COORDINATES (0,0) X = 0, Y = 0
// THE PIECE SELECTED IS THE FIRST PIECE FOUND THAT MEETS THE SPECIFICATIONS
// IT STARTS WITH A PIECE THAT WILL BE STATIC TO AVOID THE APPEAREANCE OF EQUAL SOLUTIONS BUT IN DIFFERENT ROTATION
// IF THE PUZZLE WIDTH AND HEIGHT ARE NOT EQUAL, ITS A RECTANGULAR PUZZLE. THIS MEANS THAT THE CORNER PIECE STABLISHED TO BE STATIC COULD BE WRONG PLACED
// TO AVOID THIS PROBLEM, IF THE WIDTH AND HEIGHT ARE NOT EQUAL, THE LOOP THAT CHECKS FOR CORNERS CONTINUES
for($i = 1; $i <= count($listaPiezas); $i++) {
$p = $listaPiezas[$i];
$n = checkTypePiece($p);
if($n == 2 || $n == 3) {
while(!checkIfPieceInCorrectRotation(0, 0, $width, $height, $n, $p)) {
$p = rotate($p);
}
array_push($listaAuxiliar, $p);
array_push($listaIndices, $i);
$listaProbados[$i] = true;
$xActual = 1;
$yActual = 0;
if($width == 1) {
$xActual = 0;
$yActual = 1;
}
$resultado = generatePuzzle($listaAuxiliar, $listaProbados, $listaIndices, $listaPiezas, $xActual, $yActual, $width, $height, "");
if($width == $height) {
break;
}
else {
if($resultado != "") {
break;
}
array_pop($listaAuxiliar);
array_pop($listaIndices);
$listaProbados[$i] = false;
}
}
}
// STARTS THE GENERATION OF THE POSSIBLE PUZZLES
return $resultado;
}
// THIS IS THE MAIN METHOD, SEARCHES RECURSIVELY ALL THE POSSIBLE CONVINATIONS AND RETURNS A STRING WITH ALL THE POSSIBLE ANSWERS
function generatePuzzle($lista, $probados, $indices, $listaPiezas, $x, $y, $width, $height, $resultado) {
if(count($lista) == $width * $height) {
if(count(array_unique($probados)) === 1) {
$cont = 0;
foreach($indices as $i) {
if($cont % $width == 0) {
$resultado .= "\n";
}
$resultado .= $i . " ";
$cont++;
}
$resultado = $resultado . "\n";
return $resultado;
}
else {
return $resultado;
}
}
else {
$numCornersNeeded = checkWhatPieceNeeded($x, $y, $width, $height);
for($j = 1; $j <= count($listaPiezas); $j++) {
$p = $listaPiezas[$j];
if(checkTypePiece($p) == $numCornersNeeded && !$probados[$j]) {
if($numCornersNeeded == 0) {
for($i = 0; $i < 4; $i++) {
if(checkIfCorrectRotationRespectOthers($x, $y, $lista, count($lista) - 1, count($lista) - $width, $p)) {
array_push($lista, $p);
array_push($indices, $j);
$probados[$j] = true;
$auxx = $x + 1;
$auxy = $y;
if($auxx == $width) {
$auxx = 0;
$auxy++;
}
$resultado = generatePuzzle($lista, $probados, $indices, $listaPiezas, $auxx, $auxy, $width, $height, $resultado);
array_pop($lista);
array_pop($indices);
$probados[$j] = false;
}
$p = rotate($p);
}
}
else {
while(!checkIfPieceInCorrectRotation($x, $y, $width, $height, $numCornersNeeded, $p)) {
$p = rotate($p);
}
// echo " DESPUES: " . implode($p) . "\n";
if(checkIfCorrectRotationRespectOthers($x, $y, $lista, count($lista) - 1, count($lista) - $width, $p)){
// echo "ENTRA\n";
array_push($lista, $p);
array_push($indices, $j);
$probados[$j] = true;
$auxx = $x + 1;
$auxy = $y;
if($auxx == $width) {
$auxx = 0;
$auxy++;
}
$resultado = generatePuzzle($lista, $probados, $indices, $listaPiezas, $auxx, $auxy, $width, $height, $resultado);
// echo "SALE\n";
array_pop($lista);
array_pop($indices);
$probados[$j] = false;
}
}
}
}
}
return $resultado;
}
// COMPARES THE TWO OUTPUTS (ALGORITHM OUTPUT AND SOLUTION OUTPUT)
function compareTwoOutputs($fileName, $resultado) {
echo "\nRESULTADO EXTRAIDO DEL ALGORITMO PROGRAMADO: \n" . $resultado . "\n";
$archivo = fopen($fileName . "_solution.txt", "r") or die("No se ha podido abrir el archivo");
$puzzleResuelto = "\n";
while(!feof($archivo)) {
$puzzleResuelto .= fgets($archivo);
}
fclose($archivo);
echo "RESULTADO EXTRAIDO DE LA SOLUCION: \n" . $puzzleResuelto . "\n\n";
$resultadoFinal = true;
$resultadoEx = explode(PHP_EOL, $resultado);
$puzzleResueltoEx = explode(PHP_EOL, $puzzleResuelto);
for($i = 0; $i < count($resultadoEx); $i++) {
if(trim($resultadoEx[$i]) != '' && trim($puzzleResueltoEx[$i]) != '') {
if($resultadoEx[$i] != ($puzzleResueltoEx[$i] . " ")) {
$resultadoFinal = false;
break;
}
}
}
if($resultado == "")
$resultadoFinal = false;
echo "COMPARACION DE LOS DOS RESULTADOS: ";
echo $resultadoFinal ? "EL ALGORITMO ES CORRECTO\n\n" : "EL ALGORITMO NO ES CORRECTO\n\n";
}
?>