Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package Taquin;
- import java.util.*;
- public class Resol{
- //Attributs
- private IJeu t;
- private ArrayList<IJeu> sol;
- //Constructeurs
- public Resol(IJeu t){
- this.t = t;
- }
- //Mรฉthodes
- /**
- *Ajoute ร sol la liste des positions qui mรจne ร la solution.
- *
- */
- public void solve() {
- ArrayList<Couple<IJeu>> front = new ArrayList<Couple<IJeu>>();
- ArrayList<IJeu> vus = new ArrayList<IJeu>();
- Couple<IJeu> found = null;
- Couple<IJeu> start = new Couple<IJeu>(t, null);
- start.ajoutSiNecessaireEtMaJ(front, start.getT().generer_fils(), vus);
- ArrayList<Couple<IJeu>> clonefront;
- while (found == null && front.size()>0) {
- for (Couple<IJeu> c : front) {
- if (c.getT().estGagnant()) {
- found = c;
- break;
- }
- }
- clonefront = new ArrayList<Couple<IJeu>>(front);
- front.clear();
- for (Couple<IJeu> c : clonefront) {
- c.ajoutSiNecessaireEtMaJ(front, c.getT().generer_fils(), vus);
- }
- System.out.println(vus.size());
- }
- this.sol = found.remonte();
- }
- public void printSolution(){
- System.out.println(this.sol);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement