Skip to content

C
chess
Commit 80bf4e90 authored by hosein's avatar hosein
Browse files
Options

playground -> isCheck added

parent 8519d4bf
Show whitespace changes
Inline Side-by-side
Showing with 45 additions and 113 deletions
src/pack/PlayGround.java
View file @ 80bf4e90
...@@ -5,7 +5,7 @@ import pack.Nuts.*; ...@@ -5,7 +5,7 @@ import pack.Nuts.*;
import java.util.HashMap; import java.util.HashMap;
public class PlayGround { public class PlayGround {
private int[][] ground; private static int[][] ground;
private HashMap<Nut, Integer> nutsID; private HashMap<Nut, Integer> nutsID;
private Pawn[] wPawns, bPawns; private Pawn[] wPawns, bPawns;
private Rook[] wRooks, bRooks; private Rook[] wRooks, bRooks;
...@@ -106,104 +106,19 @@ public class PlayGround { ...@@ -106,104 +106,19 @@ public class PlayGround {
} }
public void showPlayGround() {
System.out.print(" a b c d e f g h\n _ _ _ _ _ _ _ _\n");
for (int i = 0, j; i < 8; i++) {
System.out.print((8 - i) + " ");
for (j = 0; j < 8; j++) {
switch (ground[i][j]) {
case 0:
System.out.print("| ");
break;
case 1:
case 2:
case 3:
case 4:
case 5:
case 6:
case 7:
case 8:
System.out.print("|P");
break;
case -1:
case -2:
case -3:
case -4:
case -5:
case -6:
case -7:
case -8:
System.out.print("|p");
break;
case 9:
case 10:
System.out.print("|R");
break;
case -9:
case -10:
System.out.print("|r");
break;
case 11:
case 12:
System.out.print("|K");
break;
case -11:
case -12:
System.out.print("|k");
break;
case 13:
case 14:
System.out.print("|B");
break;
case -13:
case -14:
System.out.print("|b");
break;
case 15:
System.out.print("|Q");
break;
case -15:
System.out.print("|q");
break;
case 16:
System.out.print("|X");
break;
case -16:
System.out.print("|x");
}
}
System.out.print("|\n");
}
System.out.println(" ¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯ ");
}
public short canMove(String[] string, int turn) { public short canMove(String[] string, int turn) {
int id1 = getNutID(string[0].charAt(0), (short) (string[0].charAt(1))); int id1 = getNutID(string[0].charAt(0), (short) (string[0].charAt(1))), id2 = getNutID(string[1].charAt(0), (short) (string[1].charAt(1)));
int id2 = getNutID(string[1].charAt(0), (short) (string[1].charAt(1)));
if (id1 == 0) //6 mabda mohree nist if (id1 == 0) //6 mabda mohree nist
return 6; return 6;
if (id1 * id2 > 0) //2 destination is not empty if (id1 * turn < 0) //7 check turn
return 7;
if ((Math.abs(id1) < 9 && string[0].charAt(0) == string[1].charAt(0) && id2 != 0) || (id1 * id2 > 0)) //2 check destination is empty or enemy nut
return 2; return 2;
Nut j = null; Nut j = null;
// Todo shayad bekhad on mohre ro bezare jelosh short check; //4 cant move because of check
boolean check; //4 cant move because of check
for (Nut i : nutsID.keySet()) { for (Nut i : nutsID.keySet()) {
j = i; j = i;
if (nutsID.get(i) == id1) { if (nutsID.get(i) == id1) {
...@@ -212,12 +127,9 @@ public class PlayGround { ...@@ -212,12 +127,9 @@ public class PlayGround {
} }
} }
if (turn == 1) check = isCheck();
check = wKing.isCheck();
else
check = bKing.isCheck();
j.move(getDestination(string[0].charAt(0), (short) (string[0].charAt(1)))); j.move(getDestination(string[0].charAt(0), (short) (string[0].charAt(1))));
if (check) return 4; if (check != 0) return 4;
j = null; j = null;
...@@ -236,7 +148,8 @@ public class PlayGround { ...@@ -236,7 +148,8 @@ public class PlayGround {
// the route can not be traversed // the route can not be traversed
for (Nut i : nutsID.keySet()) { for (Nut i : nutsID.keySet()) {
if (nutsID.get(i) == id1) { if (nutsID.get(i) == id1) {
if (!i.canRoute()) return 3; if (!i.canRoute(getDestination(string[1].charAt(0), (short) (string[1].charAt(1))), getGround()))
return 3;
else break; else break;
} }
} }
...@@ -245,33 +158,52 @@ public class PlayGround { ...@@ -245,33 +158,52 @@ public class PlayGround {
return 1; //1 can move return 1; //1 can move
} }
//todo first move pawn ke mitone 2 ta bere!
public void moveNut(String[] string) { public void moveNut(String[] string) {
if (getNutID(string[1].charAt(0), (short) string[1].charAt(1)) == 0) int id2 = getNutID(string[1].charAt(0), (short) string[1].charAt(1)), id1 = getNutID(string[0].charAt(0), (short) string[0].charAt(1));
if (id2 != 0)
removeNut(id2);
for (Nut i : nutsID.keySet())
for (Nut i : nutsID.keySet()) {
if (nutsID.get(i) == getNutID(string[0].charAt(0), (short) (string[0].charAt(1)))) { if (nutsID.get(i) == getNutID(string[0].charAt(0), (short) (string[0].charAt(1)))) {
i.move(getDestination(string[1].charAt(0), (short) (string[1].charAt(1)))); i.move(getDestination(string[1].charAt(0), (short) (string[1].charAt(1))));
break; break;
} }
}
ground[getDestination(string[0].charAt(0), (short) string[0].charAt(1))[0]][getDestination(string[0].charAt(0), (short) string[0].charAt(1))[1]] = 0;
ground[getDestination(string[1].charAt(0), (short) string[1].charAt(1))[0]][getDestination(string[1].charAt(0), (short) string[1].charAt(1))[1]] = id1;
} }
public int getNutID(char c, short s) { private void removeNut(int id) {
return ground[8 - s][(int) (c) - 97]; for (Nut i : nutsID.keySet())
if (nutsID.get(i) == id) {
i.changeAlive();
nutsID.remove(i, id);
break;
}
} }
public int getNutID(int i, int j) { public int getNutID(char c, short s) {
return ground[i][j]; return ground[56 - s][(int) (c) - 97];
} }
public int[] getDestination(char c, short s) { public int[] getDestination(char c, short s) {
int[] r = new int[2]; int[] r = new int[2];
r[0] = 8 - s; r[0] = 56 - s;
r[1] = (int) c - 97; r[1] = (int) c - 97;
return r; return r;
} }
public static int[][] getGround() {
return ground;
}
public short isCheck() {
return 0;
}
} }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment