private boolean nakedPairSolver() {
		LinkedList<Integer> values = new LinkedList<Integer>();
		for (int index=0; index < nakeds.size(); index++) {
			NakedCandidates current = nakeds.get(index);
			if (current.values.size() == 2 && !passOver(values, nakeds.get(index).id)) { /* Modified to check for Candidate Unique Id */
				int j = checkForNakedPairs(current.x, current.y, index);
				
				// Ensure Index of -1 doesn't get added to the list of Cached Values.
				if (j != -1) { values.add(nakeds.get(j).id); } /* Modified to cache Candidate unique Id */
			}
		}
		
		return nakedSingleSolver();
	}