public void transition(){
	if(currentNode == null)
		currentNode = Head;
	PriorityQueue<Node> mytemp;
	Node tempNode;
	int projectedGoodness;

	
		mytemp = currentNode.makeChildren();
		while(mytemp.peek() != null){
			tempNode = mytemp.poll();
			projectedGoodness = tempNode.getGoodness();
			projectedGoodness = projectedGoodness + (tempNode.getCurrentPeople().size()*10); 	//just an arbritary number, projected goodness, 2 or 1 may cause out of memory
			tempNode.setGoodness(projectedGoodness);
			
			if(tempNode.isComplete()){
				goodness(tempNode);
				solutions ++;
				if(solution ==null)
					solution = tempNode;
				else if(tempNode.getGoodness() < solution.getGoodness())
					solution = tempNode;
				
			}
			else{
			queueNodes.add(tempNode);
		}
		}
		

		currentNode = queueNodes.poll();
}