------
## 最终结论
```python
def min_moves_to_zigzag(nums):
    moves_even = 0
    moves_odd = 0
    
    for i in range(0, len(nums), 2):
        if i > 0 and nums[i] <= nums[i - 1]:
            moves_even += nums[i - 1] - nums[i] + 1
        if i < len(nums) - 1 and nums[i] <= nums[i + 1]:
            moves_even += nums[i + 1] - nums[i] + 1

    for i in range(1, len(nums), 2):
        if i > 0 and nums[i] <= nums[i - 1]:
            moves_odd += nums[i - 1] - nums[i] + 1
        if i < len(nums) - 1 and nums[i] <= nums[i + 1]:
            moves_odd += nums[i + 1] - nums[i] + 1

    return min(moves_even, moves_odd)
```