1 import java. u t i l. ArrayList ; 2 import java. u t i l. L i s t ; 4 /

Transcription

1 1 import java. u t i l. ArrayList ; 2 import java. u t i l. L i s t ; 3 4 / 5 The c l a s s {@code Othello } r e p r e s e n t s the game Othello i t s e l f. 6 All game l o g i c i s done in t h i s c l a s s. 7 8 The Java Doc can be found h e r e : 9 <a h r e f="http : / /www. martin thoma. de/ programmieren o t h e l l o 1adf234d3fS/"> 10 martin thoma. de/ programmieren o t h e l l o 1adf234d3fS </a> 11 Martin Thoma 13 / p u b l i c c l a s s Othello { 16 / Error message : a p l a y e r already moved / 17 p u b l i c s t a t i c f i n a l S t r i n g ERR_PLAYER_MOVED 18 = "Cannot add hole area. A p l a y e r did move. " ; / Error message : no a c t i v e game / 21 p u b l i c s t a t i c f i n a l S t r i n g ERR_NO_ACTIVE_GAME = "No a c t i v e game. " ; / Error message : the move t a r g e t i s n t on the board / 24 p u b l i c s t a t i c f i n a l S t r i n g ERR_OFFBOARD_MOVE 25 = "The move p o s i t i o n has to be on the board. " ; / Error message : a c o l o r i s in the f o r a hole s p e c i f i e d r e c t a n g l e / 28 p u b l i c s t a t i c f i n a l S t r i n g ERR_COLOR_IN_RECTANGLE 29 = "You can t p l a c e the hole here. There are c o l o r p i e c e s. " ; / Error message : the s p e c i f i e d r e c t a n g l e i s n t v a l i d / 32 p u b l i c s t a t i c f i n a l S t r i n g ERR_NO_VALID_RECTANGLE = "The s p e c i f i e d " ; 33 + " r e c t a n g l e i s n t v a l i d. " 34 + " Valid i s something l i k e A1 : B3 or A1 : A1. The f i r s t p o s i t i o n " ; 35 + " has to be on the top l e f t. " ; / The c u r r e n t p l a y e r. Always s t a r t with black. / 38 p r i v a t e F i e l d c u r r e n t P l a y e r = F i e l d.black; / I s the c u r r e n t game s t i l l in p r o g r e s s? / 41 p r i v a t e boolean isrunning = true ; / Has a l r e a d y a move command been submitted? / 44 p r i v a t e boolean submittedmove = f a l s e ; / The board with a l l p i e c e s / 47 p u b l i c f i n a l Board board ; p r i v a t e f i n a l i n t [ ] [ ] a d j a c t a n t F i e l d s = {{ 1, 1}, {0, 1}, {1, 1}, 50 { 1, 0}, {1, 0}, { 1, 1}, {0, 1}, {1, 1}}; / 53 Constructor f o r Othello. 54 I t i s p o s s i b l e, that the game i s f i n i s h e d as soon as i t i s c r e a t e d. width t h e width o f t h e board h e i g h t the h e i g h t o f the board 57 / 1

2 58 p u b l i c Othello ( i n t width, i n t height ) { 59 t h i s. board = new Board ( width, h eight ) ; 60 checkstate ( ) ; 61 } / 64 Constructor f o r Othello with a given s t a r t s i t u a t i o n. 65 I t i s p o s s i b l e, that the game i s f i n i s h e d as soon as i t i s c r e a t e d. width t h e width o f t h e board h e i g h t the h e i g h t o f the board s i t u a t i o n the s i t u a t i o n the p l a y e r wants to s t a r t with 69 / 70 p u b l i c Othello ( i n t width, i n t height, S t r i n g s i t u a t i o n ) { 71 t h i s. board = new Board ( width, height, s i t u a t i o n ) ; 72 checkstate ( ) ; 73 } / 76 Checks f o r a l l c o n s t r u c t o r s i f black can make a move. 77 I f black can t i t s the turn o f white. I f white can t move e i t h e r, 78 the game i s f i n i s h e d. 79 / 80 p r i v a t e void checkstate ( ) { 81 i f (! ismovepossible ( F i e l d.black) ) { 82 i f (! ismovepossible ( F i e l d.white) ) { 83 // i f no moves are p o s s i b l e, the game i s i n s t a n t l y f i n i s h e d 84 t h i s. isrunning = f a l s e ; 85 } e l s e { 86 // i f black can t move but white can, i t s whites turn 87 t h i s. c u r r e n t P l a y e r = F i e l d.white; 88 } 89 } 90 } / 93 This method checks i f any move i s p o s s i b l e f o r p l a y e r p l a y e r the c o l o r o f the p l a y e r you want to check {@code true } i f any move i s p o s s i b l e, 96 o t h e r w i s e {@code f a l s e } 97 / 98 p r i v a t e boolean ismovepossible ( F i e l d p l a y e r ) { 99 return ( getpossiblemoves ( p l a y e r ). s i z e ( ) > 0) ; 100 } / 103 Get a l i s t o f a l l p o s s i b l e moves. p l a y e r the p l a y e r whose p o s s i b l e moves you want to get a l i s t o f a l l p o s s i b l e moves 106 / 107 p u b l i c List <Position > getpossiblemoves ( F i e l d p l a y e r ) { 108 i f (! isrunning ) { 109 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_NO_ACTIVE_GAME) ; 110 } List <Position > possiblemoves = new ArrayList<Position >() ; P o s i t i o n pos ; 115 f o r ( i n t x = 0 ; x < board. width ; x++) { 2

3 116 f o r ( i n t y = 0 ; y < board. h eight ; y++) { 117 pos = new P o s i t i o n ( x, y ) ; 118 i f ( ismovepositionvalid ( pos ) 119 && ( getnrofswitches ( player, pos ) > 0) ) { 120 possiblemoves. add ( pos ) ; 121 } 122 } 123 } return possiblemoves ; 126 } / 129 Checks i f a p o s i t i o n on the board has a c o l o r. 130 I f the p o s i t i o n i s not v a l i d ( e. g. n e g a t i v e array index ) i t 131 r e t u r n s {@code f a l s e }. pos the p o s i t i o n you want to check {@code true } i f a c o l o r i s at t h i s p o s i t i o n, 134 o t h e r w i s e {@code f a l s e } 135 / 136 p r i v a t e boolean haspiece ( P o s i t i o n pos ) { 137 boolean returnval = f a l s e ; i f ( board. ispositiononboard ( pos ) && board. get ( pos )!= n u l l 140 && board. get ( pos )!= F i e l d.hole) { 141 returnval = true ; 142 } return returnval ; 145 } / 148 Check i f a move p o s i t i o n i s v a l i d. This checks i f the p o s i t i o n 149 e x i s t s on the board, i f i t i s empty and i f a p i e c e i s adjacent. pos the p o s i t i o n you want to check {@code true } i f the move p o s i t i o n can be valid, 152 o t h e r w i s e {@code f a l s e } 153 / 154 p r i v a t e boolean ismovepositionvalid ( P o s i t i o n pos ) { 155 boolean ismovepositionvalid = f a l s e ; i f (! board. ispositiononboard ( pos ) ) { 158 r eturn f a l s e ; 159 } f o r ( i n t [ ] f i e l d : a d j a c t a n t F i e l d s ) { 162 P o s i t i o n tmp = new P o s i t i o n ( pos. x + f i e l d [ 0 ], 163 pos. y + f i e l d [ 1 ] ) ; 164 i f ( haspiece (tmp) ) { 165 ismovepositionvalid = true ; 166 } 167 } i f ( board. get ( pos. x, pos. y )!= n u l l ) { 170 // a p i e c e i s a l r e a dy on the f i e l d 171 ismovepositionvalid = f a l s e ; 172 } 173 3

4 174 return ismovepositionvalid ; 175 } / 178 Set the c u r r e n t p l a y e r to the next p l a y e r. 179 / 180 p r i v a t e void nextplayer ( ) { 181 i f (! isrunning ) { 182 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_NO_ACTIVE_GAME) ; 183 } i f ( c u r r e n t P l a y e r == F i e l d.black) { 186 c u r r e n t P l a y e r = F i e l d.white; 187 } e l s e { 188 c u r r e n t P l a y e r = F i e l d.black; 189 } 190 } / 193 Make a move, i f p o s s i b l e and return a code that i n d i c a t e s what 194 happened. pos the p o s i t i o n you want to s e t the next p i e c e on 0 i f the p l a y e r could move, i f the p l a y e r could not move, i f the next r e g u l a r p l a y e r had to pass, i f the game ended with t h i s move 200 / 201 p u b l i c i n t move( P o s i t i o n pos ) { 202 i f (! isrunning ) { 203 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_NO_ACTIVE_GAME) ; 204 } i n t returncode = 1; 207 i n t s w i t c h e s ; i f (! board. ispositiononboard ( pos ) ) { 210 throw new IllegalArgumentException (ERR_OFFBOARD_MOVE) ; 211 } i f ( ismovepositionvalid ( pos ) 214 && ( getnrofswitches ( currentplayer, pos ) > 0) ) { 215 board. s e t ( pos, c u r r e n t P l a y e r ) ; // switch a l l p i e c e s in between 218 f o r ( i n t [ ] d i r e c t i o n : a d j a c t a n t F i e l d s ) { 219 s w i t c h e s = getnrofincludedpieces ( currentplayer, pos, 220 d i r e c t i o n [ 0 ], d i r e c t i o n [ 1 ] ) ; 221 i f ( s w i t c h e s > 0) { 222 s w i t c h P i e c e s ( currentplayer, pos, d i r e c t i o n [ 0 ], d i r e c t i o n [ 1 ] ) ; 223 } 224 } // switch to the next p l a y e r 227 nextplayer ( ) ; i f (! ismovepossible ( getcurrentplayer ( ) ) ) { 230 F i e l d nextplayer = getwaitingplayer ( ) ; 4

5 231 i f ( ismovepossible ( nextplayer ) ) { 232 nextplayer ( ) ; 233 returncode = 1 ; 234 } e l s e { 235 s e t F i n i s h e d ( ) ; 236 returncode = 2 ; 237 } 238 } e l s e { 239 returncode = 0 ; 240 } submittedmove = true ; 243 } return returncode ; 246 } / 249 Get the c u r r e n t p l a y e r. the c u r r e n t p l a y e r 251 / 252 p u b l i c F i e l d getcurrentplayer ( ) { 253 return c u r r e n t P l a y e r ; 254 } / 257 This method determines the number o f p i e c e s o f the opponent 258 between the given p o s i t i o n and the next p i e c e o f the given p l a y e r. p l a y e r The p l a y e r. pos the p o s i t i o n o f one p i e c e o f t h i s p l a y e r. xdir t h i s has to be 1, 0 or means i t goes to the r i g h t, 1 to the l e f t means i t doesn t change the x d i r e c t i o n. ydir t h i s has to be 1, 0 or means i t goes to the bottom, 1 to the top means i t doesn t change the y d i r e c t i o n. the number o f p i e c e s o f the opponent between the given p o s i t i o n 268 and the next p i e c e o f the given p l a y e r. 269 / p r i v a t e i n t getnrofincludedpieces ( F i e l d player, P o s i t i o n pos, i n t xdir, i n t ydir ) { 272 i n t s w i t c h e s = 0 ; 273 i n t opponentcount = 0 ; 274 F i e l d opponent = ( p l a y e r == F i e l d.white? F i e l d.black : F i e l d.white ) ; f o r ( i n t tmp = 1 ; 277 // stop the loop i f you re no l o n g e r on the board 278 ( pos. x + tmp xdir >= 0) // important i f you go to the l e f t 279 && ( pos. x + tmp xdir < board. width ) // important i f you go to the r i g h t 280 && ( pos. y + tmp ydir >= 0) // important i f you go to the bottom 281 && ( pos. y + tmp ydir < board. height ) ; // important i f you go to the top 282 tmp++) { 5

6 F i e l d p i e c e = board. get ( pos. x + tmp xdir, pos. y + tmp ydir ) ; i f ( p i e c e == p l a y e r ) { 287 s w i t c h e s += opponentcount ; 288 opponentcount = 0 ; 289 break ; 290 } e l s e i f ( p i e c e == F i e l d.hole) { 291 r eturn 0 ; 292 } e l s e i f ( p i e c e == opponent ) { 293 opponentcount++; 294 } e l s e i f ( p i e c e == n u l l ) { 295 r eturn 0 ; 296 } 297 } return s w i t c h e s ; 300 } / 303 Switch a l l p i e c e s from the opponent o f p l a y e r in the given d i r e c t i o n. 304 Make sure that in the given d i r e c t i o n i s one o f the p i e c e s o f p l a y e r at the end. p l a y e r the given p l a y e r who s e t the new p i e c e pos the p o s i t i o n where you want to s t a r t xdir one part o f the d i r e c t i o n ydir other part o f the d i r e c t i o n 309 / 310 p r i v a t e void s w i t c h P i e c e s ( F i e l d player, P o s i t i o n pos, i n t xdir, i n t ydir ) { 311 i f (! isrunning ) { 312 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_NO_ACTIVE_GAME) ; 313 } F i e l d opponent = ( p l a y e r == F i e l d.white? F i e l d.black : F i e l d.white ) ; // t h i s ends always with the break as one p i e c e o f p l a y e r has to be at the end 318 f o r ( i n t tmp = 1 ; ; tmp++) { 319 i f ( board. get ( pos. x + tmp xdir, pos. y + tmp ydir ) == p l a y e r ) { 320 break ; 321 } e l s e i f ( board. get ( pos. x + tmp xdir, pos. y + tmp ydir ) == opponent ) { 322 board. s e t ( pos. x + tmp xdir, pos. y + tmp ydir, p l a y e r ) ; 323 } 324 } 325 } / 328 Return the number o f p i e c e s that get switched when p l a y e r s e t s 329 a new p i e c e on ( x y ) p l a y e r the given p l a y e r pos the p o s i t i o n o f the new p i e c e the number o f switched p i e c e s. 6

