------
## 最终结论
```python
def min_moves_to_make_unique(A):
    A.sort()  # Sort the array to handle duplicates
    moves = 0  # Initialize the count of moves
    for i in range(1, len(A)):
        if A[i] <= A[i - 1]:  # Check if current element is not greater than the previous one
            moves += (A[i - 1] - A[i] + 1)  # Increment current element to make it unique
            A[i] = A[i - 1] + 1  # Update current element to be unique
    return moves

# Example usage:
print(min_moves_to_make_unique([3, 2, 1, 2, 1, 7]))  # Output: 6
```