我無法理解這種僞我發現α+β修剪維基百科: function alphabeta(node, depth, α, β, Player)
if depth = 0 or node is a terminal node
return the heuristic value of node
if Player = MaxPlayer
for each ch
我已經實施了跳棋alpha-beta修剪,並認爲我有它的工作,但發現計算機不需要連續多次跳轉(當它必須)。例如: AI做: O _ _ _ _ _ _ _ _ _
_ X _ X _ -> _ _ _ X _ (misses a jump because it only does a single move)
_ _ _ _ _ _ _ O _ _
AI 應該做: O _ _ _