7 333 / 334 p r i v a t e i n t getnrofswitches ( F i e l d player, P o s i t i o n pos ) { 335 i n t s w i t c h e s = 0 ; f o r ( i n t [ ] d i r e c t i o n : a d j a c t a n t F i e l d s ) { 338 s w i t c h e s += getnrofincludedpieces ( player, pos, d i r e c t i o n [ 0 ], d i r e c t i o n [ 1 ] ) ; 339 } return s w i t c h e s ; 342 } / 345 Return the r e s u l t. an array with two elements where the f i r s t element 347 r e p r e s e n t s the p o i n t s 348 o f the white p l a y e r and the second element the p o i n t s o f the second p l a y e r 349 / 350 p u b l i c i n t [ ] g e t R e s u l t ( ) { 351 i n t [ ] r e s u l t = new i n t [ 2 ] ; 352 r e s u l t [ 0 ] = countpieces ( F i e l d.white) ; 353 r e s u l t [ 1 ] = countpieces ( F i e l d.black) ; 354 return r e s u l t ; 355 } // t h i s method counts the p i e c e s o f one p l a y e r on the board 358 p r i v a t e i n t countpieces ( F i e l d p l a y e r ) { 359 i n t counter = 0 ; 360 f o r ( i n t x = 0 ; x < board. width ; x++) { 361 f o r ( i n t y = 0 ; y < board. h eight ; y++) { 362 i f ( board. get ( x, y ) == p l a y e r ) { 363 counter++; 364 } 365 } 366 } 367 return counter ; 368 } / 371 Mark the game as f i n i s h e d. 372 / 373 p u b l i c void s e t F i n i s h e d ( ) { 374 i f (! isrunning ) { 375 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_NO_ACTIVE_GAME) ; 376 } isrunning = f a l s e ; 379 } / 382 Getter f o r isrunning. {@code true } i f the game i s s t i l l in progress, 384 o t h e r w i s e {@code f a l s e } 385 / 386 p u b l i c boolean isrunning ( ) { 387 return isrunning ; 388 } 7

