haissous/SAE41_2022
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

algo de notation du bot ok (normalement(j'espere))

Browse Source
This commit is contained in:
Haïssous Kayyissa 2023-04-08 10:12:57 +02:00
parent cd3bcb4176
commit db5dfdb21b
1 changed files with 34 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

49
app/src/main/java/com/example/mastermind/game/Bot.java
View File

@ -36,25 +36,50 @@ public class Bot {
public Integer[] notation(Integer[] soumission){ public Integer[] notation(Integer[] soumission){
LinkedList<Integer> note=new LinkedList<>(); LinkedList<Integer> note=new LinkedList<>();
Integer[] copyCombi = new Integer[4];
System.arraycopy(this.collectionWin, 0, copyCombi, 0,4);
//noirs
for(int i=0; i<4;i++) { for(int i=0; i<4;i++) {
if (this.collectionWin[i]==soumission[i]) { if (copyCombi[i]==soumission[i]) {
note.add(this.pionsNotation[1]);
copyCombi[i]=-1;
System.out.println(note.getLast()+" good "+i);
}
}
//blancs
for(int i=0; i<4;i++) {
if(copyCombi[i]!=-1){
for (int y=0;y<4;y++){
if (soumission[y]==copyCombi[i]) {
note.add(this.pionsNotation[0]);
System.out.println(note.getLast() + " almost "+i);
copyCombi[i] = -1;
}
}
}
}
/* Integer[] copyCombi = new Integer[4];
System.arraycopy(this.collectionWin, 0, copyCombi, 0,4);
for(int i=0; i<4;i++) {
for(int y=0;y<4;y++){
if(i==y&&soumission[i]==copyCombi[y]){
note.add(this.pionsNotation[1]); note.add(this.pionsNotation[1]);
System.out.println(note.getLast()+" good"); System.out.println(note.getLast()+" good");
} copyCombi[y]=-1;
} break;
//On crée une copie de la combinaison gagnante pour la modifier et éviter la fausse répétition de pions blancs } else if (soumission[i]==copyCombi[y]){
Integer[] copyCombi = this.collectionWin;
for(int i=0; i<4;i++) {
for (int y=0; y<4;y++) {
if (i!=y){
if (copyCombi[y] == soumission[i]){
note.add(this.pionsNotation[0]); note.add(this.pionsNotation[0]);
System.out.println(note.getLast()+" almost"); System.out.println(note.getLast()+" almost");
copyCombi[y]=null; copyCombi[y]=-1;
} break;
}
} }
} }
}*/
// On complête avec des cases vides // On complête avec des cases vides
while (note.size()<4){ while (note.size()<4){
note.addLast(this.pionVide); note.addLast(this.pionVide);