Wednesday, March 29, 2017
Minimax Pseudocode
Minimax Pseudocode
best_move = moves_list[i];
if (best_score > best_opposing_score) then
cut;/* the opponent will not allow you to reach this node*/
endif
endif
enddo
chosen_move = best_move;
Gt_evaluate(current_mimx_data,chosen_score,best_score);
end.
Related post
- http://www.cs.caltech.edu/~petrovic/games/archex/othellodir/node2.html (external)
Available link for download
