Follow us:
Nabla Squared

Game Theory

Playing 2048 with Minimax Part 1: How to apply Minimax to 2048

2048 — a simple game, but programming a computer to solve it it’s not trivial Minimax is an algorithm designated for playing adversarial games, that is games that involve an adversary. In this article, we’ll see how we can apply the minimax algorithm to solve the 2048 game. This is Read more…

By Dorian, 2 yearsNovember 23, 2020 ago

Understanding the Minimax Algorithm

Playing games with AI Let’s say you play a game with a friend. And the metric of “how good you perform in that game” is measured by a numeric score which increases when you get closer to “winning the game” than your friend and decreases when your friend gets closer Read more…

By Dorian, 2 yearsNovember 23, 2020 ago
Search
Tags
Algorithms (1) Artificial Intelligence (10) Beautiful Soup (2) Books (1) C (2) C++ (1) Data Extraction (1) Data Science (6) Deep Learning (2) Game Theory (2) GANs (1) Generative Models (1) GRU (1) Hypothesis Testing (4) Jupyter Extension (3) Jupyter Notebook (3) Keras (1) Language Model (1) Linear Regression (4) Logistic Regression (4) LSTM (1) Machine Learning (18) Mathematics (9) Maximum Likelihood (1) Minimax Algorithm (4) Neural Networks (5) NLP (2) NumPy (5) Pandas (2) Playing 2048 with Minimax (3) Probability (2) Programming (14) PyPy (1) Python (27) PyTorch (2) R (1) ResNet (1) RNN (2) Scikit-Learn (2) Selenium (1) Sentiment Analysis (1) Statistics (4) TensorFlow (4) Web Scraping (3) Writing (2)
    Copyright © 2021 | Nabla Squared
    Hestia Theme | Powered by WordPress