Paris7/DamesEtCo
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Activity

détection fin du jeu

Browse source
This commit is contained in:
Mylloon 2023-12-31 04:10:41 +01:00
parent d3a2d69dd4
commit 920d25daae
Signed by: Anri
GPG key ID: A82D63DFF8D1317F
2 changed files with 33 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
includes/Butin/PlateauButin.hpp
View file

@ -3,8 +3,8 @@
#include "../Plateau.hpp" #include "../Plateau.hpp"
#include <vector> #include <vector>
class PlateauButin : public Plateau { struct PlateauButin : public Plateau {
public:
PlateauButin(); PlateauButin();
virtual ~PlateauButin(); virtual ~PlateauButin();
@ -19,4 +19,9 @@ public:
// Vrai si un coup est possible // Vrai si un coup est possible
bool coupsPossible() const; bool coupsPossible() const;
private:
// Renvoie la liste des pièces entre deux position
std::vector<Piece *> cheminPieces(const int depX, const int depY,
const int destX, const int destY) const;
}; };

32
src/Butin/PlateauButin.cpp
View file

@ -48,11 +48,13 @@ void PlateauButin::initialiserPlateau() {
std::vector<Piece *> PlateauButin::cheminPieces(const int destX, std::vector<Piece *> PlateauButin::cheminPieces(const int destX,
const int destY) const { const int destY) const {
// Position départ
std::pair<int, int> posSelection = selection->getPos(); std::pair<int, int> posSelection = selection->getPos();
const int depX = posSelection.first; return cheminPieces(posSelection.first, posSelection.second, destX, destY);
const int depY = posSelection.second; }
std::vector<Piece *> PlateauButin::cheminPieces(const int depX, const int depY,
const int destX,
const int destY) const {
// Distances // Distances
const int deltaX = destX - depX; const int deltaX = destX - depX;
const int deltaY = destY - depY; const int deltaY = destY - depY;
@ -102,7 +104,25 @@ bool PlateauButin::selectionJaune() const {
} }
bool PlateauButin::coupsPossible() const { bool PlateauButin::coupsPossible() const {
// TODO: Vérifier si en partant des pièces jaunes il n'y aurait pas des coups for (int i = 0; i < taille; ++i) {
// possibles for (int j = 0; j < taille; ++j) {
return true; const PieceButin *piece = dynamic_cast<const PieceButin *>(plateau[i][j]);
if (piece && piece->getPoints() == PieceButin::Jaune) {
// Parmis toutes les pièces jaunes
for (int i2 = 0; i2 < taille; ++i2) {
for (int j2 = 0; j2 < taille; ++j2) {
// Regarde par rapport aux cases vides
if (plateau[i2][j2] == nullptr) {
// Si le déplacement d'une pièce peut donner des points
if (!cheminPieces(i, j, i2, j2).empty()) {
return true;
}
}
}
}
}
}
}
return false;
} }