Remove Colored Pieces if Both Neighbors are the Same Color

Given a string colors consisting of only the characters 'A' and 'B', determine if the first player (Alice) can win the game based on the following rules:

On each turn, a player can remove a character 'A' if and only if it is not the leftmost 'A' and its neighbors are both 'A'. On each turn, a player can remove a character 'B' if and only if it is not the leftmost 'B' and its neighbors are both 'B'. The game ends when a player cannot make a move.