quentinlegot/Othello
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

méthode de clonage

Browse Source
This commit is contained in:
Antonin Boyon 2021-02-10 10:22:22 +01:00
commit c83f098aa5
3 changed files with 24 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.gitignore vendored
View File

@ -1,3 +1,4 @@
/bin/
.project
.classpath
.metadata/

8
src/othello/Main.java
View File

@ -7,6 +7,14 @@ public class Main {
public static void main(String[] args) {
for (int k=-1; k<2;k++) {
for (int l=-1; l<2; l++) {
if (k!=0 || l!=0) {
System.out.println(k+";"+l);
}
}
}
int p1 = 1, p2 = 2;
int[][] board = initialize(p1, p2);
State game = new State(board, p1, p2,0,0);

15
src/othello/State.java
View File

@ -36,12 +36,25 @@ public class State {
// Recherche autour du pion du joueur courant
for (int k=-1; k<2;k++) {
for (int l=-1; l<2; l++) {
<<<<<<< HEAD
// La position du pion trouvé est exclue
if (k!=0 || l!=0) {
// Si une place libre est trouvée elle est ajoutée à la liste de coups
if ( ((i+k >= 0) && (i+k < 7 )) && ((j+l >= 0) && (j+l < 7 )) && (this.board[i+k][j+l]==0)) {
=======
<<<<<<< HEAD
if (k!=0 || l!=0) {
=======
// La position du pion trouv<EFBFBD> est exclue
if (k!=0 || l!=0) {
// Si une place libre est trouv<EFBFBD>e elle est ajout<EFBFBD> <EFBFBD> la liste de coups
System.out.println("close");
if ( (this.board[i+k][j+l]==0) && (i+k >= 0) && (i+k < 7 ) && (j+l >= 0) && (j+l < 7 ) ) {
System.out.println("jadd");
>>>>>>> 2263d0614b420497f888985e269e89cd19670bab
>>>>>>> a28cb1daa55fe0e031900c11927481008e642a1b
moves.add(new Point(i+k, j+l));
}
}
}
}