情境
Two players take turns saying 1-3 consecutive numbers, with the player forced to say 31 losing. The AI uses the known winning strategy (positions ≡2 mod 4) to choose its move.
這張圖裡有什麼
看懂背後的決策。
01
Check if current number is 30 (immediate loss)
02
Compute next winning target number
03
Decide whether target is reachable within 1-3 steps
This flowchart can be implemented in any programming language for a perfect AI opponent in the Baskin Robbins 31 game.