Compare commits
9 Commits
heuristic-
...
master
| Author | SHA1 | Date | |
|---|---|---|---|
| fc6e6b9fa6 | |||
| 8cad839e4d | |||
| d2f34577e2 | |||
| ebfc2df29b | |||
| 9a1ae37130 | |||
| 2dfc6014e0 | |||
| 3aec1d3f6e | |||
| a7d3e9d138 | |||
| f207da0e2b |
131
README.md
131
README.md
@@ -1,115 +1,56 @@
|
||||
# Instructions de Travail sur les Tickets
|
||||
|
||||
Ce document présente la procédure à suivre lors de la création et de la gestion des tickets de développement. Veuillez suivre chaque étape avec attention.
|
||||
## 1. Création du Ticket
|
||||
|
||||
### Titre du Ticket
|
||||
|
||||
Le titre doit décrire de manière générale la tâche à réaliser. Soyez précis, mais sans entrer dans les détails techniques. Par exemple :
|
||||
|
||||
Ajout d'une nouvelle fonctionnalité de recherche dans l'application
|
||||
|
||||
Correction du bug d'affichage sur la page d'accueil
|
||||
|
||||
### Description du Ticket
|
||||
|
||||
La description doit fournir une explication légèrement détaillée des tâches à réaliser. Elle doit inclure les éléments suivants :
|
||||
|
||||
Objectif global de la tâche
|
||||
|
||||
Étapes spécifiques ou parties du projet concernées
|
||||
|
||||
Comportement attendu une fois la tâche accomplie
|
||||
# BUT3 – Projet Jeu : Hex
|
||||
|
||||
|
||||
## 2. Création de la Branche
|
||||
Il s’agit d’une implémentation du jeu **Hex** en Java, développée à partir de l’API fournie par le Monsieur Madelaine.
|
||||
Le projet comprend un moteur de jeu fonctionnel, un affichage console pour le debug, ainsi que des bots permettant de jouer automatiquement.
|
||||
|
||||
Lorsque vous commencez à travailler sur un ticket, créez une nouvelle branche avec un nom particulier qui reflète le ticket en cours. Le format de la branche doit être :
|
||||
|
||||
nom-de-la-feature-#numeroduticket
|
||||
## Compilation
|
||||
|
||||
### Pour créer une branche :
|
||||
Depuis la racine du projet, compiler l’ensemble des fichiers Java avec la commande suivante :
|
||||
|
||||
git checkout -b feature-recherche-#123
|
||||
|
||||
## 3. Commit des Changements
|
||||
|
||||
Les commits doivent suivre la convention suivante :
|
||||
|
||||
- Le message de commit doit décrire brièvement le changement effectué.
|
||||
|
||||
- À la fin du message de commit, vous devez toujours ajouter le numéro du ticket pour faciliter le suivi des tâches.
|
||||
|
||||
Exemple de message de commit :
|
||||
|
||||
Ajout du champ de recherche sur la page d'accueil #123
|
||||
|
||||
## 4. Push de la Branche
|
||||
|
||||
Après avoir effectué vos changements et effectué vos commits, vous devrez pousser la branche sur le dépôt distant. Lors de votre premier git push, vous recevrez un message pour définir l'upstream de la branche.
|
||||
|
||||
Exemple de message affiché :
|
||||
|
||||
```
|
||||
fatal: The upstream branch 'origin/feature-recherche-#123' does not exist
|
||||
To push the branch and set the upstream, use the following command:
|
||||
git push --set-upstream origin nom-de-la-feature-#numero
|
||||
```bash
|
||||
javac -d build $(find javaAPI -name "*.java")
|
||||
```
|
||||
|
||||
|
||||
Vous devez copier et coller la commande dans votre terminal pour effectuer le push. Une fois cette commande exécutée, votre branche sera poussée vers le dépôt distant.
|
||||
|
||||
## 5. Création d'une Pull Request (PR)
|
||||
|
||||
Une fois que vous avez poussé votre branche sur Gitea, vous devez ouvrir une pull request pour demander la révision de votre code.
|
||||
|
||||
Voici les étapes pour créer une pull request correctement :
|
||||
|
||||
- Allez sur Gitea et naviguez vers le projet concerné.
|
||||
|
||||
- Cliquez sur "Branches" et vous devriez voir la branche que vous venez de pousser.
|
||||
|
||||
- Cliquez sur le bouton "Create Pull Request" à côté de votre branche.
|
||||
|
||||
Remplissez les informations nécessaires :
|
||||
|
||||
- Titre de la PR : Utilisez le même titre que celui du ticket.
|
||||
|
||||
- Description de la PR : Décrivez brièvement ce que votre PR accomplit. Vous pouvez vous baser sur la description du ticket.
|
||||
|
||||
- Revues : Assurez-vous de demander une révision par deux membres de l’équipe.
|
||||
|
||||
- Cliquez sur "Create Pull Request" pour soumettre.
|
||||
|
||||
Une fois la PR ouverte, vous devrez attendre la révision et l’approbation de l’équipe avant de pouvoir fusionner la branche dans main ou develop selon le flux de travail de votre projet.
|
||||
Les fichiers compilés (`.class`) sont générés dans le dossier `bin`.
|
||||
|
||||
|
||||
# Résumé des Commandes Git :
|
||||
## Lancer une démonstration
|
||||
|
||||
Voici un récapitulatif des commandes Git que vous utiliserez fréquemment :
|
||||
### Partie automatique (bot)
|
||||
|
||||
## 1. Créer une branche
|
||||
```bash
|
||||
java -cp build fr.iut_fbleau.HexGame.HexMain 3 autoplay
|
||||
```
|
||||
|
||||
git checkout -b feature-recherche-#123
|
||||
Ce mode permet de lancer une partie entièrement automatique en utilisant le bot implémenté dans la classe `Simulation`.
|
||||
|
||||
### Partie interactive (joueur humain)
|
||||
|
||||
```bash
|
||||
java -cp build fr.iut_fbleau.HexGame.HexMain
|
||||
```
|
||||
|
||||
Le plateau s’affiche dans le terminal et les coups sont entrés sous forme de coordonnées.
|
||||
|
||||
|
||||
## 2. Ajouter les fichiers modifiés :
|
||||
## Tests et validation
|
||||
|
||||
git add .
|
||||
git add *
|
||||
git add <nom_du_fichier>
|
||||
Les tests sont réalisés sous forme de **tests fonctionnels** via des méthodes `main` et des modes de démonstration :
|
||||
- vérification de la validité des coups,
|
||||
- alternance correcte des joueurs,
|
||||
- détection des conditions de fin de partie,
|
||||
- exécution de parties complètes en mode automatique.
|
||||
|
||||
L’affichage console du plateau, fourni par la méthode `HexBoard.toString()`, est utilisé comme outil de debug pour visualiser l’état du jeu à chaque tour.
|
||||
|
||||
|
||||
## 3. Commit des changements :
|
||||
## Organisation du projet
|
||||
|
||||
git commit -m "Ajout de [...] #numeroticket"
|
||||
- `HexBoard` : représentation du plateau et gestion des règles du jeu
|
||||
- `HexPly` : représentation d’un coup
|
||||
- `Simulation` : bot basé sur une recherche Minimax à profondeur limitée
|
||||
- `HexMain` : point d’entrée du programme
|
||||
|
||||
|
||||
## 4. Pousser la branche
|
||||
|
||||
git push -set-upstream origin <nom-de-la-branche-#numeroticket>
|
||||
|
||||
|
||||
## 5. Supprimer une branche
|
||||
|
||||
git branch -d <nom_de_la_branche>
|
||||
Les classes principales sont documentées à l’aide de **Javadoc**.
|
||||
9784
Rapport Hex.pdf
Normal file
9784
Rapport Hex.pdf
Normal file
File diff suppressed because it is too large
Load Diff
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
@@ -1,7 +0,0 @@
|
||||
Bot 1, Bot 2, Winner
|
||||
RandomBot,MiniMaxBot,WIN
|
||||
RandomBot,HeuristicBot,WIN
|
||||
RandomBot,MonteCarloBot,WIN
|
||||
MiniMaxBot,HeuristicBot,WIN
|
||||
MiniMaxBot,MonteCarloBot,WIN
|
||||
HeuristicBot,MonteCarloBot,WIN
|
||||
|
@@ -34,8 +34,8 @@ public abstract class AbstractGame {
|
||||
|
||||
// constructeur à appeler dans le constructeur d'un fils concret avec super.
|
||||
public AbstractGame(IBoard b, EnumMap<Player,AbstractGamePlayer> m){
|
||||
this.currentBoard=b;
|
||||
this.mapPlayers=m;
|
||||
this.currentBoard=b;
|
||||
this.mapPlayers=m;
|
||||
}
|
||||
|
||||
/**
|
||||
|
||||
@@ -1,64 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
|
||||
import java.io.FileWriter;
|
||||
import java.io.IOException;
|
||||
import java.util.ArrayList;
|
||||
import java.util.EnumMap;
|
||||
import java.util.List;
|
||||
|
||||
public class Arena {
|
||||
|
||||
private List<AbstractGamePlayer> bots = new ArrayList<>();
|
||||
private FileWriter csvWriter;
|
||||
private int board_size;
|
||||
|
||||
public Arena(int size) {
|
||||
try {
|
||||
csvWriter = new FileWriter("arena_results.csv");
|
||||
csvWriter.append("Bot 1, Bot 2, Winner\n");
|
||||
this.board_size = size;
|
||||
} catch (IOException e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
}
|
||||
|
||||
public void addBot(AbstractGamePlayer bot) {
|
||||
bots.add(bot);
|
||||
}
|
||||
|
||||
public void run() {
|
||||
for (int i = 0; i < bots.size(); i++) {
|
||||
for (int j = i + 1; j < bots.size(); j++) {
|
||||
AbstractGamePlayer bot1 = bots.get(i);
|
||||
AbstractGamePlayer bot2 = bots.get(j);
|
||||
|
||||
System.out.println("Running match: " + bot1.getClass().getSimpleName() + " vs " + bot2.getClass().getSimpleName());
|
||||
Result result = playMatch(bot1, bot2);
|
||||
|
||||
try {
|
||||
csvWriter.append(bot1.getClass().getSimpleName() + "," + bot2.getClass().getSimpleName() + "," + result + "\n");
|
||||
} catch (IOException e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
try {
|
||||
csvWriter.close();
|
||||
} catch (IOException e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
}
|
||||
|
||||
private Result playMatch(AbstractGamePlayer bot1, AbstractGamePlayer bot2) {
|
||||
IBoard board = new HexBoard(this.board_size);
|
||||
EnumMap<Player, AbstractGamePlayer> players = new EnumMap<>(Player.class);
|
||||
players.put(Player.PLAYER1, bot1);
|
||||
players.put(Player.PLAYER2, bot2);
|
||||
|
||||
Simulation simulation = new Simulation(board, players);
|
||||
return simulation.run();
|
||||
}
|
||||
}
|
||||
@@ -1,19 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.Player;
|
||||
|
||||
public class ArenaMain {
|
||||
public static void main(String[] args) {
|
||||
int size = 7;
|
||||
if (args.length >= 1) {
|
||||
try { size = Integer.parseInt(args[0]); } catch (NumberFormatException ignored) {}
|
||||
}
|
||||
Arena arena = new Arena(size);
|
||||
arena.addBot(new RandomBot(Player.PLAYER1, 12345L)); // Correct constructor usage
|
||||
arena.addBot(new MiniMaxBot(Player.PLAYER2));
|
||||
arena.addBot(new HeuristicBot(Player.PLAYER1));
|
||||
arena.addBot(new MonteCarloBot(Player.PLAYER2)); // Correct constructor usage
|
||||
|
||||
arena.run();
|
||||
}
|
||||
}
|
||||
@@ -1,49 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
|
||||
public class HeuristicBot extends AbstractGamePlayer {
|
||||
|
||||
public HeuristicBot(Player me) {
|
||||
super(me); // Correct constructor usage
|
||||
}
|
||||
|
||||
@Override
|
||||
public AbstractPly giveYourMove(IBoard board) {
|
||||
HexBoard hb = (HexBoard) board;
|
||||
float bestScore = -Float.MAX_VALUE;
|
||||
HexPly bestMove = null;
|
||||
|
||||
for (int i = 0; i < hb.getSize(); i++) {
|
||||
for (int j = 0; j < hb.getSize(); j++) {
|
||||
HexPly move = new HexPly(hb.getCurrentPlayer(), i, j);
|
||||
if (hb.isLegal(move)) {
|
||||
hb.doPly(move);
|
||||
float score = evaluateBoard(hb);
|
||||
if (score > bestScore) {
|
||||
bestScore = score;
|
||||
bestMove = move;
|
||||
}
|
||||
hb.undoPly();
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestMove;
|
||||
}
|
||||
|
||||
private float evaluateBoard(HexBoard board) {
|
||||
int size = board.getSize();
|
||||
int center = size / 2;
|
||||
float score = 0;
|
||||
//HexBoard simBoard = (HexBoard) board.safeCopy();
|
||||
|
||||
for (int i = 0; i < size; i++) {
|
||||
for (int j = 0; j < size; j++) {
|
||||
if (board.getCellPlayer(i, j) == Player.PLAYER1) {
|
||||
score += Math.abs(i - center) + Math.abs(j - center); // Distance from center
|
||||
}
|
||||
}
|
||||
}
|
||||
return score;
|
||||
}
|
||||
}
|
||||
@@ -308,10 +308,4 @@ public class HexBoard extends AbstractBoard {
|
||||
sb.append("Current player: ").append(getCurrentPlayer()).append("\n");
|
||||
return sb.toString();
|
||||
}
|
||||
|
||||
|
||||
public Player getCellPlayer(int r, int c) {
|
||||
return cells[r][c];
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
@@ -1,52 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.Player;
|
||||
import fr.iut_fbleau.GameAPI.Result;
|
||||
|
||||
import javax.swing.*;
|
||||
import java.awt.*;
|
||||
|
||||
public class HexFrame {
|
||||
|
||||
public static void main(String[] args) {
|
||||
SwingUtilities.invokeLater(() -> {
|
||||
int size = 11;
|
||||
if (args.length >= 1) {
|
||||
try { size = Integer.parseInt(args[0]); } catch (NumberFormatException ignored) {}
|
||||
}
|
||||
|
||||
HexBoard board = new HexBoard(size);
|
||||
|
||||
JFrame frame = new JFrame("Hex - " + size + "x" + size);
|
||||
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
|
||||
frame.setLayout(new BorderLayout());
|
||||
|
||||
JLabel statusLabel = new JLabel("", SwingConstants.CENTER);
|
||||
statusLabel.setFont(statusLabel.getFont().deriveFont(Font.BOLD, 18f));
|
||||
statusLabel.setBorder(BorderFactory.createEmptyBorder(10, 10, 10, 10));
|
||||
|
||||
HexPanel panel = new HexPanel(board, statusLabel);
|
||||
|
||||
frame.add(statusLabel, BorderLayout.NORTH);
|
||||
frame.add(panel, BorderLayout.CENTER);
|
||||
|
||||
// Taille confortable
|
||||
frame.pack();
|
||||
frame.setLocationRelativeTo(null);
|
||||
frame.setVisible(true);
|
||||
|
||||
// Message initial
|
||||
updateStatus(board, statusLabel);
|
||||
});
|
||||
}
|
||||
|
||||
static void updateStatus(HexBoard board, JLabel statusLabel) {
|
||||
if (board.isGameOver()) {
|
||||
Result r = board.getResult(); // résultat du point de vue PLAYER1
|
||||
Player winner = (r == Result.WIN) ? Player.PLAYER1 : Player.PLAYER2;
|
||||
statusLabel.setText("" + winner + " a gagné !");
|
||||
} else {
|
||||
statusLabel.setText("C'est à " + board.getCurrentPlayer() + " de jouer");
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1,166 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.Player;
|
||||
|
||||
import javax.swing.*;
|
||||
import java.awt.*;
|
||||
import java.awt.event.MouseAdapter;
|
||||
import java.awt.event.MouseEvent;
|
||||
import java.awt.geom.Path2D;
|
||||
|
||||
/**
|
||||
* Panel Swing qui dessine un plateau Hex en hexagones et gère les clics.
|
||||
*
|
||||
* Grille "flat-top" (hexagones à sommet plat en haut),
|
||||
* avec décalage vertical d'une demi-hauteur une colonne sur deux.
|
||||
*/
|
||||
public class HexPanel extends JPanel {
|
||||
|
||||
private final HexBoard board;
|
||||
private final JLabel statusLabel;
|
||||
|
||||
// Rayon (distance centre -> sommet)
|
||||
private final int s = 26;
|
||||
private final int margin = 40;
|
||||
// pointy-top : largeur = sqrt(3)*s, hauteur = 2*s
|
||||
private final double hexW = Math.sqrt(3) * s;
|
||||
private final double hexVStep = 1.5 * s; // distance verticale entre centres
|
||||
|
||||
|
||||
private Shape[][] hexShapes;
|
||||
|
||||
public HexPanel(HexBoard board, JLabel statusLabel) {
|
||||
this.board = board;
|
||||
this.statusLabel = statusLabel;
|
||||
this.hexShapes = new Shape[board.getSize()][board.getSize()];
|
||||
|
||||
setBackground(Color.WHITE);
|
||||
|
||||
addMouseListener(new MouseAdapter() {
|
||||
@Override
|
||||
public void mouseClicked(MouseEvent e) {
|
||||
handleClick(e.getX(), e.getY());
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
@Override
|
||||
public Dimension getPreferredSize() {
|
||||
int n = board.getSize();
|
||||
|
||||
// largeur : n * hexW + décalage max (hexW/2) + marges
|
||||
int w = margin * 2 + (int) (n * hexW + hexW / 2);
|
||||
|
||||
// hauteur : (n-1)*1.5*s + 2*s + marges
|
||||
int h = margin * 2 + (int) ((n - 1) * hexVStep + 2 * s);
|
||||
|
||||
return new Dimension(w, h);
|
||||
}
|
||||
|
||||
|
||||
private void handleClick(int x, int y) {
|
||||
if (board.isGameOver()) return;
|
||||
|
||||
int n = board.getSize();
|
||||
for (int row = 0; row < n; row++) {
|
||||
for (int col = 0; col < n; col++) {
|
||||
Shape sh = hexShapes[row][col];
|
||||
if (sh != null && sh.contains(x, y)) {
|
||||
HexPly ply = new HexPly(board.getCurrentPlayer(), row, col);
|
||||
if (board.isLegal(ply)) {
|
||||
board.doPly(ply);
|
||||
HexFrame.updateStatus(board, statusLabel);
|
||||
repaint();
|
||||
} else {
|
||||
Toolkit.getDefaultToolkit().beep();
|
||||
}
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@Override
|
||||
protected void paintComponent(Graphics g) {
|
||||
super.paintComponent(g);
|
||||
|
||||
Graphics2D g2 = (Graphics2D) g.create();
|
||||
g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON);
|
||||
|
||||
// Bordures objectifs (bleu gauche/droite, rouge haut/bas)
|
||||
drawGoalBorders(g2);
|
||||
|
||||
int n = board.getSize();
|
||||
|
||||
// IMPORTANT : boucles cohérentes -> row puis col
|
||||
for (int row = 0; row < n; row++) {
|
||||
for (int col = 0; col < n; col++) {
|
||||
|
||||
Shape hex = createHexShape(row, col);
|
||||
hexShapes[row][col] = hex;
|
||||
|
||||
Player p = board.getCellPlayer(row, col);
|
||||
g2.setColor(colorForCell(p));
|
||||
g2.fill(hex);
|
||||
|
||||
g2.setColor(new Color(120, 120, 120));
|
||||
g2.setStroke(new BasicStroke(1.2f));
|
||||
g2.draw(hex);
|
||||
}
|
||||
}
|
||||
|
||||
g2.dispose();
|
||||
}
|
||||
|
||||
private Color colorForCell(Player p) {
|
||||
if (p == Player.PLAYER1) return new Color(30, 90, 160); // bleu
|
||||
if (p == Player.PLAYER2) return new Color(220, 50, 50); // rouge
|
||||
return new Color(190, 190, 190); // gris
|
||||
}
|
||||
|
||||
/**
|
||||
* Pointy-top + décalage par ligne :
|
||||
*
|
||||
* centreX = margin + hexW/2 + col*hexW + (row%2)*(hexW/2)
|
||||
* centreY = margin + s + row*(1.5*s)
|
||||
*/
|
||||
private Shape createHexShape(int row, int col) {
|
||||
double cx = margin + (hexW / 2.0) + col * hexW + ((row % 2) * (hexW / 2.0));
|
||||
double cy = margin + s + row * hexVStep;
|
||||
|
||||
Path2D.Double path = new Path2D.Double();
|
||||
for (int i = 0; i < 6; i++) {
|
||||
double angle = Math.toRadians(i * 60); // pointy-top
|
||||
double x = cx + s * Math.cos(angle);
|
||||
double y = cy + s * Math.sin(angle);
|
||||
if (i == 0) path.moveTo(x, y);
|
||||
else path.lineTo(x, y);
|
||||
}
|
||||
path.closePath();
|
||||
return path;
|
||||
}
|
||||
|
||||
|
||||
private void drawGoalBorders(Graphics2D g2) {
|
||||
int n = board.getSize();
|
||||
|
||||
double leftX = margin - 12;
|
||||
double rightX = margin + (hexW / 2.0) + (n - 1) * hexW + (hexW / 2.0) + (hexW / 2.0) + 12;
|
||||
// explication: largeur n colonnes + potentiel décalage d'une demi-largeur
|
||||
|
||||
double topY = margin - 12;
|
||||
double bottomY = margin + s + (n - 1) * hexVStep + s + 12;
|
||||
|
||||
g2.setStroke(new BasicStroke(6f, BasicStroke.CAP_ROUND, BasicStroke.JOIN_ROUND));
|
||||
|
||||
// Bleu: gauche / droite (objectif PLAYER1)
|
||||
g2.setColor(new Color(30, 90, 160));
|
||||
g2.drawLine((int) leftX, (int) topY, (int) leftX, (int) bottomY);
|
||||
g2.drawLine((int) rightX, (int) topY, (int) rightX, (int) bottomY);
|
||||
|
||||
// Rouge: haut / bas (objectif PLAYER2)
|
||||
g2.setColor(new Color(220, 50, 50));
|
||||
g2.drawLine((int) leftX, (int) topY, (int) rightX, (int) topY);
|
||||
g2.drawLine((int) leftX, (int) bottomY, (int) rightX, (int) bottomY);
|
||||
}
|
||||
}
|
||||
@@ -1,217 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
|
||||
import java.io.BufferedWriter;
|
||||
import java.io.FileWriter;
|
||||
import java.io.IOException;
|
||||
import java.util.EnumMap;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* Lance un grand nombre de parties Hex entre 2 bots aléatoires et affiche des stats.
|
||||
*
|
||||
* Exemples :
|
||||
* java fr.iut_fbleau.HexGame.HexSimMain
|
||||
* java fr.iut_fbleau.HexGame.HexSimMain --games 10000 --size 7 --seed 123
|
||||
* java fr.iut_fbleau.HexGame.HexSimMain --games 5000 --size 11 --csv results.csv
|
||||
*
|
||||
* À seed identique, la suite de nombres
|
||||
* pseudo-aléatoires générée est identique, donc les bots "aléatoires" joueront les mêmes coups
|
||||
* dans le même ordre (tant que le code et l'ordre des appels à Random ne changent pas).</p>
|
||||
*
|
||||
* Intérêt :
|
||||
*
|
||||
* Reproductibilité</b> : relancer exactement la même simulation pour déboguer / analyser.</li>
|
||||
* Comparaison équitable</b> : comparer 2 bots sur les mêmes tirages aléatoires.</li>
|
||||
* Si aucun seed n'est fourni, on utilise généralement l'heure courante, ce qui rend chaque exécution différente.</p>
|
||||
*
|
||||
* long seed;
|
||||
*
|
||||
*/
|
||||
public class HexSimMain {
|
||||
|
||||
private static class Stats {
|
||||
long win = 0;
|
||||
long draw = 0;
|
||||
long loss = 0;
|
||||
|
||||
long totalMoves = 0;
|
||||
long minMoves = Long.MAX_VALUE;
|
||||
long maxMoves = Long.MIN_VALUE;
|
||||
|
||||
void record(Result r, int moves) {
|
||||
if (r == Result.WIN) win++;
|
||||
else if (r == Result.DRAW) draw++;
|
||||
else if (r == Result.LOSS) loss++;
|
||||
totalMoves += moves;
|
||||
minMoves = Math.min(minMoves, moves);
|
||||
maxMoves = Math.max(maxMoves, moves);
|
||||
}
|
||||
|
||||
long games() { return win + draw + loss; }
|
||||
|
||||
double winRate() { return games() == 0 ? 0.0 : (double) win / games(); }
|
||||
double drawRate() { return games() == 0 ? 0.0 : (double) draw / games(); }
|
||||
double lossRate() { return games() == 0 ? 0.0 : (double) loss / games(); }
|
||||
double avgMoves() { return games() == 0 ? 0.0 : (double) totalMoves / games(); }
|
||||
|
||||
@Override
|
||||
public String toString() {
|
||||
StringBuilder sb = new StringBuilder();
|
||||
sb.append("Games: ").append(games()).append("\n");
|
||||
sb.append("WIN: ").append(win).append(String.format(" (%.2f%%)\n", 100.0 * winRate()));
|
||||
sb.append("DRAW: ").append(draw).append(String.format(" (%.2f%%)\n", 100.0 * drawRate()));
|
||||
sb.append("LOSS: ").append(loss).append(String.format(" (%.2f%%)\n", 100.0 * lossRate()));
|
||||
sb.append(String.format("Moves: avg=%.2f, min=%d, max=%d\n", avgMoves(), minMoves, maxMoves));
|
||||
return sb.toString();
|
||||
}
|
||||
}
|
||||
|
||||
private static class Args {
|
||||
int size = 7;
|
||||
int games = 1000;
|
||||
long seed = System.currentTimeMillis();
|
||||
int progressEvery = 0; // 0 = pas de progress
|
||||
String csvPath = null; // si non null, export par partie
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
Args a = parseArgs(args);
|
||||
|
||||
System.out.println("Hex random-vs-random simulation");
|
||||
System.out.println(" size=" + a.size + " games=" + a.games + " seed=" + a.seed +
|
||||
(a.csvPath != null ? " csv=" + a.csvPath : ""));
|
||||
|
||||
Random master = new Random(a.seed);
|
||||
Stats stats = new Stats();
|
||||
|
||||
BufferedWriter csv = null;
|
||||
try {
|
||||
if (a.csvPath != null) {
|
||||
csv = new BufferedWriter(new FileWriter(a.csvPath));
|
||||
csv.write("game_index,result_p1,moves\n");
|
||||
}
|
||||
|
||||
for (int i = 0; i < a.games; i++) {
|
||||
// Nouveau plateau, nouveaux bots (seeds dérivés du seed principal)
|
||||
HexBoard board = new HexBoard(a.size);
|
||||
|
||||
EnumMap<Player, AbstractGamePlayer> players = new EnumMap<>(Player.class);
|
||||
players.put(Player.PLAYER1, new RandomBot(Player.PLAYER1, new Random(master.nextLong())));
|
||||
players.put(Player.PLAYER2, new RandomBot(Player.PLAYER2, new Random(master.nextLong())));
|
||||
|
||||
int moves = runOneGame(board, players);
|
||||
|
||||
Result res = board.getResult();
|
||||
stats.record(res, moves);
|
||||
|
||||
if (csv != null) {
|
||||
csv.write(i + "," + res + "," + moves + "\n");
|
||||
}
|
||||
|
||||
if (a.progressEvery > 0 && (i + 1) % a.progressEvery == 0) {
|
||||
System.out.println("Progress: " + (i + 1) + "/" + a.games);
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println("\n=== SUMMARY (Result is from PLAYER1 perspective) ===");
|
||||
System.out.println(stats);
|
||||
|
||||
} catch (IOException e) {
|
||||
System.err.println("I/O error: " + e.getMessage());
|
||||
e.printStackTrace();
|
||||
} finally {
|
||||
if (csv != null) {
|
||||
try { csv.close(); } catch (IOException ignored) {}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Boucle de jeu (même logique que AbstractGame.run, mais on compte les coups).
|
||||
* On ne modifie pas GameAPI.
|
||||
*/
|
||||
private static int runOneGame(IBoard board, EnumMap<Player, AbstractGamePlayer> players) {
|
||||
int moves = 0;
|
||||
int guardMaxMoves = ((HexBoard) board).getSize() * ((HexBoard) board).getSize(); // au pire : plateau rempli
|
||||
|
||||
while (!board.isGameOver()) {
|
||||
AbstractGamePlayer p = players.get(board.getCurrentPlayer());
|
||||
IBoard safe = board.safeCopy();
|
||||
AbstractPly ply = p.giveYourMove(safe);
|
||||
|
||||
if (!board.isLegal(ply)) {
|
||||
throw new IllegalStateException("Illegal move: " + ply + " by " + board.getCurrentPlayer());
|
||||
}
|
||||
board.doPly(ply);
|
||||
moves++;
|
||||
|
||||
if (moves > guardMaxMoves) {
|
||||
throw new IllegalStateException("Too many moves (" + moves + "), something is wrong.");
|
||||
}
|
||||
}
|
||||
return moves;
|
||||
}
|
||||
|
||||
private static Args parseArgs(String[] args) {
|
||||
Args a = new Args();
|
||||
for (int i = 0; i < args.length; i++) {
|
||||
String s = args[i];
|
||||
switch (s) {
|
||||
case "--size":
|
||||
a.size = Integer.parseInt(nextArg(args, ++i, "--size requires a value"));
|
||||
break;
|
||||
case "--games":
|
||||
a.games = Integer.parseInt(nextArg(args, ++i, "--games requires a value"));
|
||||
break;
|
||||
case "--seed":
|
||||
a.seed = Long.parseLong(nextArg(args, ++i, "--seed requires a value"));
|
||||
break;
|
||||
case "--progress":
|
||||
a.progressEvery = Integer.parseInt(nextArg(args, ++i, "--progress requires a value"));
|
||||
break;
|
||||
case "--csv":
|
||||
a.csvPath = nextArg(args, ++i, "--csv requires a value");
|
||||
break;
|
||||
case "--help":
|
||||
case "-h":
|
||||
printHelpAndExit();
|
||||
break;
|
||||
default:
|
||||
// compat: si l'utilisateur donne juste un nombre, on l'interprète comme size ou games
|
||||
// ex: "7 10000"
|
||||
if (isInt(s)) {
|
||||
int v = Integer.parseInt(s);
|
||||
if (a.size == 11) a.size = v;
|
||||
else a.games = v;
|
||||
} else {
|
||||
System.err.println("Unknown arg: " + s);
|
||||
printHelpAndExit();
|
||||
}
|
||||
}
|
||||
}
|
||||
return a;
|
||||
}
|
||||
|
||||
private static String nextArg(String[] args, int idx, String errMsg) {
|
||||
if (idx < 0 || idx >= args.length) throw new IllegalArgumentException(errMsg);
|
||||
return args[idx];
|
||||
}
|
||||
|
||||
private static boolean isInt(String s) {
|
||||
try { Integer.parseInt(s); return true; } catch (NumberFormatException e) { return false; }
|
||||
}
|
||||
|
||||
private static void printHelpAndExit() {
|
||||
System.out.println("Usage: java fr.iut_fbleau.HexGame.HexSimMain [options]\n" +
|
||||
"Options:\n" +
|
||||
" --size N Board size (default 7)\n" +
|
||||
" --games N Number of games (default 1000)\n" +
|
||||
" --seed N Random seed (default current time)\n" +
|
||||
" --progress N Print progress every N games (default 0)\n" +
|
||||
" --csv FILE Write per-game results to CSV\n" +
|
||||
" -h, --help Show this help\n");
|
||||
System.exit(0);
|
||||
}
|
||||
}
|
||||
@@ -1,89 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
|
||||
public class MiniMaxBot extends AbstractGamePlayer {
|
||||
|
||||
private int MAXDEPTH = 5;
|
||||
|
||||
public MiniMaxBot(Player me) {
|
||||
super(me); // Correct constructor usage
|
||||
}
|
||||
|
||||
@Override
|
||||
public AbstractPly giveYourMove(IBoard board) {
|
||||
HexBoard hb = (HexBoard) board;
|
||||
float bestScore = -Float.MAX_VALUE;
|
||||
HexPly bestMove = null;
|
||||
|
||||
for (int i = 0; i < hb.getSize(); i++) {
|
||||
for (int j = 0; j < hb.getSize(); j++) {
|
||||
HexPly move = new HexPly(hb.getCurrentPlayer(), i, j);
|
||||
if (hb.isLegal(move)) {
|
||||
hb.doPly(move);
|
||||
float score = minimax(hb, MAXDEPTH, -Float.MAX_VALUE, Float.MAX_VALUE, true);
|
||||
if (score > bestScore) {
|
||||
bestScore = score;
|
||||
bestMove = move;
|
||||
}
|
||||
hb.undoPly();
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestMove;
|
||||
}
|
||||
|
||||
private float minimax(HexBoard board, int depth, float alpha, float beta, boolean isMaximizing) {
|
||||
if (depth == 0 || board.isGameOver()) {
|
||||
return evaluateBoard(board);
|
||||
}
|
||||
|
||||
if (isMaximizing) {
|
||||
float bestScore = -Float.MAX_VALUE;
|
||||
for (int i = 0; i < board.getSize(); i++) {
|
||||
for (int j = 0; j < board.getSize(); j++) {
|
||||
HexPly move = new HexPly(board.getCurrentPlayer(), i, j);
|
||||
if (board.isLegal(move)) {
|
||||
board.doPly(move);
|
||||
float score = minimax(board, depth - 1, alpha, beta, false);
|
||||
bestScore = Math.max(bestScore, score);
|
||||
alpha = Math.max(alpha, bestScore);
|
||||
if (beta <= alpha) break; // Pruning
|
||||
board.undoPly();
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestScore;
|
||||
} else {
|
||||
float bestScore = Float.MAX_VALUE;
|
||||
for (int i = 0; i < board.getSize(); i++) {
|
||||
for (int j = 0; j < board.getSize(); j++) {
|
||||
HexPly move = new HexPly(board.getCurrentPlayer(), i, j);
|
||||
if (board.isLegal(move)) {
|
||||
board.doPly(move);
|
||||
float score = minimax(board, depth - 1, alpha, beta, true);
|
||||
bestScore = Math.min(bestScore, score);
|
||||
beta = Math.min(beta, bestScore);
|
||||
if (beta <= alpha) break; // Pruning
|
||||
board.undoPly();
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestScore;
|
||||
}
|
||||
}
|
||||
|
||||
private float evaluateBoard(HexBoard board) {
|
||||
int size = board.getSize();
|
||||
int center = size / 2;
|
||||
int score = 0;
|
||||
for (int i = 0; i < size; i++) {
|
||||
for (int j = 0; j < size; j++) {
|
||||
if (board.getCellPlayer(i, j) == Player.PLAYER1) {
|
||||
score += Math.abs(i - center) + Math.abs(j - center); // Distance from center
|
||||
}
|
||||
}
|
||||
}
|
||||
return score;
|
||||
}
|
||||
}
|
||||
@@ -1,59 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
|
||||
import java.util.Random;
|
||||
|
||||
public class MonteCarloBot extends AbstractGamePlayer {
|
||||
|
||||
private static final int SIMULATION_COUNT = 1000;
|
||||
|
||||
public MonteCarloBot(Player me) {
|
||||
super(me); // Correct constructor usage
|
||||
}
|
||||
|
||||
@Override
|
||||
public AbstractPly giveYourMove(IBoard board) {
|
||||
HexBoard hb = (HexBoard) board;
|
||||
float bestScore = -Float.MAX_VALUE;
|
||||
HexPly bestMove = null;
|
||||
|
||||
for (int i = 0; i < hb.getSize(); i++) {
|
||||
for (int j = 0; j < hb.getSize(); j++) {
|
||||
HexPly move = new HexPly(hb.getCurrentPlayer(), i, j);
|
||||
if (hb.isLegal(move)) {
|
||||
hb.doPly(move);
|
||||
float score = monteCarloSimulation(hb);
|
||||
if (score > bestScore) {
|
||||
bestScore = score;
|
||||
bestMove = move;
|
||||
}
|
||||
hb.undoPly();
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestMove;
|
||||
}
|
||||
|
||||
private float monteCarloSimulation(HexBoard board) {
|
||||
RandomBot simBot = new RandomBot(Player.PLAYER1, new Random().nextLong());
|
||||
HexBoard simBoard = (HexBoard) board.safeCopy();
|
||||
int wins = 0;
|
||||
int simulations = 0;
|
||||
|
||||
for (int i = 0; i < SIMULATION_COUNT; i++) {
|
||||
while (!simBoard.isGameOver()) {
|
||||
AbstractPly move = simBot.giveYourMove(simBoard);
|
||||
simBoard.doPly(move);
|
||||
}
|
||||
|
||||
if (simBoard.getResult() == Result.WIN) {
|
||||
wins++;
|
||||
}
|
||||
simulations++;
|
||||
simBoard = (HexBoard) board.safeCopy(); // Reset the board for the next simulation
|
||||
}
|
||||
|
||||
return (float) wins / simulations;
|
||||
}
|
||||
}
|
||||
@@ -1,40 +0,0 @@
|
||||
package fr.iut_fbleau.HexGame;
|
||||
|
||||
import fr.iut_fbleau.GameAPI.AbstractGamePlayer;
|
||||
import fr.iut_fbleau.GameAPI.AbstractPly;
|
||||
import fr.iut_fbleau.GameAPI.IBoard;
|
||||
import fr.iut_fbleau.GameAPI.Player;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class RandomBot extends AbstractGamePlayer {
|
||||
|
||||
private final Random rng;
|
||||
|
||||
public RandomBot(Player me, Random rng) {
|
||||
super(me);
|
||||
this.rng = rng;
|
||||
}
|
||||
|
||||
public RandomBot(Player me, long seed) {
|
||||
this(me, new Random(seed));
|
||||
}
|
||||
|
||||
@Override
|
||||
public AbstractPly giveYourMove(IBoard board) {
|
||||
List<AbstractPly> legal = new ArrayList<>();
|
||||
Iterator<AbstractPly> it = board.iterator();
|
||||
while (it.hasNext()) {
|
||||
legal.add(it.next());
|
||||
}
|
||||
|
||||
if (legal.isEmpty()) {
|
||||
throw new IllegalStateException("No legal move available (board is full?)");
|
||||
}
|
||||
|
||||
return legal.get(rng.nextInt(legal.size()));
|
||||
}
|
||||
}
|
||||
@@ -3,7 +3,6 @@ package fr.iut_fbleau.HexGame;
|
||||
import fr.iut_fbleau.GameAPI.*;
|
||||
import java.util.EnumMap;
|
||||
import java.util.LinkedList;
|
||||
import java.util.Random;
|
||||
|
||||
|
||||
public class Simulation extends AbstractGame {
|
||||
@@ -11,8 +10,7 @@ public class Simulation extends AbstractGame {
|
||||
//ATTRIBUTS
|
||||
private HexPly bestmove;
|
||||
private float bestoutcome;
|
||||
private int MAXDEPTH = 9;
|
||||
private int EVALDEPTH = 10;
|
||||
private int MAXDEPTH = 6;
|
||||
private LinkedList<Integer[]> taken = new LinkedList<Integer[]>();
|
||||
|
||||
//ATTRIBUTS QUE JE NE VOUDRAIS PAS CRÉER IDÉALEMENT
|
||||
@@ -27,48 +25,13 @@ public class Simulation extends AbstractGame {
|
||||
}
|
||||
|
||||
//METHODES
|
||||
/*Le jeu de Hex ne peut jamais finir avec le résultat null. En utilisant cette propriété, on peut avoir cet algorithme simplifié du monte-carlo*/
|
||||
private float MonteCarlo(HexBoard position, Player current){
|
||||
RandomBot simplay = new RandomBot(current, new Random().nextLong());
|
||||
HexBoard simpos = position;
|
||||
LinkedList<Integer[]> ctaken = taken;
|
||||
HexPly testmove;
|
||||
float wins = 0;
|
||||
float losses = 0;
|
||||
int count = 0;
|
||||
for(int i=0; i<EVALDEPTH; i++){
|
||||
while(!simpos.isGameOver()){
|
||||
count++;
|
||||
testmove = (HexPly) simplay.giveYourMove(simpos);
|
||||
if(!ctaken.contains(new Integer[]{testmove.getRow(), testmove.getCol()}) && simpos.isLegal(testmove)){
|
||||
ctaken.add(new Integer[]{testmove.getRow(), testmove.getCol()});
|
||||
simpos.doPly(testmove);
|
||||
if(simpos.getResult()==Result.LOSS){
|
||||
losses++;
|
||||
} else if(simpos.getResult()==Result.WIN){
|
||||
wins++;
|
||||
}
|
||||
}
|
||||
}
|
||||
//System.out.println("count:"+count);
|
||||
for (int j=0; j<count; j++) {
|
||||
simpos.undoPly();
|
||||
}
|
||||
ctaken = taken;
|
||||
count = 0;
|
||||
}
|
||||
System.out.println(" wins : "+wins+"/losses : "+losses);
|
||||
System.out.println(" eval : "+(wins-losses)/EVALDEPTH);
|
||||
return (wins-losses)/EVALDEPTH;
|
||||
}
|
||||
|
||||
private float explMAX(HexBoard position, int depth){
|
||||
if (position.getResult()==Result.LOSS) {
|
||||
return -1.0f;
|
||||
} else if (position.getResult()==Result.WIN){
|
||||
return 1.0f;
|
||||
} else if (depth==MAXDEPTH) {
|
||||
return MonteCarlo(position, Player.PLAYER1);
|
||||
return 0f;
|
||||
} else {
|
||||
float bestcase = -1.0f;
|
||||
HexPly bestcasemove;
|
||||
@@ -110,7 +73,7 @@ public class Simulation extends AbstractGame {
|
||||
} else if (position.getResult()==Result.WIN){
|
||||
return 1.0f;
|
||||
} else if (depth==MAXDEPTH) {
|
||||
return MonteCarlo(position, Player.PLAYER2);
|
||||
return 0f;
|
||||
} else {
|
||||
float bestcase = 1.0f;
|
||||
HexPly bestcasemove;
|
||||
@@ -146,97 +109,6 @@ public class Simulation extends AbstractGame {
|
||||
}
|
||||
}
|
||||
|
||||
private float explMAXAB(HexBoard position, int depth, float A, float B){
|
||||
if (position.getResult()==Result.LOSS) {
|
||||
return -1.0f;
|
||||
} else if (position.getResult()==Result.WIN){
|
||||
return 1.0f;
|
||||
} else if (depth==MAXDEPTH) {
|
||||
return MonteCarlo(position, Player.PLAYER1);
|
||||
} else {
|
||||
float bestcase = A;
|
||||
HexPly bestcasemove;
|
||||
HexPly testmove;
|
||||
for (int i=0; i<position.getSize(); i++) {
|
||||
for (int j=0; j<position.getSize(); j++) {
|
||||
if(depth==0){
|
||||
//System.out.println("MAX New Line :");
|
||||
}
|
||||
Integer[] t = new Integer[]{i, j};
|
||||
testmove = new HexPly(Player.PLAYER1, i, j);
|
||||
if(!taken.contains(t) && position.isLegal(testmove)){
|
||||
//System.out.println(" MAX test move : "+Integer.toString(i)+","+Integer.toString(j));
|
||||
taken.add(t);
|
||||
position.doPly(testmove);
|
||||
float val = explMINAB(position, depth+1, bestcase, B);
|
||||
if (val >= bestcase) {
|
||||
//System.out.println(" MAX new best case");
|
||||
bestcase = val;
|
||||
bestcasemove = testmove;
|
||||
if (depth==0) {
|
||||
this.bestoutcome = bestcase;
|
||||
this.bestmove = bestcasemove;
|
||||
}
|
||||
if(bestcase>=B){
|
||||
return bestcase;
|
||||
}
|
||||
}
|
||||
position.undoPly();
|
||||
taken.remove(t);
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestcase;
|
||||
}
|
||||
}
|
||||
private float explMINAB(HexBoard position, int depth, float A, float B){
|
||||
if (position.getResult()==Result.LOSS) {
|
||||
return -1.0f;
|
||||
} else if (position.getResult()==Result.WIN){
|
||||
return 1.0f;
|
||||
} else if (depth==MAXDEPTH) {
|
||||
return MonteCarlo(position, Player.PLAYER2);
|
||||
} else {
|
||||
float bestcase = B;
|
||||
HexPly bestcasemove;
|
||||
HexPly testmove;
|
||||
for (int i=0; i<position.getSize(); i++) {
|
||||
for (int j=0; j<position.getSize(); j++) {
|
||||
if(depth==0){
|
||||
//System.out.println("MIN New Line :");
|
||||
}
|
||||
Integer[] t = new Integer[]{i, j};
|
||||
testmove = new HexPly(Player.PLAYER2, i, j);
|
||||
if(!taken.contains(t) && position.isLegal(testmove)){
|
||||
//System.out.println(" MIN test move : "+Integer.toString(i)+","+Integer.toString(j));
|
||||
taken.add(t);
|
||||
position.doPly(testmove);
|
||||
float val = explMAXAB(position, depth+1, A, bestcase);
|
||||
if (val <= bestcase) {
|
||||
//System.out.println(" MIN new best case");
|
||||
bestcase = val;
|
||||
bestcasemove = testmove;
|
||||
if (depth==0) {
|
||||
this.bestoutcome = bestcase;
|
||||
this.bestmove = bestcasemove;
|
||||
}
|
||||
if(bestcase<=A){
|
||||
return bestcase;
|
||||
}
|
||||
}
|
||||
|
||||
position.undoPly();
|
||||
taken.remove(t);
|
||||
}
|
||||
}
|
||||
}
|
||||
return bestcase;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
private AbstractPly GiveBestMove(IBoard board) {
|
||||
if (!(board instanceof HexBoard)) {
|
||||
throw new IllegalArgumentException("Ce joueur attend un HexBoard.");
|
||||
@@ -244,9 +116,9 @@ public class Simulation extends AbstractGame {
|
||||
HexBoard hb = (HexBoard) board;
|
||||
float bestcase;
|
||||
if(hb.getCurrentPlayer()==Player.PLAYER1){
|
||||
bestcase = explMAXAB(hb, 0, -1.0f, 1.0f);
|
||||
bestcase = explMAX(hb, 0);
|
||||
} else {
|
||||
bestcase = explMINAB(hb, 0, -1.0f, 1.0f);
|
||||
bestcase = explMIN(hb, 0);
|
||||
}
|
||||
return this.bestmove;
|
||||
}
|
||||
|
||||
10001
results.csv
10001
results.csv
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user