private Solution[] Tournament(Solution[] population, int tournamentSize) 
	{
		Solution[] returnArray = new Solution[2];
		
		//Do this twice for 2 parents
		for (int i = 0; i < 2; i++) 
		{
			Random randomNumberGenerator;
			Solution[] tournamentParticipants = new Solution[tournamentSize];
			
			//Randomly create the tournament participants
			for (int j = 0; j < tournamentSize; j++) 
			{
				randomNumberGenerator = new Random(System.nanoTime());
				tournamentParticipants[j] = population[randomNumberGenerator.nextInt(populationSize)];
			}
			
			//Now find the fittest solution in this tournament
			int fittestIndex = 0;
			double highestFitness = Integer.MIN_VALUE;
			for (int j = 0; j < tournamentSize; j++) 
			{
				if (tournamentParticipants[j].getFitness() > highestFitness)
				{
					highestFitness = tournamentParticipants[j].getFitness();
					fittestIndex = j;
				}
			}
			
			returnArray[i] = tournamentParticipants[fittestIndex];
		}
		
		if(returnArray[0] == returnArray[1])
		{
			//System.out.println("We chose 2 of the same parents");
		}
		
		return returnArray;
	}