# Forest Management

The purpose of this implementation is to use Constraint Programming to find valid solutions for problems of forest management.

Here, Management Units (MUs) are associated with possible prescriptions which define which years the MUs are to be harvested.

But in any given year only 50ha of contiguous forest area can be harvested at once.


Therefore the implementation needs input defining:

1-The existing MUs in the forest

2-The area of each MU

3-The MUs adjacent to each MU

4-The border lenght of each adjacency between MUs

5-The IDs of the Prescriptions of each MU

6-Relative to each Prescription, the years where the Prescription defines that the MU should be harvested.

7-Relative to each Prescription, the rewards each Prescription gives for being applied.

# Step 1: Necessary Setup Files.

In general for every line in one of the files we assume a new Management Unit, a file with 4 lines would imply that there are 4 MUs, and since this has to be consistent then that means all input files should have 4 lines.

6 files need to be prepared in the following manner


## external_init.txt 
### This file serves to indicate how many Management Units exist in the forest, so each line should have a number to serve as an External identifier of each MU. There should be as many lines as there are MUs in the forest.

Each of these External IDs have an Internal ID which corresponds to the index of their row starting from 0

........................EXAMPLE:

30

201

333

335

.........................

So they have the following Internal IDs

.........................