5
让我先说这个问题可以通过没有Prolog经验的AI向导来回答。Minimax在“Prolog Programming for Artificial Intelligence”中的实现 - 什么是min_to_move/1和max_to_move/1?
优秀Prolog Programming for Artificial Intelligence本书有这个相当简洁而巧妙的极小实现:
minimax(Pos, BestSucc, Val) :-
moves(Pos, PosList), !, % Legal moves in Pos produce PosList
best(PosList, BestSucc, Val)
;
staticval(Pos, Val). % Pos has no successors: evaluate statically
best([ Pos], Pos, Val) :-
minimax(Pos, _, Val), !.
best([Pos1 | PosList], BestPos, BestVal) :-
minimax(Pos1, _, Val1),
best(PosList, Pos2, Val2),
betterof(Pos1, Val1, Pos2, Val2, BestPos, BestVal).
betterof(Pos0, Val0, Pos1, Val1, Pos0, Val0) :- % Pos0 better than Pos1
min_to_move(Pos0), % MIN to move in Pos0
Val0 > Val1, ! % MAX prefers the greater value
;
max_to_move(Pos0), % MAX to move in Pos0
Val0 < Val1, !. % MIN prefers the lesser value
betterof(Pos0, Val0, Pos1, Val1, Pos1, Val1). % Otherwise Pos1 better than Pos0
然而,笔者没有去多长在描述它,我留下来不知道min_to_move/1
和max_to_move/1
是。
任何人都可以解释这些给我吗?
在此先感谢!