Aditi Agarwal 4ff2a9dd4e minimax ()
* minimax.py

minimax algorithm is used for game like tic tac toe. It traces the path and selects the optimal move.

* minimax.py

Minimax is used in decision making and game theory to find the optimal move for a player, when your opponent also plays optimally. It is widely used in games like Tic-Tac-Toe, Chess.

* Delete minimax.py

* Update minimax.py

* Minimax is a backtracking algorithm that is used in game theory to find the optimal move for a player, assuming that your opponent also plays optimally
2019-07-07 06:59:58 +02:00
2019-07-06 14:04:27 +05:30
2019-07-07 06:59:58 +02:00
2018-10-20 14:45:08 -05:00
2019-07-06 23:35:12 +08:00
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2018-11-12 23:38:08 +05:30
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2018-10-19 17:14:25 -05:00
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2019-07-06 11:11:20 +05:30
2019-05-26 22:03:53 +05:30
2019-07-06 11:21:08 +05:30
2019-06-02 12:14:18 +08:00
2019-07-06 20:02:06 +05:30

The Algorithms - Python

Donate   Gitter chat   Open in Gitpod

All algorithms implemented in Python (for education)

These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.

Owners

Anup Kumar Panwar   [Gmail   Gihub   LinkedIn]

Chetan Kaushik   [Gmail   Gihub   LinkedIn]

Contribution Guidelines

Read our Contribution Guidelines before you contribute.

Community Channel

We're on Gitter! Please join us.

Algorithms

Hashes

File Transfer Protocol

Backtracking

Ciphers

Arithmetic Analysis

Boolean Algebra

Traversals

Maths

Digital Image Processing

Compression

Graphs

Networking Flow

Matrix

Searches

Conversions

Dynamic Programming

Divide And Conquer

Strings

Sorts

Machine Learning

Neural Network

Data Structures

Other

Languages
Python 99.9%
Shell 0.1%