This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public boolean networkParser(int playerColor) { | |
boolean hasLeft,hasRight,hasTop,hasBottom; | |
Piece[] networkTop, networkBottom, networkLeft, networkRight; | |
if (playerColor == 0){ | |
hasTop = false; | |
hasBottom = false; | |
networkTop = new Piece[8]; | |
networkBottom = new Piece[8]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package player; | |
public abstract class MyBoard { | |
/** | |
* @param args | |
*/ | |
private Piece[][] pieces = new Piece[8][8]; | |
public boolean isValidMove(Move m){ | |
return false; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private boolean networkParser(int playerColor) { | |
//find piece on left side and right side | |
boolean hasLeft,hasRight,hasTop,hasBottom; | |
Piece[] networkTop, networkBottom, networkLeft, networkRight; | |
if (playerColor == 0){ | |
hasTop = false; | |
hasBottom = false; | |
networkTop = new Piece[8]; | |
networkBottom = new Piece[8]; |