localsearch.h

#ifndef LOCALSEARCH_H
#define LOCALSEARCH_H

//#include "Engine/field.h"
#include "Engine/parameters.h"
#include "fieldevaluation.h"

class LocalSearch
{
private:
//    Field* field;
    FieldEvaluation* fieldeval;
    const Parameters& params;

    // Données calculées

public:
    typedef std::list<Coordinates> Path;

    LocalSearch( Field* _field, const Parameters* _params );

    LocalSearch(const LocalSearch& other);

    ~LocalSearch();

    /* Getters */
    unsigned get_field_width() const { return fieldeval->get_width(); }
    unsigned get_field_height() const { return fieldeval->get_height(); }
    FieldEvaluation& get_field() { return *fieldeval; }
    FieldEvaluation* get_fieldEvaluation() { return fieldeval; }

    /* Setters */
    void setField(Field* _field);

    /* Placement de routes */
private:
    void vertical_roads(Coordinates& InOut1, const Coordinates &InOut2);
    void horizontal_roads(Coordinates& InOut1, const Coordinates& InOut2);

    // Création de coudes avec les routes
    void verticalElbows(Coordinates& InOut1, const Coordinates& InOut2);
    void horizontalElbows(Coordinates& InOut1, const Coordinates& InOut2);

    void addPath(Path* path);

    bool tryPaveRoad(Path* path);

    /*  Algorithm */
    /* = Initialisation = */

    /* Création et améliorations d'une solution */
    void createRoadsBetween(Coordinates &inOut1, const Coordinates &inOut2);

public:
    bool tryInitSolution();

    /* = Improvments = */
    std::list<Path*>* getPaths(const Coordinates& coord1, const Coordinates& coord2);
    float gainPath(Path* path);
    int addRoadUsable() const;
    float addRoadsAccess(unsigned nbToAdd);
};

int oneStep(int coordinate1, int coordinate2);

#endif // LOCALSEARCH_H