-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEightQueen.java
More file actions
504 lines (415 loc) · 19.3 KB
/
EightQueen.java
File metadata and controls
504 lines (415 loc) · 19.3 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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
//Marcus Katalenas
// Date: 5/25
// Eight Queens Project
/* This programm will be able to solve the eight queen challenge by generating a heuristic based on queen collisions on the chess board
The program will move one queen at a time per move moving them along their respective columns and checking the herustic of that move to the current herustic
The program will choose the move with the lowest heuristic and then will update the board and repeat.
If no moves in the current state of the board will result in a lower heuristic score, then the program will begin again with a fresh new board position of queens
This process continues until the program solves the puzzle.
*/
import java.util.*;
public class EightQueen {
//--------------------------------------------------------------------------------------------------
static void printBoard(int playBoard[][], int hScore){
System.out.println("Current H = " + hScore);
System.out.println("Current State");
for(int row = 0; row < 8; row++){
for(int col = 0; col < 8; col++){
System.out.print(playBoard[row][col]);
System.out.print(" ");
}
System.out.println();
}
}
static void printReset(int playBoard[][], int hScore){
System.out.println("Current H = " + hScore);
System.out.println("Current State");
for(int row = 0; row < 8; row++){
for(int col = 0; col < 8; col++){
System.out.print(playBoard[row][col]);
System.out.print(" ");
}
System.out.println();
}
}
static void printFinalBoard(int playBoard[][], int stateChanges, int restarts){
System.out.println("Current State");
for(int row = 0; row < 8; row++){
for(int col = 0; col < 8; col++){
System.out.print(playBoard[row][col]);
System.out.print(" ");
}
System.out.println();
}
System.out.println("Solution Found");
System.out.println("State Changes: " + stateChanges);
System.out.println("Restarts: " + restarts);
}
//--------------------------------------------------------------------------------------------------
static Boolean checkGoal(int hScore){
if(hScore == 0){
return true;
}
else{
return false;
}
}
static Boolean restartFlag(){
return true;
}
//--------------------------------------------------------------------------------------------------
static int checkAllHorizontal(int[][] Board, int[] qPos) {
int collisions = 0;
int row;
int currentCol;
int startCol;
for(int col = 0; col < 8; col++){
//WHAT ROW IS THE CURRENT COL IN
row = qPos[col];
//JUST NEED TO CHECK RIGHT OF ROW
if(col == 0){
currentCol = 1;
while(currentCol < 8){
if(Board[row][currentCol] == 1){
collisions++;
}
currentCol++;
}
}
else if(col == 7){
currentCol = 6;
while(currentCol > -1){
if(Board[row][currentCol] == 1){
collisions++;
}
currentCol--;
}
}
else{
startCol = col;
currentCol = startCol + 1;
while(currentCol < 8){
if(Board[row][currentCol] == 1){
collisions++;
}
currentCol++;
}
currentCol = startCol - 1;
while(currentCol > -1){
if(Board[row][currentCol] == 1){
collisions++;
}
currentCol--;
}
}
}
return collisions;
}
//--------------------------------------------------------------------------------------------------
static int checkDiag(int[][] Board, int[]qPos){
int startrow;
int startCol;
int currentCol, currentRow;
int collisions = 0;
for(int col = 0; col < 8; col++){
startCol = col;
currentCol = startCol;
startrow = qPos[startCol];
currentRow = startrow;
if(col == 0 || col == 7){
//LEFT-EDGE UP-RIGHT DOWN-RIGHT
if(col == 0){
//Up-Right Row-- col++
currentRow--;
currentCol++;
while(currentRow > -1 && currentCol < 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol++;
}
//RESET
currentCol = startCol;
currentRow = startrow;
//DOWN RIGHT ROW++ col++
currentRow++;
currentCol++;
while(currentRow > 8 && currentCol > 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol++;
}
}
//RIGHT EDGE UP-LEFT DOWN-LEFT
else{
// UP-LEFT ROW-- COL--
currentRow--;
currentCol--;
while(currentRow > -1 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol--;
}
//RESET
currentRow = startrow;
currentCol = startCol;
currentRow++;
currentCol--;
//DOWN-LEFT ROW++ COL--
while(currentRow < 8 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol--;
}
}
}
else{
if(startrow == 0 || startrow == 7){
//UPPER EDGE PIECE DOWN-RIGHT, DOWN LEFT
if(startrow == 0){
currentRow++;
currentCol++;
while(currentRow > 8 && currentCol > 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol++;
}
currentRow = startrow;
currentCol = startCol;
currentRow++;
currentCol--;
//DOWN-LEFT ROW++ COL--
while(currentRow < 8 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol--;
}
}
//LOWER EDGE PIECE UP-LEFT, UP-RIGHT
else{
currentRow--;
currentCol--;
while(currentRow > -1 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol--;
}
//RESET
currentCol = startCol;
currentRow = startrow;
//UP-RIGHT
currentRow--;
currentCol++;
while(currentRow > -1 && currentCol < 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol++;
}
}
}
else{
//UP-LEFT
currentRow--;
currentCol--;
while(currentRow > -1 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol--;
}
//reset
currentRow = startrow;
currentCol = startCol;
//DOWN-LEFT
currentRow++;
currentCol--;
while(currentRow < 8 && currentCol > -1){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol--;
}
//reset
currentRow = startrow;
currentCol = startCol;
//UP-RIGHT
currentRow--;
currentCol++;
while(currentRow > -1 && currentCol < 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow--;
currentCol++;
}
//reset
currentRow = startrow;
currentCol = startCol;
//DOWN-right
currentRow++;
currentCol++;
while(currentRow > 8 && currentCol > 8){
if(Board[currentRow][currentCol] == 1){
collisions++;
}
currentRow++;
currentCol++;
}
}
}
}
return collisions;
}
//--------------------------------------------------------------------------------------------------
public static void main(String[] args) {
System.currentTimeMillis();
Random rand = new Random();
int[] queenRowPostions = new int[8];
int[] bestQueensRowPostions = new int[8];
int[][] playBoard = new int[8][8];
int bestHscore;
int movesMade = 0;
int restarts = 0;
int currentHScore = 0;
int randomspot;
int problems = 0;
ArrayList<Integer> possibleHScores = new ArrayList<Integer>();
for (int startCol = 0; startCol < 8; startCol++) {
for (int startRow = 0; startRow < 8; startRow++) {
playBoard[startCol][startRow] = 0;
}
}
for (int colNum = 0; colNum < 8; colNum++) {
randomspot = rand.nextInt(8);
playBoard[randomspot][colNum] = 1;
queenRowPostions[colNum] = randomspot;
}
problems += checkAllHorizontal(playBoard, queenRowPostions);
problems += checkDiag(playBoard, queenRowPostions);
currentHScore = problems;
bestHscore = currentHScore;
Boolean resetflag = false;
//While the eight queens puzzle isnt solved
while(checkGoal(currentHScore) == false){
if(resetflag == true){
//empty the board
for(int i = 0; i < 8; i++){
playBoard[queenRowPostions[i]][i] = 0;
queenRowPostions[i] = 0;
bestQueensRowPostions[i]= 0;
}
//refill the board
for (int colNum = 0; colNum < 8; colNum++) {
randomspot = rand.nextInt(8);
playBoard[randomspot][colNum] = 1;
queenRowPostions[colNum] = randomspot;
}
currentHScore = 0;
currentHScore += checkAllHorizontal(playBoard, queenRowPostions);
currentHScore += checkDiag(playBoard, queenRowPostions);
bestHscore = currentHScore;
if(checkGoal(currentHScore)){
printBoard(playBoard, currentHScore);
System.exit(0);
}
resetflag = false;
}//------------------------END RESET-----------------------------------
//check moves
for(int i = 0; i < 8; i++){
int startRow = queenRowPostions[i];
int startCol = i;
int newHscore = 0;
int currentRow;
currentRow = startRow;
int previousRow = currentRow;
currentRow--;
while(currentRow != -1){
playBoard[currentRow][startCol] = 1;
playBoard[previousRow][startCol] = 0;
queenRowPostions[startCol] = currentRow;
newHscore += checkAllHorizontal(playBoard, queenRowPostions);
newHscore += checkDiag(playBoard, queenRowPostions);
if(newHscore < currentHScore){
possibleHScores.add(newHscore);
if(newHscore < bestHscore){
bestQueensRowPostions = queenRowPostions.clone();
bestHscore = newHscore;
}
}
previousRow = currentRow;
currentRow--;
newHscore = 0;
}
playBoard[startRow][startCol] = 1;
queenRowPostions[startCol] = startRow;
currentRow = startRow;
//move down 1 space until we hit lower edge
currentRow++;
while(currentRow != 8){
playBoard[currentRow][startCol] = 1;
playBoard[previousRow][startCol] = 0;
newHscore += checkAllHorizontal(playBoard, queenRowPostions);
newHscore += checkDiag(playBoard, queenRowPostions);
if(newHscore < currentHScore){
possibleHScores.add(newHscore);
if(newHscore < bestHscore){
bestQueensRowPostions = queenRowPostions.clone();
bestHscore = newHscore;
}
}
previousRow = currentRow;
currentRow++;
newHscore = 0;
}
playBoard[previousRow][startCol] = 0;
playBoard[startRow][startCol] = 1;
queenRowPostions[startCol] = startRow;
}///END OF MOVE CHECKS
if(possibleHScores.size() == 0){
printReset(playBoard, currentHScore);
System.out.println("Neighboors found with less H: " + possibleHScores.size());
System.out.println("RESTART");
resetflag = true;
restarts++;
}
else{
System.out.println();
printBoard(playBoard, currentHScore);
System.out.println("Neighboors found with less H: " + possibleHScores.size());
Collections.sort(possibleHScores);
currentHScore = bestHscore;
System.out.println("Setting new current state");
for(int i = 0; i < 8; i++){
if(queenRowPostions[i] != bestQueensRowPostions[i]){
playBoard[queenRowPostions[i]][i] = 0;
playBoard[bestQueensRowPostions[i]][i] = 1;
movesMade++;
}
}
//update the row positions and clear the arraylist for next iteration
queenRowPostions = bestQueensRowPostions.clone();
possibleHScores.clear();
}
}//END OF WHILE LOOP
if(checkGoal(currentHScore)){
printFinalBoard(playBoard, movesMade, restarts);
}
} // END OF MAIN
} //END OF CLASS