8 / 391 Checks i f the r e c t a n g l e i s within the borders o f the board and 392 i f the f i r s t p o s i t i o n i s at the top l e f t and the second i s at 393 the bottom r i g h t. r e c t a n g l e the r e c t a n g l e {@code true } i f the r e c t a n g l e i s v a l i d according to the 396 s p e c i f i c a t i o n, o t h e r w i s e {@code f a l s e } 397 / 398 p u b l i c boolean i s V a l i d R e c t a n g l e ( P o s i t i o n [ ] r e c t a n g l e ) { 399 i f (! board. ispositiononboard ( r e c t a n g l e [ 0 ] ) ) { 400 r eturn f a l s e ; 401 } e l s e i f (! board. ispositiononboard ( r e c t a n g l e [ 1 ] ) ) { 402 r eturn f a l s e ; 403 } e l s e i f ( r e c t a n g l e [ 0 ]. x > r e c t a n g l e [ 1 ]. x ) { 404 r eturn f a l s e ; 405 } e l s e i f ( r e c t a n g l e [ 0 ]. y > r e c t a n g l e [ 1 ]. y ) { 406 r eturn f a l s e ; 407 } e l s e { 408 r eturn true ; 409 } 410 } / 413 Check i f a p i e c e i s in the s p e c i f i e d r e c t a n g l e. r e c t a n g l e the s p e c i f i e d r e c t a n g l e {@code true } i f a p i e c e i s in the s p e c i f i e d r e c t a n g l e, 416 o t h e r w i s e {@code f a l s e } 417 / 418 p u b l i c boolean i s C o l o r I n R e c t a n g l e ( P o s i t i o n [ ] r e c t a n g l e ) { 419 i f (! i s V a l i d R e c t a n g l e ( r e c t a n g l e ) ) { 420 throw new IllegalArgumentException (ERR_NO_VALID_RECTANGLE) ; 421 } f o r ( i n t x = r e c t a n g l e [ 0 ]. x ; x <= r e c t a n g l e [ 1 ]. x ; x++) { 424 f o r ( i n t y = r e c t a n g l e [ 0 ]. y ; y <= r e c t a n g l e [ 1 ]. y ; y++) { 425 i f ( board. get ( x, y ) == F i e l d.black board. get ( x, y ) == F i e l d.white) { 426 r eturn true ; 427 } 428 } 429 } return f a l s e ; 432 } / 435 Make an hole i n t o the board i f p o s s i b l e. r e c t a n g l e The edges o f the r e c t a n g l e o f the hole {@code true } i f a hole could be created, o t h e r w i s e {@code f a l s e } 438 / 439 p u b l i c boolean makehole ( P o s i t i o n [ ] r e c t a n g l e ) { 440 i f ( submittedmove ) { 441 throw new I l l e g a l S t a t e E x c e p t i o n (ERR_PLAYER_MOVED) ; 442 } e l s e i f (! i s V a l i d R e c t a n g l e ( r e c t a n g l e ) ) { 443 throw new IllegalArgumentException (ERR_NO_VALID_RECTANGLE) ; 444 } e l s e i f ( i s C o l o r I n R e c t a n g l e ( r e c t a n g l e ) ) { 8

9 445 throw new IllegalArgumentException (ERR_COLOR_IN_RECTANGLE) ; 446 } f o r ( i n t x = r e c t a n g l e [ 0 ]. x ; x <= r e c t a n g l e [ 1 ]. x ; x++) { 449 f o r ( i n t y = r e c t a n g l e [ 0 ]. y ; y <= r e c t a n g l e [ 1 ]. y ; y++) { 450 board. s e t ( x, y, F i e l d.hole) ; 451 } 452 } // Switch to the other p l a y e r i f the c u r r e n t p l a y e r can t move any l o n g e r 455 i f ( getpossiblemoves ( c u r r e n t P l a y e r ). s i z e ( ) == 0) { 456 nextplayer ( ) ; 457 } return true ; 460 } / 463 Was a move a l r e a d y submitted? {@code true } i f a move was a lready submitted, o t h e r w i s e f a l s e } 465 / 466 p u b l i c boolean wasmovesubmitted ( ) { 467 return submittedmove ; 468 } / 471 This method aborts the c u r r e n t game and r e t u r n s the r e s u l t. the r e s u l t as an i n t array with two elements where {@code r e s u l t [ 0 ] } 473 r e p r e s e n t s the p o i n t s o f the white p l a y e r and {@code r e s u l t [ 1 ] } r e p r e s e n t s the 474 p o i n t s o f the black p l a y e r 475 / 476 p u b l i c i n t [ ] abortgame ( ) { 477 i n t [ ] r e s u l t = g e t R e s u l t ( ) ; 478 s e t F i n i s h e d ( ) ; 479 return r e s u l t ; 480 } / 483 Get the p l a y e r who can t make a turn by now. the p l a y e r who can t make a turn by now 485 / 486 p u b l i c F i e l d getwaitingplayer ( ) { 487 return getcurrentplayer ( ) == F i e l d.black? F i e l d.white : F i e l d. BLACK; 488 } 489 } Othello.java 9