Find the Maximum Number of Fruits Collected

Three players start at three corners of an n×n grid and each make exactly n−1 constrained moves to reach (n−1,n−1), collecting fruits in visited cells but counting a cell's fruits only once if multiple players visit it. The challenge is to maximize total fruits — typically solved with dynamic programming that tracks the players' simultaneous positions (or time-step) and handles overlap to avoid double-counting.