package ir.ac.iust.evoalgs.nqueen;

import java.util.List;

public interface INQueenSolutionHelper {

	public void onProgress(int[] theBest, int iterNo);
	
	public void onCompelete(NQueenProblem problem, NQueenSolution solution, int iterCnt);
	
	public int getSleepSize();

	public double getMutationProb();
	
	public double getCrossOverProb();
	
	public Gene selectParent(List<Gene> population);
	
	public void initPopulation(List<Gene> population);

	public boolean hasBeenEnded(List<Gene> population, int iterNo);

	public int[] getTheBest(List<Gene> population);
	
	public void replacment(List<Gene> population, Gene[] genes);
	
}