Multiplayer snake AI
-
Updated
Jul 17, 2018 - Python
Multiplayer snake AI
Solutions to Pacman AI Multi-Agent Search problems
A PyTorch Toolbox for creating adversarial examples that fool neural networks.
Code for the paper "Skynet: A Top Deep RL Agent in the Inaugural Pommerman Team Competition"
Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms
Let's play Poker, with POK-AI!
This is a AI bot for Chain Reaction game using minimax algorithm with alpha-beta pruning ang killer move heuristic.
A Gomoku-Playing AI. Using Minimax search with Alpha-Beta pruning.
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
Halma game with an AI player, move validation, and dynamic board sizing
Automated Testing Framework for CARLA Simulator [ITSC 2022]
Minimax with/without alpha-beta pruning and heuristic evaluation function.
Array of AI Search algorithms is employed to playing Pac-Man ⍩⃝.
In this project, you will design agents for the classic version of Pacman, including ghosts. Along the way, you will implement both minimax and expectimax search and try your hand at evaluation function design.
Alpha Beta pruning Breakthrough agent
Artificial Intelligence Projects
This repository contains files related to Artificial Intelligence (Spring 2022).
An abstract strategy board game named Lines of Action, implemented in Python. It is a zero-sum game that comprises the area of adversarial search in artificial intelligence.
Computer program that plays chess.
Some Artificial Intelligence & Machine Learning algorithms
Add a description, image, and links to the adversarial-search topic page so that developers can more easily learn about it.
To associate your repository with the adversarial-search topic, visit your repo's landing page and select "manage topics."