Question

An arbitary list of integers both positive and negative is presented to two player,playerA and playerB.with A playing first in there turn,either players is allowed to pick the first or last number from the remaining list,and the number is deleted from the list.As usual,players takes turn.
When the list turn empty,the game ends.The player with the highest total point wins.design an alogrithm to determine for a given input list if the first player can force a win against any opponent?
plz help my brain is now fried for that