Introducing the Min-Max Algorithm - …

Introducing the Min-Max AlgorithmPaulo Pinto28 July 2002 Submited to theAI Depotarticle Introduction12 The Min-Max Algorithm13 Optimization14 Speeding the algorithm35 Adding Alpha-Beta Cutoffs56 An example implementation57 Conclusion58 References61 IntroductionThere are plenty of applications for AI, but games are the most interesting to the every major OS comes with some it is no surprise that there are some algorithms that were devised with games in The Min-Max AlgorithmThe Min-Max Algorithm is applied in two player games, such as tic-tac-toe, checkers, chess, go, and so these games have at least one thing in common, they are logic games. This means that they can be describedby a set of rules and premisses. With them, it is possible to know from a given point in the game, what are thenext available moves. So they also share other characteristic, they are full information games.

Contents 1 Introduction 1 2 The Min-Max Algorithm 1 3 Optimization 1 4 Speeding the algorithm 3 5 Adding Alpha-Beta Cutoffs 5 6 An example implementation 5

Loading..

Tags:

  Introducing, Algorithm, Introducing the min max algorithm, The min, Max algorithm

Information

Related search queries