------
## 最终结论
```python
def stoneGameIII(stoneValue):
    n = len(stoneValue)
    dp = [0] * (n + 1)

    # 从后向前遍历stoneValue数组
    for i in range(n - 1, -1, -1):
        max_diff = float('-inf')
        current_sum = 0
        for j in range(1, 4):  # 考虑取1、2、3个石头的情况
            if i + j - 1 < n:
                current_sum += stoneValue[i + j - 1]
                max_diff = max(max_diff, current_sum - dp[i + j])
        dp[i] = max_diff

    if dp[0] > 0:
        return "Alice"
    elif dp[0] < 0:
        return "Bob"
    else:
        return "Tie"
```