boolean[] getQuadruplets(){ // Find quadruplets for quad match algorithm
		Integer[] array1 = new Integer[getFirstPlayersW()];

		// Get bitwise >> 2 placement numbers
		for (Entry<Bracket, Integer> mapEntry : BrackEm.winPanel.hashList.get(0).entrySet()) // Get all first round (0) brackets
		{
			Bracket key = mapEntry.getKey();
			int value = mapEntry.getValue();
			int placement = key.getPlacement();
			array1[value-1] = ((placement - 1) >> 2); // Enter by value
			
			if (BrackEm.debug){
				System.out.println("BracketCalc (getQuadruplets): getValue() : " + value);
				System.out.println("BracketCalc (getQuadruplets): getPlacement() >> 2: " + array1[value-1]);
			}
		}
		
		// Unique placement values
		Set<Integer> uniqKeys = new TreeSet<Integer>();
		uniqKeys.addAll(Arrays.asList(array1));
		if (BrackEm.debug){
			System.out.println("uniqKeys: " + uniqKeys);
		}
		
		int[] array2 = new int[uniqKeys.size()];
		boolean[] array3 = new boolean[uniqKeys.size()];
		
		// Iterate through placement numbers and count if any unique numbers reach 4 counts
		for (Integer i : array1){
			if (uniqKeys.contains(i)){
//				if (BrackEm.debug){
//					System.out.println("BracketCalc (getQuadruplets): Found " + i);
//				}
				array2[i]++;
				if (array2[i]==4){
					array3[i] = true;
					if (BrackEm.debug){
						System.out.println("BracketCalc (getQuadruplets): Value " + i + " is a quadruplet");
					}
				}
			}
		}
		
		boolean[] out = new boolean[array1.length];
		
		for (int j = 0;j<array1.length;j++){
			if (array3[array1[j]]){
//				if (BrackEm.debug){
//					System.out.println("BracketCalc (getQuadruplets): Placement value " + j + " is a quadruplet index");
//				}
				out[j] = true;
			}
		}
			
		return out;
	}