终于找到一份不怎么坑爹的算法伪代码了,
function ALPHA-BETA-SEARCH(state) returns an action
V<--MAX-VALUE(state,-无穷,+无穷)
return the action in ACTION(state)with value v
-----------------------------------------------------------------------------------
function MAX-VALUE(state,alpha,beta)return a utility value
if TERMINAL-TEST(state)then return UTILITY(state)
v<---负无穷
for each a in ACTION(state)do
v<-----MAX(v,MIN-VALUE(RESULT(s,a),alpha,beta))
if(v>=beta)then return v
alpha<------MAX(alpha,v)
return v
------------------------------------------------------------------------------------
function MIN-VALUE(state,alpha,beta)return a utility value
if TERMINAL-TEST(state)then return UTILITY(state)
v<---正无穷
for each a in ACTION(state)do
v<-----MIN(v,MAX-VALUE(RESULT(s,a),alpha,beta))
if(v<=alpha )then return v
beta<------MIN(alpha,v)
return v
----------------------------------------------------------------------------------------
其中的RESULT(s,a)应该是利用a(action,和。。。)返回一个后继(result)state,估计。。。就是出现在MAX-VALUE或者MIN-VALUE调用中的state。