Machine Intelligence and Pattern Recognition, Vol. An Evaluation of Two Alternatives to Minimax. International Journal of Parallel Programming, Vol. SIAM Journal on Applied Mathematics, Vol. Thiruvenkatachari Parthasarathy ( 1970).Experiments with the M & N Tree-Searching Program. Experiments With Some Programs That Search Game Trees. Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith, introduces Expectiminimax tree Advances in Programming and Non-Numerical Computation, Leslie Fox (ed.), pp. Artificial Intelligence Group Report 3, UCRL-4671, University of California Game Trees, M & N Minimaxing, and the M & N alpha-beta procedure. An analog of the minimax theorem for vector payoffs. La théorie du jeu et les équations intégrales à noyau symétrique. 101-115, English translation of Émile Borel ( 1921). The Theory of Play and Integral Equations with Skew Symmetric Kernels. Discussion of the Early History of the Theory of Games, with Special Reference to the Minimax Theorem. Elementary Proof of a Minimax Theorem due to von Neumann. Programming a Computer for Playing Chess, Philosophical Magazine, Ser.7, Vol. Cybernetics or Control and Communication in the Animal and the Machine - MIT Press, Cambridge, MA. Princeton University Press, Princeton, NJ. John von Neumann, Oskar Morgenstern ( 1944).1304-1308, English translation by Leonard J. Comptes Rendus de Académie des Sciences, Vol. This is because of the zero-sum property of chess: one side's win is the other side's loss. This means that the evaluation of a position is equivalent to the negation of the evaluation from the opponent's viewpoint. Usually the Negamax algorithm is used for simplicity. For clarity move making and unmaking before and after the recursive call is omitted.
#Minimax algo to play halma game code
The original minimax as defined by Von Neumann is based on exact values from game-terminal positions, whereas the minimax search suggested by Norbert Wiener is based on heuristic evaluations from positions a few moves distant, and far from the end of the game.īelow the pseudo code for an indirect recursive depth-first search.
Further there is a conceivable claim that the first to credit should go to Charles Babbage. It concludes that although John von Neumann is usually associated with that concept ( 1928), primacy probably belongs to Émile Borel. Jaap van den Herik's thesis (1983) contains a detailed account of the known publications on that topic.
0 kommentar(er)
