public void neighborhoodRoundsTests(int neighChoice){	
		//
		orgSolutionFalse = sol.checkConstraint();
		//
		if(neighChoice==0){ //random neighbor
			int neigh = sol.getRoundsNum();
			int times = 100;
			//for(int i=2; i<neigh; i++){
				////System.out.println(i);
			ArrayList<Integer> al = new ArrayList<Integer>();
			for(int i=0; i<100; i++){
				List<List<Game>> oldSolution = sol.deepCopy();
				randomNeighborhoodRounds(6, times);
				al.add(sol.getCumulativeCost());
				sol.setSolution(oldSolution);
			}
			getStatistic(al);
			//}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost());
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+"\n";
			}
		}
		else if(neighChoice==1){//next improvement: search in a specified order, take first solution, which is better than x
			for(int i=0; i<sol.getRoundsNum(); i++){
				listNeighborhoodRound(i,minNotMax);
			}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+", Iterationsteps: "+iterationStep);
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+", Iterationsteps: "+iterationStep+"\n";
			}
		}
		else if(neighChoice==2){//best improvement: search through N completely and take the best solution
			//
			int cntChanges = 6;
			for(int i=0; i<cntChanges; i++){
				bestNeighborhoodRounds(i);
			}
			//System.out.println("Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+", Iterationsteps: "+iterationStep);
			
			if(Util.protocolBoolean){
				Util.protocol += "Neighborhood (rounds) "+neighChoice+": "+sol.getCumulativeCost()+", Iterationsteps: "+iterationStep+"\n";
			}
			/*
			for(int i=0; i<sol.getRoundsNum(); i++){
				moveListIdx(i);
			}
			
			for(int i=0; i<sol.getRoundsNum(); i++){
				//for(int i=sol.getRoundsNum(); i>0; i--){
					//moveListIdx(i);
					bestNeighborhoodRounds(1);
					List<ArrayList<Integer>> listOfGames = sol.getGameList();
					bestNeighborhoodGame(listOfGames,5);
				}*/
		}
		//
		
		//
	}