-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathChessTest.java
More file actions
670 lines (638 loc) · 27.5 KB
/
ChessTest.java
File metadata and controls
670 lines (638 loc) · 27.5 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
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
import static org.junit.Assert.*;
import java.util.HashSet;
import org.junit.Test;
@SuppressWarnings("unused")
public class ChessTest {
@Test public void chessBoardSetupTest(){
Chessboard c = new Chessboard();
assertTrue("An error occurred in the setup process",true);
}
@Test public void playerInitializationTest(){
Chessboard c = new Chessboard();
Player p1 = new Player(Shade.WHITE,c);
Player p2 = new Player(Shade.BLACK,c);
try {
Player p3 = new Player(Shade.WHITE,c);
fail("Shouldn't be here, third player should fail");
} catch (Exception e) {
if (e instanceof IllegalArgumentException) assertTrue(true);
}
}
@Test public void constructorTests(){
Chessboard c = new Chessboard();
Pawn p = new Pawn(Shade.BLACK,new int[]{0,0},c);
Bishop b = new Bishop(Shade.BLACK,new int[]{1,0},c);
Knight n = new Knight(Shade.BLACK,new int[]{2,0},c);
Rook r = new Rook(Shade.BLACK,new int[]{3,0},c);
King k = new King(Shade.BLACK,new int[]{4,0},c);
Queen q = new Queen(Shade.WHITE,new int[]{0,4},c);
assertTrue("Just trying to set up some pieces is all",true);
}
@Test public void squareMethodTests(){
Chessboard c = new Chessboard();
assertFalse("See if empty square is empty",c.getSquare(new Coord(0,0)).isOccupied());
assertFalse(c.getSquare(new Coord(0,0)).isAttacked(Shade.WHITE));
assertFalse(c.getSquare(new Coord(0,0)).isAttacked(Shade.BLACK));
assertEquals("Occupant color should be null",null,c.getSquare(new Coord(0,0)).occupantShade());
assertTrue("CanMove on empty square should return true",c.getSquare(new Coord(0,0)).canMove(Shade.WHITE));
assertTrue("CanMove on empty square should return true",c.getSquare(new Coord(0,0)).canMove(Shade.BLACK));
Pawn p = new Pawn(Shade.BLACK,new int[]{0,0},c);
assertTrue("CanMove on empty square should return true",c.getSquare(new Coord(0,0)).canMove(Shade.WHITE));
assertFalse("CanMove on empty square should return true",c.getSquare(new Coord(0,0)).canMove(Shade.BLACK));
assertTrue("See if pawn square is occupied",c.getSquare(new Coord(0,0)).isOccupied());
assertEquals("See if get color is correct",Shade.BLACK,c.getSquare(new Coord(0,0)).occupantShade());
assertEquals("See if square knows its color",Shade.BLACK,c.getSquare(new Coord(0,0)).getShade());
c.getSquare(new Coord(0,0)).clear();
assertFalse("See if empty square is empty: PART DEUX",c.getSquare(new Coord(0,0)).isOccupied());
c.getSquare(new Coord(0,0)).setBlackAttack(true);
c.getSquare(new Coord(0,0)).setWhiteAttack(true);
assertTrue(c.getSquare(new Coord(0,0)).isAttacked(Shade.BLACK));
assertTrue(c.getSquare(new Coord(0,0)).isAttacked(Shade.WHITE));
}
@Test public void pieceMethodTests(){
Chessboard c = new Chessboard();
Pawn p = new Pawn(Shade.WHITE,new int[]{0,0},c);
assertEquals(Shade.WHITE,p.getShade());
assertEquals(new Coord(0,0),p.getCoord());
assertTrue(p.isAlive());
p.put(new Coord(0,1));
assertEquals(new Coord(0,1),p.getCoord());
p.kill();
assertFalse(p.isAlive());
}
@Test public void whitePawnMoveTests(){
Chessboard c = new Chessboard();
Pawn p = new Pawn(Shade.WHITE,new int[]{4,1},c); //New pawn on e2
assertFalse("Very wrong move",p.validMove(new Coord(0,0)));
assertFalse("Backwards move",p.validMove(new Coord(4,0)));
assertFalse("Sideways move",p.validMove(new Coord(3,1)));
Knight n = new Knight(Shade.BLACK,new int[]{4,2},c);
assertFalse("Single square forward",p.validMove(new Coord(4,2)));
assertFalse("Two squares forward",p.validMove(new Coord(4,3)));
c.getSquare(new Coord(4,2)).clear();
n.kill();
assertTrue("Single square forward",p.validMove(new Coord(4,2)));
assertTrue("Two squares forward",p.validMove(new Coord(4,3)));
Queen q = new Queen(Shade.BLACK,new int[]{3,2},c); //Make a new Queen
assertTrue("One square forward still valid",p.validMove(new Coord(4,2)));
assertTrue("TAKE THE QUEEN",p.validMove(new Coord(3,2)));
p.put(new Coord(3,2)); //Move the pawn
assertFalse("Can't move forward two squares anymore",p.validMove(new Coord(3,4)));
assertTrue("Can still move forward one square",p.validMove(new Coord(3,3)));
assertFalse(p.validMove(p.getCoord()));
}
@Test public void blackPawnMoveTests(){
Chessboard c = new Chessboard();
Pawn p = new Pawn(Shade.BLACK,new int[]{4,6},c); //New pawn on e2
assertFalse("Very wrong move",p.validMove(new Coord(0,7)));
assertFalse("Backwards move",p.validMove(new Coord(4,7)));
assertFalse("Sideways move",p.validMove(new Coord(3,7)));
Knight n = new Knight(Shade.BLACK,new int[]{4,5},c);
assertFalse("Single square forward",p.validMove(new Coord(4,5)));
assertFalse("Two squares forward",p.validMove(new Coord(4,4)));
n.kill();
assertTrue("Single square forward",p.validMove(new Coord(4,5)));
assertTrue("Two squares forward",p.validMove(new Coord(4,4)));
Queen q = new Queen(Shade.WHITE,new int[]{3,5},c); //Make a new Queen
assertTrue("One square forward still valid",p.validMove(new Coord(4,5)));
assertTrue("TAKE THE QUEEN",p.validMove(new Coord(3,5)));
p.put(new Coord(3,5)); //Move the pawn
assertFalse("Can't move forward two squares anymore",p.validMove(new Coord(3,3)));
assertTrue("Can still move forward one square",p.validMove(new Coord(3,4)));
assertFalse(p.validMove(p.getCoord()));
}
@Test public void rookMoveTests(){
Chessboard c = new Chessboard();
Rook r = new Rook(Shade.BLACK,new int[]{0,0},c);
assertTrue(r.validMove(new Coord(0,7)));
assertTrue(r.validMove(new Coord(0,5)));
assertTrue(r.validMove(new Coord(0,3)));
assertTrue(r.validMove(new Coord(0,1)));
assertTrue(r.validMove(new Coord(1,0)));
assertTrue(r.validMove(new Coord(3,0)));
assertTrue(r.validMove(new Coord(5,0)));
assertTrue(r.validMove(new Coord(7,0)));
assertFalse(r.validMove(new Coord(1,1)));
assertFalse(r.validMove(new Coord(3,1)));
assertFalse(r.validMove(new Coord(1,3)));
Knight n = new Knight(Shade.WHITE,new int[]{3,0},c);
assertFalse(r.validMove(new Coord(4,0)));
assertTrue(r.validMove(new Coord(3,0)));
assertTrue(r.validMove(new Coord(2,0)));
Bishop b = new Bishop(Shade.BLACK,new int[]{0,3},c);
assertFalse(r.validMove(new Coord(0,4)));
assertFalse(r.validMove(new Coord(0,3)));
assertTrue(r.validMove(new Coord(0,2)));
assertFalse(r.validMove(new Coord(4,0)));
assertTrue(r.validMove(new Coord(3,0)));
assertFalse(r.validMove(new Coord(2,1)));
c.getSquare(new Coord(0,0)).clear();
c.getSquare(new Coord(3,0)).clear();
c.getSquare(new Coord(0,3)).clear();
Rook r2 = new Rook(Shade.WHITE,new int[]{7,7},c);
assertTrue(r2.validMove(new Coord(7,6)));
assertTrue(r2.validMove(new Coord(7,4)));
assertTrue(r2.validMove(new Coord(7,3)));
assertTrue(r2.validMove(new Coord(7,1)));
assertTrue(r2.validMove(new Coord(1,7)));
assertTrue(r2.validMove(new Coord(3,7)));
assertTrue(r2.validMove(new Coord(6,7)));
assertFalse(r2.validMove(new Coord(1,1)));
assertFalse(r2.validMove(new Coord(3,1)));
assertFalse(r2.validMove(new Coord(1,3)));
Knight n2 = new Knight(Shade.WHITE,new int[]{7,3},c);
Bishop b2 = new Bishop(Shade.BLACK,new int[]{5,7},c);
assertTrue(r2.validMove(new Coord(6,7)));
assertTrue(r2.validMove(new Coord(5,7)));
assertFalse(r2.validMove(new Coord(4,7)));
assertTrue(r2.validMove(new Coord(7,4)));
assertFalse(r2.validMove(new Coord(7,3)));
assertFalse(r2.validMove(new Coord(7,2)));
assertFalse(r2.validMove(r2.getCoord()));
}
@Test public void knightMoveTests(){
Chessboard c = new Chessboard();
Knight n = new Knight(Shade.BLACK,new int[]{3,3},c);
assertTrue(n.validMove(new Coord(4,5)));
assertTrue(n.validMove(new Coord(5,4)));
assertTrue(n.validMove(new Coord(5,2)));
assertTrue(n.validMove(new Coord(4,1)));
assertTrue(n.validMove(new Coord(2,1)));
assertTrue(n.validMove(new Coord(1,2)));
assertTrue(n.validMove(new Coord(1,4)));
assertTrue(n.validMove(new Coord(2,5)));
assertFalse(n.validMove(new Coord(2,0)));
Bishop b = new Bishop(Shade.BLACK,new int[]{4,5},c);
Pawn p = new Pawn(Shade.WHITE,new int[]{2,5},c);
assertFalse(n.validMove(new Coord(4,5)));
assertTrue(n.validMove(new Coord(2,5)));
assertFalse(n.validMove(n.getCoord()));
}
@Test public void bishopMoveTests(){
Chessboard c = new Chessboard();
Bishop b = new Bishop(Shade.WHITE,new int[]{3,3},c);
//Up to the right
assertTrue(b.validMove(new Coord(4,4)));
assertTrue(b.validMove(new Coord(5,5)));
assertTrue(b.validMove(new Coord(6,6)));
assertTrue(b.validMove(new Coord(7,7)));
//Down to the left
assertTrue(b.validMove(new Coord(2,2)));
assertTrue(b.validMove(new Coord(1,1)));
assertTrue(b.validMove(new Coord(0,0)));
//Down to the right
assertTrue(b.validMove(new Coord(4,2)));
assertTrue(b.validMove(new Coord(5,1)));
assertTrue(b.validMove(new Coord(6,0)));
//Up to the left
assertTrue(b.validMove(new Coord(2,4)));
assertTrue(b.validMove(new Coord(1,5)));
assertTrue(b.validMove(new Coord(0,6)));
Knight n = new Knight(Shade.WHITE,new int[]{1,5},c);
Rook r = new Rook(Shade.BLACK,new int[]{5,5},c);
assertTrue(b.validMove(new Coord(4,4)));
assertTrue(b.validMove(new Coord(5,5)));
assertFalse(b.validMove(new Coord(6,6)));
assertTrue(b.validMove(new Coord(2,4)));
assertFalse(b.validMove(new Coord(1,5)));
assertFalse(b.validMove(new Coord(0,6)));
b.kill(); n.kill();
Bishop b2 = new Bishop(Shade.BLACK,new int[]{6,6},c);
assertTrue(b2.validMove(new Coord(7,7)));
assertTrue(b2.validMove(new Coord(5,7)));
assertTrue(b2.validMove(new Coord(7,5)));
assertFalse(b2.validMove(new Coord(4,4)));
assertFalse(b2.validMove(new Coord(5,5)));
assertFalse(b2.validMove(b2.getCoord()));
}
@Test public void queenMoveTests(){
Chessboard c = new Chessboard();
Queen q = new Queen(Shade.WHITE,new int[]{3,3},c);
//Up to the right
assertTrue(q.validMove(new Coord(4,4)));
assertTrue(q.validMove(new Coord(5,5)));
assertTrue(q.validMove(new Coord(6,6)));
assertTrue(q.validMove(new Coord(7,7)));
//Down to the left
assertTrue(q.validMove(new Coord(2,2)));
assertTrue(q.validMove(new Coord(1,1)));
assertTrue(q.validMove(new Coord(0,0)));
//Down to the right
assertTrue(q.validMove(new Coord(4,2)));
assertTrue(q.validMove(new Coord(5,1)));
assertTrue(q.validMove(new Coord(6,0)));
//Up to the left
assertTrue(q.validMove(new Coord(2,4)));
assertTrue(q.validMove(new Coord(1,5)));
assertTrue(q.validMove(new Coord(0,6)));
Knight n = new Knight(Shade.WHITE,new int[]{1,5},c);
Rook r = new Rook(Shade.BLACK,new int[]{5,5},c);
assertTrue(q.validMove(new Coord(4,4)));
assertTrue(q.validMove(new Coord(5,5)));
assertFalse(q.validMove(new Coord(6,6)));
assertTrue(q.validMove(new Coord(2,4)));
assertFalse(q.validMove(new Coord(1,5)));
assertFalse(q.validMove(new Coord(0,6)));
q.kill(); n.kill();
Queen q2 = new Queen(Shade.BLACK,new int[]{6,6},c);
assertTrue(q2.validMove(new Coord(7,7)));
assertTrue(q2.validMove(new Coord(5,7)));
assertTrue(q2.validMove(new Coord(7,5)));
assertFalse(q2.validMove(new Coord(4,4)));
assertFalse(q2.validMove(new Coord(5,5)));
q2.kill(); r.kill();
Queen q3 = new Queen(Shade.BLACK,new int[]{0,0},c);
assertTrue(q3.validMove(new Coord(0,7)));
assertTrue(q3.validMove(new Coord(0,5)));
assertTrue(q3.validMove(new Coord(0,3)));
assertTrue(q3.validMove(new Coord(0,1)));
assertTrue(q3.validMove(new Coord(1,0)));
assertTrue(q3.validMove(new Coord(3,0)));
assertTrue(q3.validMove(new Coord(5,0)));
assertTrue(q3.validMove(new Coord(7,0)));
assertFalse(q3.validMove(new Coord(3,1)));
assertFalse(q3.validMove(new Coord(1,3)));
Knight n1 = new Knight(Shade.WHITE,new int[]{3,0},c);
assertFalse(q3.validMove(new Coord(4,0)));
assertTrue(q3.validMove(new Coord(3,0)));
assertTrue(q3.validMove(new Coord(2,0)));
Bishop b = new Bishop(Shade.BLACK,new int[]{0,3},c);
assertFalse(q3.validMove(new Coord(0,4)));
assertFalse(q3.validMove(new Coord(0,3)));
assertTrue(q3.validMove(new Coord(0,2)));
assertFalse(q3.validMove(new Coord(4,0)));
assertTrue(q3.validMove(new Coord(3,0)));
assertFalse(q3.validMove(new Coord(2,1)));
q3.kill(); b.kill(); n1.kill();
Queen q4 = new Queen(Shade.WHITE,new int[]{7,7},c);
assertTrue(q4.validMove(new Coord(7,6)));
assertTrue(q4.validMove(new Coord(7,4)));
assertTrue(q4.validMove(new Coord(7,3)));
assertTrue(q4.validMove(new Coord(7,1)));
assertTrue(q4.validMove(new Coord(1,7)));
assertTrue(q4.validMove(new Coord(3,7)));
assertTrue(q4.validMove(new Coord(6,7)));
assertTrue(q4.validMove(new Coord(1,1)));
assertFalse(q4.validMove(new Coord(3,1)));
assertFalse(q4.validMove(new Coord(1,3)));
Knight n2 = new Knight(Shade.WHITE,new int[]{7,3},c);
Bishop b2 = new Bishop(Shade.BLACK,new int[]{5,7},c);
assertTrue(q4.validMove(new Coord(6,7)));
assertTrue(q4.validMove(new Coord(5,7)));
assertFalse(q4.validMove(new Coord(4,7)));
assertTrue(q4.validMove(new Coord(7,4)));
assertFalse(q4.validMove(new Coord(7,3)));
assertFalse(q4.validMove(new Coord(7,2)));
assertFalse(q4.validMove(q4.getCoord()));
}
@Test public void kingMoveTests(){
Chessboard c = new Chessboard();
King k = new King(Shade.WHITE,new int[]{3,3},c);
assertTrue(k.validMove(new Coord(3,4)));
assertTrue(k.validMove(new Coord(4,4)));
assertTrue(k.validMove(new Coord(4,3)));
assertTrue(k.validMove(new Coord(4,2)));
assertTrue(k.validMove(new Coord(3,2)));
assertTrue(k.validMove(new Coord(2,2)));
assertTrue(k.validMove(new Coord(2,3)));
assertTrue(k.validMove(new Coord(2,4)));
assertFalse(k.validMove(new Coord(3,5)));
assertFalse(k.validMove(new Coord(5,3)));
assertFalse(k.validMove(new Coord(5,5)));
assertFalse(k.validMove(new Coord(5,1)));
assertFalse(k.validMove(new Coord(3,1)));
assertFalse(k.validMove(new Coord(1,1)));
assertFalse(k.validMove(new Coord(1,3)));
assertFalse(k.validMove(new Coord(5,3)));
Pawn p = new Pawn(Shade.WHITE,new int[]{4,3},c);
Rook r = new Rook(Shade.BLACK,new int[]{4,4},c);
assertTrue(k.validMove(new Coord(4,4)));
assertFalse(k.validMove(new Coord(4,3)));
c.getSquare(new Coord(3,4)).setBlackAttack(true);
c.getSquare(new Coord(2,4)).setBlackAttack(true);
assertFalse(k.validMove(new Coord(3,4)));
assertFalse(k.validMove(new Coord(2,4)));
c.getSquare(new Coord(2,4)).setBlackAttack(false);
c.getSquare(new Coord(2,4)).setWhiteAttack(true);
assertTrue(k.validMove(new Coord(2,4)));
}
@Test public void movePieceBasicTest(){
Chessboard c = new Chessboard();
Knight n = new Knight(Shade.BLACK,new int[]{3,3},c);
assertFalse(c.movePiece(n, new Coord(3,3)));
assertFalse(c.movePiece(n, new Coord(0,0)));
assertTrue(c.movePiece(n, new Coord(5,4)));
assertFalse(c.getSquare(new Coord(3,3)).isOccupied());
assertTrue(c.getSquare(new Coord(5,4)).isOccupied());
assertEquals(new Coord(5,4),n.getCoord());
}
@Test public void movePieceTakePieceTest(){
Chessboard c = new Chessboard();
Queen q = new Queen(Shade.BLACK,new int[]{3,3},c);
Knight n = new Knight(Shade.WHITE, new int[]{4,4},c);
assertFalse(c.movePiece(q, new Coord(3,3)));
assertFalse(c.movePiece(q, new Coord(5,5)));
assertTrue(c.movePiece(q, new Coord(0,0)));
assertTrue(c.movePiece(q, new Coord(4,4)));
assertFalse(c.getSquare(new Coord(3,3)).isOccupied());
assertFalse(c.getSquare(new Coord(0,0)).isOccupied());
assertTrue(c.getSquare(new Coord(4,4)).isOccupied());
assertEquals(Shade.BLACK,c.getSquare(new Coord(4,4)).occupantShade());
assertEquals(new Coord(4,4),q.getCoord());
}
@Test public void rookAttackTest(){
Chessboard c = new Chessboard();
Rook r = new Rook(Shade.BLACK,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(r.getAttack());
assertTrue(test.contains(new Coord(3,0)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(3,4)));
assertTrue(test.contains(new Coord(3,6)));
assertTrue(test.contains(new Coord(3,7)));
assertTrue(test.contains(new Coord(0,3)));
assertTrue(test.contains(new Coord(2,3)));
assertFalse(test.contains(new Coord(3,3)));
assertTrue(test.contains(new Coord(4,3)));
assertTrue(test.contains(new Coord(6,3)));
Knight n = new Knight(Shade.WHITE,new int[]{3,2},c);
Bishop b = new Bishop(Shade.BLACK,new int[]{5,3},c);
test.clear();
test.addAll(r.getAttack());
assertFalse(test.contains(new Coord(3,0)));
assertFalse(test.contains(new Coord(3,1)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(3,4)));
assertTrue(test.contains(new Coord(3,6)));
assertTrue(test.contains(new Coord(3,7)));
assertTrue(test.contains(new Coord(0,3)));
assertTrue(test.contains(new Coord(2,3)));
assertFalse(test.contains(new Coord(3,3)));
assertTrue(test.contains(new Coord(4,3)));
assertTrue(test.contains(new Coord(5,3)));
assertFalse(test.contains(new Coord(6,3)));
assertFalse(test.contains(new Coord(7,3)));
assertFalse(test.contains(r.getCoord()));
c.movePiece(r, new Coord(3,2)); //Take the knight
assertFalse(n.isAlive());
test.clear();
test.addAll(r.getAttack());
assertTrue(test.contains(new Coord(7,2)));
assertTrue(test.contains(new Coord(0,2)));
assertFalse(test.contains(new Coord(0,3)));
assertFalse(test.contains(new Coord(2,3)));
assertFalse(test.contains(new Coord(3,2)));
assertFalse(test.contains(new Coord(4,3)));
assertFalse(test.contains(new Coord(5,3)));
assertFalse(test.contains(new Coord(6,3)));
assertFalse(test.contains(new Coord(7,3)));
}
@Test public void pawnAttackTest(){
Chessboard c = new Chessboard();
Pawn p1 = new Pawn(Shade.BLACK,new int[]{3,3},c);
Pawn p2 = new Pawn(Shade.WHITE,new int[]{4,4},c);
HashSet<Coord> test1 = new HashSet<Coord>();
HashSet<Coord> test2 = new HashSet<Coord>();
test1.addAll(p1.getAttack());
test2.addAll(p2.getAttack());
assertTrue(test1.contains(new Coord(2,2)));
assertTrue(test1.contains(new Coord(4,2)));
assertTrue(test2.contains(new Coord(5,5)));
assertTrue(test2.contains(new Coord(3,5)));
assertFalse(test1.contains(new Coord(3,2)));
assertFalse(test1.contains(new Coord(4,5)));
assertFalse(test1.contains(p1.getCoord()));
assertFalse(test2.contains(p2.getCoord()));
test1.clear(); test2.clear(); p1.kill(); p2.kill();
Pawn p = new Pawn(Shade.WHITE,new int[]{0,1},c);
test1.addAll(p.getAttack());
assertTrue(test1.contains(new Coord(1,2)));
}
@Test public void kingAttackTest(){
Chessboard c = new Chessboard();
King k = new King(Shade.BLACK,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(k.getAttack());
assertTrue(test.contains(new Coord(3,4)));
assertTrue(test.contains(new Coord(4,4)));
assertTrue(test.contains(new Coord(4,3)));
assertTrue(test.contains(new Coord(4,2)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(2,3)));
assertTrue(test.contains(new Coord(2,4)));
assertFalse(test.contains(k.getCoord()));
King k2 = new King(Shade.WHITE,new int[]{7,7},c);
test.clear(); test.addAll(k2.getAttack());
assertTrue(test.contains(new Coord(6,6)));
assertTrue(test.contains(new Coord(6,7)));
assertTrue(test.contains(new Coord(7,6)));
assertFalse(test.contains(k2.getCoord()));
}
@Test public void knightAttackTest(){
Chessboard c = new Chessboard();
Knight n = new Knight(Shade.WHITE,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(n.getAttack());
assertTrue(test.contains(new Coord(5,4)));
assertTrue(test.contains(new Coord(4,5)));
assertTrue(test.contains(new Coord(5,4)));
assertTrue(test.contains(new Coord(5,2)));
assertTrue(test.contains(new Coord(4,1)));
assertTrue(test.contains(new Coord(2,1)));
assertTrue(test.contains(new Coord(1,2)));
assertTrue(test.contains(new Coord(1,4)));
assertTrue(test.contains(new Coord(2,5)));
assertFalse(test.contains(n.getCoord()));
}
@Test public void bishopAttackTest(){
Chessboard c = new Chessboard();
Bishop b = new Bishop(Shade.BLACK,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(b.getAttack());
assertTrue(test.contains(new Coord(4,4)));
assertTrue(test.contains(new Coord(6,6)));
assertTrue(test.contains(new Coord(7,7)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(0,0)));
assertTrue(test.contains(new Coord(2,4)));
assertTrue(test.contains(new Coord(0,6)));
assertTrue(test.contains(new Coord(4,2)));
assertTrue(test.contains(new Coord(6,0)));
assertFalse(test.contains(b.getCoord()));
test.clear();
Bishop b2 = new Bishop(Shade.WHITE,new int[]{5,5},c);
Knight n = new Knight(Shade.BLACK,new int[]{4,2},c);
test.addAll(b.getAttack());
assertTrue(test.contains(new Coord(4,4)));
assertTrue(test.contains(new Coord(5,5)));
assertFalse(test.contains(new Coord(6,6)));
assertFalse(test.contains(new Coord(7,7)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(0,0)));
assertTrue(test.contains(new Coord(2,4)));
assertTrue(test.contains(new Coord(0,6)));
assertTrue(test.contains(new Coord(4,2)));
assertFalse(test.contains(new Coord(6,0)));
}
@Test public void queenRookAttackTest(){
Chessboard c = new Chessboard();
Queen q = new Queen(Shade.BLACK,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(q.getAttack());
assertTrue(test.contains(new Coord(3,0)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(3,4)));
assertTrue(test.contains(new Coord(3,6)));
assertTrue(test.contains(new Coord(3,7)));
assertTrue(test.contains(new Coord(0,3)));
assertTrue(test.contains(new Coord(2,3)));
assertFalse(test.contains(new Coord(3,3)));
assertTrue(test.contains(new Coord(4,3)));
assertTrue(test.contains(new Coord(6,3)));
Knight n = new Knight(Shade.WHITE,new int[]{3,2},c);
Bishop b = new Bishop(Shade.BLACK,new int[]{5,3},c);
test.clear();
test.addAll(q.getAttack());
assertFalse(test.contains(new Coord(3,0)));
assertFalse(test.contains(new Coord(3,1)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(3,4)));
assertTrue(test.contains(new Coord(3,6)));
assertTrue(test.contains(new Coord(3,7)));
assertTrue(test.contains(new Coord(0,3)));
assertTrue(test.contains(new Coord(2,3)));
assertFalse(test.contains(new Coord(3,3)));
assertTrue(test.contains(new Coord(4,3)));
assertTrue(test.contains(new Coord(5,3)));
assertFalse(test.contains(new Coord(6,3)));
assertFalse(test.contains(new Coord(7,3)));
assertFalse(test.contains(q.getCoord()));
}
@Test public void queenBishopAttackTest(){
Chessboard c = new Chessboard();
Queen q = new Queen(Shade.BLACK,new int[]{3,3},c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(q.getAttack());
assertTrue(test.contains(new Coord(4,4)));
assertTrue(test.contains(new Coord(6,6)));
assertTrue(test.contains(new Coord(7,7)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(0,0)));
assertTrue(test.contains(new Coord(2,4)));
assertTrue(test.contains(new Coord(0,6)));
assertTrue(test.contains(new Coord(4,2)));
assertTrue(test.contains(new Coord(6,0)));
assertFalse(test.contains(q.getCoord()));
test.clear();
Bishop b2 = new Bishop(Shade.WHITE,new int[]{5,5},c);
Knight n = new Knight(Shade.BLACK,new int[]{4,2},c);
test.addAll(q.getAttack());
assertTrue(test.contains(new Coord(4,4)));
assertTrue(test.contains(new Coord(5,5)));
assertFalse(test.contains(new Coord(6,6)));
assertFalse(test.contains(new Coord(7,7)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(0,0)));
assertTrue(test.contains(new Coord(2,4)));
assertTrue(test.contains(new Coord(0,6)));
assertTrue(test.contains(new Coord(4,2)));
assertFalse(test.contains(new Coord(6,0)));
}
@Test public void squaresAttackedTest(){
Chessboard c = new Chessboard();
Player white = new Player(Shade.WHITE,c);
HashSet<Coord> test = new HashSet<Coord>();
test.addAll(white.getSquaresAttacked());
assertTrue(test.contains(new Coord(0,2)));
assertTrue(test.contains(new Coord(1,2)));
assertTrue(test.contains(new Coord(2,2)));
assertTrue(test.contains(new Coord(3,2)));
assertTrue(test.contains(new Coord(4,2)));
assertTrue(test.contains(new Coord(5,2)));
assertTrue(test.contains(new Coord(6,2)));
assertTrue(test.contains(new Coord(7,2)));
}
@Test public void kingDangerZoneTest(){
Chessboard c = new Chessboard();
King k = new King(Shade.BLACK,new int[]{3,3},c);
Pawn p = new Pawn(Shade.WHITE,new int[]{1,1},c);
Knight n = new Knight(Shade.WHITE,new int[]{1,5},c);
Bishop b1 = new Bishop(Shade.WHITE,new int[]{2,5},c);
Bishop b2 = new Bishop(Shade.WHITE,new int[]{3,5},c);
Rook r1 = new Rook(Shade.WHITE,new int[]{5,2},c);
Rook r2 = new Rook(Shade.WHITE,new int[]{4,5},c);
c.applyAttack(k); c.applyAttack(p); c.applyAttack(n);
c.applyAttack(b1); c.applyAttack(r1); c.applyAttack(r2);
c.applyAttack(b2);
assertFalse(k.validMove(new Coord(3,4)));
assertFalse(k.validMove(new Coord(4,4)));
assertFalse(k.validMove(new Coord(4,3)));
assertFalse(k.validMove(new Coord(4,2)));
assertFalse(k.validMove(new Coord(3,2)));
assertFalse(k.validMove(new Coord(2,2)));
assertFalse(k.validMove(new Coord(2,3)));
assertFalse(k.validMove(new Coord(2,4)));
}
@Test public void kingCastleTest(){
Chessboard c = new Chessboard();
King k = new King(Shade.WHITE,new int[]{4,0},c);
Rook r1 = new Rook(Shade.WHITE,new int[]{0,0},c);
Rook r2 = new Rook(Shade.WHITE,new int[]{7,0},c);
assertTrue(k.validMove(new Coord(2,0)));
assertTrue(k.validMove(new Coord(6,0)));
Bishop b = new Bishop(Shade.BLACK,new int[]{3,2},c);
c.applyAttack(b);
assertFalse(k.validMove(new Coord(2,0)));
assertFalse(k.validMove(new Coord(6,0)));
b.kill(); c.clearAttacks();
assertTrue(k.validMove(new Coord(2,0)));
assertTrue(k.validMove(new Coord(6,0)));
Queen q = new Queen(Shade.WHITE,new int[]{3,0},c);
Knight n = new Knight(Shade.WHITE,new int[]{6,0},c);
assertFalse(k.validMove(new Coord(2,0)));
assertFalse(k.validMove(new Coord(6,0)));
q.kill(); n.kill();
assertTrue(k.validMove(new Coord(2,0)));
assertTrue(k.validMove(new Coord(6,0)));
Rook r3 = new Rook(Shade.BLACK, new int[]{4,4},c);
c.applyAttack(r3);
assertFalse(k.validMove(new Coord(2,0)));
assertFalse(k.validMove(new Coord(6,0)));
r3.kill(); c.clearAttacks();
Pawn p = new Pawn(Shade.BLACK, new int[]{2,1},c);
c.applyAttack(p);
assertFalse(k.validMove(new Coord(2,0)));
assertTrue(k.validMove(new Coord(6,0)));
c.movePiece(p, new Coord(2,0));
c.clearAttacks(); c.applyAttack(p);
assertFalse(k.validMove(new Coord(2,0)));
assertTrue(k.validMove(new Coord(6,0)));
c.movePiece(r2, new Coord(7,1));
p.kill();
assertTrue(k.validMove(new Coord(2,0)));
assertFalse(k.validMove(new Coord(6,0)));
assertTrue(c.movePiece(k, new Coord(2,0)));
assertEquals(new Coord(2,0),k.getCoord());
assertEquals(new Coord(3,0),r1.getCoord());
assertTrue(c.getSquare(new Coord(2,0)).isOccupied());
assertTrue(c.getSquare(new Coord(3,0)).isOccupied());
assertFalse(c.getSquare(new Coord(0,0)).isOccupied());
assertFalse(c.getSquare(new Coord(4,0)).isOccupied());
assertFalse(k.canCastle() || r1.canCastle() || r2.canCastle());
}
@Test public void enPassantTests(){
Chessboard c = new Chessboard();
Pawn p1 = new Pawn(Shade.WHITE,new int[]{0,1},c);
Pawn p2 = new Pawn(Shade.BLACK,new int[]{1,3},c);
c.movePiece(p1, new Coord(0,3));
PassantShadow ps = new PassantShadow(Shade.WHITE,new int[]{0,2},c,p1);
assertFalse(c.getSquare(new Coord(0,2)).isOccupied());
assertTrue(c.getSquare(new Coord(0,2)).hasPassant());
assertTrue(p2.validMove(new Coord(0,2)));
assertTrue(c.movePiece(p2, new Coord(0,2)));
assertFalse(c.getSquare(new Coord(0,3)).isOccupied());
assertFalse(c.getSquare(new Coord(0,2)).hasPassant());
assertTrue(c.getSquare(new Coord(0,2)).isOccupied());
}
}