Minimax search procedure in artificial intelligence with example
66-415 Introduction to Artificial Intelligence — Spring 2006. Minimax Search for Dots. The minimax search procedure For example, you can use
Articles on Artificial Intelligence Minimax Search Algorithm. The standard algorithm for two-player perfect-information games such as chess, checkers or othello
Contribute to udacity/artificial-intelligence You can build a basic agent by combining minimax search with (for example, alpha-beta search
… Artificial Intelligence: Minimax search From M. T. Jones, Artificial Intelligence: Alpha-Beta Pruning Example From M. T. Jones, Artificial Intelligence:
The minimax search is especially known for this search algorithm is based on von Neumann’s minimax theorem which states that Artificial Intelligence
I wrote this code to demonstrate how to program artificial intelligence Let’s walk through an example using the We will build our search tree using Node
This algorithm is built around two recursive procedures. It finds the minimax value As an example we prove SSS* Search Problems, Artificial Intelligence
… (Procedure) Artificial Intelligence. In this article we will discuss about minimax and negmax procedure of A minimax search at this level
CS 188: Artificial Intelligence Lecture 6 and 7: Minimax Example 11 Max nodes as in minimax search !
CS312 Recitation 21 Minimax search and Alpha-Beta Pruning. A game can be thought of as a tree of possible future game states. For example, in Gomoku the game state is
17/04/2017 · Alpha Beta pruning in artificial Intelligence in hindi Search: Games, Minimax, A* algorithm in artificial intelligence in hindi
Introducing the Min-Max Algorithm Paulo Pinto 6 An example implementation 5 a brief introduction to search trees is required.
Artificial Intelligence Chapter 5 Adversarial Search
The -Minimax Search Procedure for Trees Containing Chance
ARTIFICIAL INTELLIGENCE 327 The,-Minimax Search Procedure for Based upon our search strategy,)re formulate and then analyze several algorithnzs for *-minimax
Minimax Algorithm Tic Tac Toe AI In Java [Minimax][Full tree Search][Artificial Intelligence][Java]
Artificial Intelligence Popular Search Algorithms – Learning Artificial Intelligence in simple and easy steps using this beginner’s tutorial containing basic
CSE 473: Artificial Intelligence Autumn 2011 Minimax search min! Alpha-Beta Pruning Example 3 12 2 5 1 8 14 ≥8
Artificial Intelligence(AI) CS6659 – AI Notes. Pages. MINIMAX Tree Game playing has depth-limited search procedure.
ARTIFICIAL INTELLIGENCE & FUZZY LOGIC Game Playing: Overview, Minimax search procedure, adding Alfa-Beta cutoffs, Additional Refinements ,Iterative Deepening
Artificial Intelligence Stack Exchange is a question and answer site for people interested in Browse other questions tagged search minimax or ask your own
Bibliographic content of Artificial Intelligence and Synthesizing And/Or Tree Search Procedures Minimax Search Procedure for Trees
10/08/2010 · Learn every thing about Artificial Intelligence here from a Alpha-Beta Cut Offs(Pruning) search opens as many leaves as minimax on a game tree
The previous example analyzed what can be pruned. Minimax with alpha Most real games are too big to carry out minimax search, Artificial Intelligence:
AI with Python – Heuristic Search Artificial intelligence with the help of neural networks can analyze the data more deeply. Intelligence Description Example
… A Minimax Algorithm Better than Alpha-Beta? ROIZEN AND J. PEARL minimax procedure and/or tree search procedures, Artificial Intelligence
Games and CSP search 1. Games: A) General Minimax search: For example, calling top-level 6.034 Artificial Intelligence.
Artificial Intelligence Recursive best-first minimax search example 99-109. [3) H.J. Berliner, The B* tree search algorithm: A best-first proof procedure
Im trying to create my first game using the minimax algorithm but i dont know how to implement this using a tree. The game rules are the following: On table there are
Based upon our search strategy,) ARTIFICIAL INTELLIGENCE 327 The,-Minimax Search Procedure for Trees Containing Chance Nodes .
Prerequisites: Minimax Algorithm in Game Theory, Evaluation Function in Game Theory. Let us combine what we have learnt so far about minimax and evaluation function
CSC384: Intro to Artificial Intelligence Game Tree Search I some examples of simple zero-sum and Minimax Strategy:
22/01/2012 · Explanation of the concepts and code of Minimax algorithm with alternate moves. Search: Games, Minimax, CSCI 6350 Artificial Intelligence: Minimax
Heuristic evaluation and games Wichita State Universit
Artificial Intelligence Adversarial Search . An optimal procedure: •Problem with minimax search is that number of game
ARTIFICIAL INTELLIGENCE 327 The ,-Minimax Search Procedure for Trees Containing Chance Nodes Bruce W. Ballard Departmetzt of Computer Science, Duke
Minimax – Topic:Artificial Intelligence – Online Encyclopedia – What is what? Everything you always wanted to know
Eszterházy Károly Collage Institute of Mathematics and Informatics 8 Example programs Surely everyone have thought about what artificial intelligence is?
• minimax procedure: search down several doubles depth of search • A simple example of reasoning about ‘which Introduction to Artificial Intelligence – city of god film pdf Teleology (a.k.a – what is the purpose of this post?) Recently, I finished an artificial intelligence project that involved implementing the Minimax and Alpha-Beta
… November 2008 ARTIFICIAL INTELLIGENCE Explain the following with respect to minimax procedure What is a greedy best first search? Explain with example
Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about In minimax search, For example, in
Artificial Intelligence in Games: An example of hard-coded video the computer would perform a short minimax search of the possible state space
Module 3 Problem Solving using Search- Here is an example of Alpha-Beta search: In the above tree use the minimax procedure along with alpha-beta pruning to
Minimax (sometimes MinMax or MM) is a decision rule used in artificial intelligence, decision theory, game theory, statistics and philosophy for minimizing the
… Artificial Intelligence Notes: Minimax and Minimax Procedure on a Complete Search The Alpha-Beta Procedure Alpha-beta pruning is a procedure to
The previous example analyzed what can be pruned. Minimax with Most real games are too big to carry out minimax search, Artificial Intelligence, Poole
Minimax in artificial intelligence generate one more search of the tree by MiniMAX principle • Optimal procedure • Minimax algorithm & an example
A step-by-step guide to building a simple chess AI. This helps us evaluate the minimax search tree much deeper, as is shown in the following example:
ARTIFICIAL INTELLIGENCE 347 A Comparison of Minimax Tree Search Algorithms minimax procedure which searching procedures, Artificial Intelligence 14
Game Playing and minimax algorithm DeveloperCoding
This book offers students and AI programmers a new perspective on the study of artificial intelligence concepts. The essential topics and theory of AI are presented
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. For example
Implementing Minimax Search and AlphaBeta Pruning alpha-beta-pruning artificial-intelligence full recursive search procedure described
Nim game tree + minimax. Browse other questions tagged artificial-intelligence search-trees game-theory or ask your own question. asked. 5 years, 11
Module nptel.ac.in
Topic minimax-search · GitHub
utility functions minimax search. Another example would be chess Browse other questions tagged artificial-intelligence minimax or ask your own question.
Put “OR” between each search query. For example, Lecture 6: Search: Games, Minimax, and Alpha -Beta to the artificial intelligence
• minimax procedure: search down several levels; doubles depth of search • A simple example of reasoning about ‘which computations are Minimax search,
… (example at http Most evaluation functions in a minimax search are Browse other questions tagged algorithm artificial-intelligence evaluation minimax or
The minimax search is then initiated up to a depth of two plies and to more plies and so on. (For example, chess game may be (Procedure) Artificial
A minimax algorithm better than alpha-beta? Yes and No
CS 188 Artificial Intelligence
This book brings together some new insights and recent developments on the topics of search procedures in Artificial Intelligence and the relationships among search
16/10/2018 · python artificial-intelligence minimax-search Implemented in C++ using Minimax Search with Example of implementing a minimax algorithm for a
Artificial Intelligence: Search Methods D. Kopec and T.A. Marsland the minimax procedure, Tree Searching Example of Depth First Search and Breadth First Search
Connect Four Minimax Algorithm – gimu.org
Minimax Search with Alpha-Beta Pruning. Alpha-beta pruning is an optimisation of the minimax algorithm. It limits the search space by For this example the whole
Introduction to Artificial Intelligence MINIMAX procedure to search the game Example 1. Alpha-beta pruning:
… by minimax game trees. Among various search Searching minimax game trees under memory SSS * search procedures, Artificial Intelligence
The *-minimax search procedure for trees containing chance Principles of Artificial Intelligence, Ballard B.W.Non-minimax search strategies for use against
CS 188: Artificial Intelligence Fall 2010 Lecture 7: Minimax Example 10 Max nodes as in minimax search
The basic idea behind this modification to the minimax search algorithm P. Artificial Intelligence: Alpha – Beta Pruning reference for the Tic Tac Toe example.
And that’s the minimax algorithm! Ruby Example. Below is a Ruby implementation of Tic-Tac-Toe. It has a few limitations – for example, the
Minimax Algorithm. Artificial Intelligence based on the Minimax- and α-β-Pruning principles.
Introduction to Artificial Intelligence Spring 2010 Lecture #5. Minimax procedure –Result is you can search twice as deep as minimax!
Minimax search procedure to find an optimum move is a depth-first and depth MiniMax example. Introduction to Artificial Intelligence Game Playing and MiniMax
Minimax Wikipedia
Introducing the Min-Max Algorithm
– A comparison of minimax tree search algorithms ScienceDirect
CS 771 Artificial Intelligence Wichita State University
ARTIFICIAL INTELLIGENCE 327 The-Minimax Search Procedure
artificial intelligence utility functions minimax search
ARTIFICIAL INTELLIGENCE 327 The-Minimax Search Procedure
Minimax search and Alpha-Beta Pruning
ARTIFICIAL INTELLIGENCE 347 A Comparison of Minimax Tree Search Algorithms minimax procedure which searching procedures, Artificial Intelligence 14
• minimax procedure: search down several doubles depth of search • A simple example of reasoning about ‘which Introduction to Artificial Intelligence
66-415 Introduction to Artificial Intelligence — Spring 2006. Minimax Search for Dots. The minimax search procedure For example, you can use
Artificial Intelligence Adversarial Search . An optimal procedure: •Problem with minimax search is that number of game
utility functions minimax search. Another example would be chess Browse other questions tagged artificial-intelligence minimax or ask your own question.
Eszterházy Károly Collage Institute of Mathematics and Informatics 8 Example programs Surely everyone have thought about what artificial intelligence is?
Based upon our search strategy,) ARTIFICIAL INTELLIGENCE 327 The,-Minimax Search Procedure for Trees Containing Chance Nodes .
CSC384: Intro to Artificial Intelligence Game Tree Search I some examples of simple zero-sum and Minimax Strategy:
Games and CSP search 1. Games: A) General Minimax search: For example, calling top-level 6.034 Artificial Intelligence.
Artificial Intelligence Chapter 5 Adversarial Search
Lecture 6 Search Games Minimax and Alpha-Beta
Artificial Intelligence Adversarial Search . An optimal procedure: •Problem with minimax search is that number of game
10/08/2010 · Learn every thing about Artificial Intelligence here from a Alpha-Beta Cut Offs(Pruning) search opens as many leaves as minimax on a game tree
CSE 473: Artificial Intelligence Autumn 2011 Minimax search min! Alpha-Beta Pruning Example 3 12 2 5 1 8 14 ≥8
Artificial Intelligence(AI) CS6659 – AI Notes. Pages. MINIMAX Tree Game playing has depth-limited search procedure.
Introduction to Artificial Intelligence Spring 2010 Lecture #5. Minimax procedure –Result is you can search twice as deep as minimax!
… (Procedure) Artificial Intelligence. In this article we will discuss about minimax and negmax procedure of A minimax search at this level
The minimax search is then initiated up to a depth of two plies and to more plies and so on. (For example, chess game may be (Procedure) Artificial
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. For example
Minimax – Topic:Artificial Intelligence – Online Encyclopedia – What is what? Everything you always wanted to know
Lecture 6 Search Games Minimax and Alpha-Beta
artificial intelligence Nim game tree minimax
Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about In minimax search, For example, in
… A Minimax Algorithm Better than Alpha-Beta? ROIZEN AND J. PEARL minimax procedure and/or tree search procedures, Artificial Intelligence
… November 2008 ARTIFICIAL INTELLIGENCE Explain the following with respect to minimax procedure What is a greedy best first search? Explain with example
Introduction to Artificial Intelligence MINIMAX procedure to search the game Example 1. Alpha-beta pruning:
66-415 Introduction to Artificial Intelligence — Spring 2006. Minimax Search for Dots. The minimax search procedure For example, you can use
17/04/2017 · Alpha Beta pruning in artificial Intelligence in hindi Search: Games, Minimax, A* algorithm in artificial intelligence in hindi
Artificial Intelligence(AI) CS6659 – AI Notes. Pages. MINIMAX Tree Game playing has depth-limited search procedure.
I wrote this code to demonstrate how to program artificial intelligence Let’s walk through an example using the We will build our search tree using Node
• minimax procedure: search down several levels; doubles depth of search • A simple example of reasoning about ‘which computations are Minimax search,
The minimax search is especially known for this search algorithm is based on von Neumann’s minimax theorem which states that Artificial Intelligence
This book brings together some new insights and recent developments on the topics of search procedures in Artificial Intelligence and the relationships among search
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. For example
16/10/2018 · python artificial-intelligence minimax-search Implemented in C using Minimax Search with Example of implementing a minimax algorithm for a
CSC384: Intro to Artificial Intelligence Game Tree Search I some examples of simple zero-sum and Minimax Strategy:
Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about In minimax search, For example, in
Heuristic evaluation and games Wichita State Universit
… by minimax game trees. Among various search Searching minimax game trees under memory SSS * search procedures, Artificial Intelligence
An Exhaustive Explanation of Minimax a Staple AI Algorithm
Minimax Search with Alpha-Beta Pruning [Algorithm Wiki]
Artificial Intelligence Popular Search Algorithms
Games and CSP search 1. Games: A) General Minimax search: For example, calling top-level 6.034 Artificial Intelligence.
* Minimax (Artificial Intelligence) Definitionmeaning
utility functions minimax search. Another example would be chess Browse other questions tagged artificial-intelligence minimax or ask your own question.
minimax Adversarial search in the game ‘2048
Contribute to udacity/artificial-intelligence You can build a basic agent by combining minimax search with (for example, alpha-beta search
66-415 Introduction to Artificial Intelligence — Fall 1995
Module nptel.ac.in
… by minimax game trees. Among various search Searching minimax game trees under memory SSS * search procedures, Artificial Intelligence
artificial intelligence utility functions minimax search
Notes Minimax and Alpha Beta Pruning Computer Science
The basic idea behind this modification to the minimax search algorithm P. Artificial Intelligence: Alpha – Beta Pruning reference for the Tic Tac Toe example.
Artificial Intelligence A Systems Approach Google Books
* Minimax (Artificial Intelligence) Definitionmeaning
… (Procedure) Artificial Intelligence. In this article we will discuss about minimax and negmax procedure of A minimax search at this level
* Minimax (Artificial Intelligence) Definitionmeaning
Prerequisites: Minimax Algorithm in Game Theory, Evaluation Function in Game Theory. Let us combine what we have learnt so far about minimax and evaluation function
Artificial Intelligence Alpha-Beta Cut Offs(Pruning)
ARTIFICIAL INTELLIGENCE & FUZZY LOGIC BUIT
Artificial Intelligence: Search Methods D. Kopec and T.A. Marsland the minimax procedure, Tree Searching Example of Depth First Search and Breadth First Search
AI_prsolutions08 Technology Artificial Intelligence
Minimax Algorithm in Game Theory Set 3 (Tic-Tac-Toe AI
Alpha Beta Pruning Notes
Artificial Intelligence(AI) CS6659 – AI Notes. Pages. MINIMAX Tree Game playing has depth-limited search procedure.
Heuristics in Game Playing (Procedure) Artificial
ARTIFICIAL INTELLIGENCE 327 The-Minimax Search Procedure
A comparison of minimax tree search algorithms ScienceDirect
Implementing Minimax Search and AlphaBeta Pruning alpha-beta-pruning artificial-intelligence full recursive search procedure described
artificial intelligence Nim game tree + minimax
Implementing Minimax Search and AlphaBeta Pruning alpha-beta-pruning artificial-intelligence full recursive search procedure described
The -Minimax Search Procedure for Trees Containing Chance
• minimax procedure: search down several levels; doubles depth of search • A simple example of reasoning about ‘which computations are Minimax search,
The -Minimax Search Procedure for Trees Containing Chance
This algorithm is built around two recursive procedures. It finds the minimax value As an example we prove SSS* Search Problems, Artificial Intelligence
Eszterházy Károly Collage Institute of Mathematics and
Minimax Search Artificial Intelligence
CS312 Recitation 21 Minimax search and Alpha-Beta Pruning. A game can be thought of as a tree of possible future game states. For example, in Gomoku the game state is
Module nptel.ac.in
• minimax procedure: search down several doubles depth of search • A simple example of reasoning about ‘which Introduction to Artificial Intelligence
Notes Minimax and Alpha Beta Pruning Computer Science
The *-minimax search procedure for trees containing chance
minimax How do I choose which algorithm is best for
CS312 Recitation 21 Minimax search and Alpha-Beta Pruning. A game can be thought of as a tree of possible future game states. For example, in Gomoku the game state is
Heuristic evaluation and games Wichita State Universit
This book brings together some new insights and recent developments on the topics of search procedures in Artificial Intelligence and the relationships among search
A step-by-step guide to building a simple chess AI
AI_prsolutions08 Technology Artificial Intelligence
Im trying to create my first game using the minimax algorithm but i dont know how to implement this using a tree. The game rules are the following: On table there are
Alpha Beta Pruning Notes
Module 3 Problem Solving using Search- Here is an example of Alpha-Beta search: In the above tree use the minimax procedure along with alpha-beta pruning to
AI_prsolutions08 Technology Artificial Intelligence
The -Minimax Search Procedure for Trees Containing Chance
dblp Artificial Intelligence Volume 21
• minimax procedure: search down several doubles depth of search • A simple example of reasoning about ‘which Introduction to Artificial Intelligence
CS 771 Artificial Intelligence Wichita State University
CS 188 Artificial Intelligence
• minimax procedure: search down several doubles depth of search • A simple example of reasoning about ‘which Introduction to Artificial Intelligence
Games and CSP search 1. Games MIT OpenCourseWare
CS 188: Artificial Intelligence Fall 2010 Lecture 7: Minimax Example 10 Max nodes as in minimax search
Artificial Intelligence Alpha-Beta Cut Offs(Pruning)
ARTIFICIAL INTELLIGENCE & FUZZY LOGIC BUIT
Searching minimax game trees under memory space constraint
This algorithm is built around two recursive procedures. It finds the minimax value As an example we prove SSS* Search Problems, Artificial Intelligence
Search in artificial intelligence Laveen N. Kanal Vipin
The *-minimax search procedure for trees containing chance
Lecture 6 Search Games Minimax and Alpha-Beta
Artificial Intelligence Stack Exchange is a question and answer site for people interested in Browse other questions tagged search minimax or ask your own
The *-minimax search procedure for trees containing chance
minimax How do I choose which algorithm is best for
… Artificial Intelligence Notes: Minimax and Minimax Procedure on a Complete Search The Alpha-Beta Procedure Alpha-beta pruning is a procedure to
ARTIFICIAL INTELLIGENCE & FUZZY LOGIC BUIT
Introducing the Min-Max Algorithm Paulo Pinto 6 An example implementation 5 a brief introduction to search trees is required.
Minimax Wikipedia
Heuristic evaluation and games Wichita State Universit
Alpha Beta Pruning Notes
… Artificial Intelligence Notes: Minimax and Minimax Procedure on a Complete Search The Alpha-Beta Procedure Alpha-beta pruning is a procedure to
Alpha–beta pruning Wikipedia
Notes Minimax and Alpha Beta Pruning Computer Science
artificial-intelligence/Projects/3_Adversarial Search at
Im trying to create my first game using the minimax algorithm but i dont know how to implement this using a tree. The game rules are the following: On table there are
66-415 Introduction to Artificial Intelligence — Fall 1995
artificial-intelligence/Projects/3_Adversarial Search at
codebytes Minimax Algorithm Tic Tac Toe AI In Java
Minimax (sometimes MinMax or MM) is a decision rule used in artificial intelligence, decision theory, game theory, statistics and philosophy for minimizing the
Minimax Algorithm (with alternate moves) YouTube
CSC384 Intro to Artificial Intelligence Game Tree Search I
Nim game tree + minimax. Browse other questions tagged artificial-intelligence search-trees game-theory or ask your own question. asked. 5 years, 11
Artificial Intelligence Search Methods D. Kopec and T.A
Minmax Algorithm in Artificial Intelligence in Hindi
Contribute to udacity/artificial-intelligence You can build a basic agent by combining minimax search with (for example, alpha-beta search
Alpha Beta Pruning Notes
CS 771 Artificial Intelligence Wichita State University
Introduction to Artificial Intelligence MINIMAX procedure to search the game Example 1. Alpha-beta pruning:
A step-by-step guide to building a simple chess AI
ARTIFICIAL INTELLIGENCE & FUZZY LOGIC BUIT
GitHub alulema/ai-isolation Game-playing Agent
ARTIFICIAL INTELLIGENCE 347 A Comparison of Minimax Tree Search Algorithms minimax procedure which searching procedures, Artificial Intelligence 14
The -Minimax Search Procedure for Trees Containing Chance
Minimax Search Artificial Intelligence
Alpha–beta pruning Wikipedia
Articles on Artificial Intelligence Minimax Search Algorithm. The standard algorithm for two-player perfect-information games such as chess, checkers or othello
Artificial Intelligence Chapter 5 Adversarial Search
Minimax search procedure to find an optimum move is a depth-first and depth MiniMax example. Introduction to Artificial Intelligence Game Playing and MiniMax
Minimax SlideShare
AI with Python tutorialspoint.com
Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about In minimax search, For example, in
artificial intelligence utility functions minimax search
Artificial Intelligence(AI) MINIMAX Tree
minimax How do I choose which algorithm is best for
Module 3 Problem Solving using Search- Here is an example of Alpha-Beta search: In the above tree use the minimax procedure along with alpha-beta pruning to
AI with Python tutorialspoint.com
Eszterházy Károly Collage Institute of Mathematics and Informatics 8 Example programs Surely everyone have thought about what artificial intelligence is?
Eszterházy Károly Collage Institute of Mathematics and
And that’s the minimax algorithm! Ruby Example. Below is a Ruby implementation of Tic-Tac-Toe. It has a few limitations – for example, the
Searching minimax game trees under memory space constraint
CS312 Recitation 21 Minimax search and Alpha-Beta Pruning. A game can be thought of as a tree of possible future game states. For example, in Gomoku the game state is
Connect Four Minimax Algorithm – gimu.org
66-415 Introduction to Artificial Intelligence — Fall 1995
CS 771 Artificial Intelligence Wichita State University
A step-by-step guide to building a simple chess AI. This helps us evaluate the minimax search tree much deeper, as is shown in the following example:
Artificial Intelligence Alpha-Beta Cut Offs(Pruning)
ARTIFICIAL INTELLIGENCE 327 The,-Minimax Search Procedure for Based upon our search strategy,)re formulate and then analyze several algorithnzs for *-minimax
An Exhaustive Explanation of Minimax a Staple AI Algorithm
Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about In minimax search, For example, in
Best-first minimax search ScienceDirect
Implementing Minimax and Alpha-Beta Pruning Using Python
Search in artificial intelligence Laveen N. Kanal Vipin
The previous example analyzed what can be pruned. Minimax with Most real games are too big to carry out minimax search, Artificial Intelligence, Poole
codebytes Minimax Algorithm Tic Tac Toe AI In Java
Minimax Wikipedia
16/10/2018 · python artificial-intelligence minimax-search Implemented in C++ using Minimax Search with Example of implementing a minimax algorithm for a
11.3 Computing Strategies with Perfect Information
66-415 Introduction to Artificial Intelligence — Spring 2006. Minimax Search for Dots. The minimax search procedure For example, you can use
A step-by-step guide to building a simple chess AI
Alpha–beta pruning Wikipedia
Heuristic evaluation and games Wichita State Universit