public void mctsSearch(int its)
{
for (int i = 0; i < its; i++)
{
SimpleTreeNode selected = ParetoTreePolicy();
double[] delta = selected.rollOut();
pa.add(new Solution(delta)); //Add the result of the new tree walk to the pareto front (it checks for dominance)
selected.backUp(delta);
}
}
