Question :
Suppose now that after each turn, a single six-face die is tossed. If it comes out to one, a single chip is removed from the fourth pile; otherwise, the board is left as is.
Describe an efficient algorithm that maximizes Alice's chance of winning the game.