- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax ♣
Algorithms
Machine Learning
Decision Making / Minimax »
The scope of the algorithm is to maximize my score. In the same time, you will try to minimize my score. We evaluate each node's children on the other one player.
What's the scope when using minimax algorithm? What must be taken into account? What are the node's children that we evaluate?
Click to Flip Card
