adversial-search
There are 0 repository under adversial-search topic.
Hamid-Rezaei / Berkeley-AI-Projects
Fundamental of AI course which focuses on search, multiagents, mdp and reinforcement learning algorithms.
Language:Python 4chanddu / Backgammon-python-numpy-
Implemented a expectiminimax agent (2-ply search) with alpha – beta pruning and forward pruning (to reduce the branching factor in the game tree) to determine the best move give the state of the board.
Language:Python 3- Language:Python 3
AjaySurya-018 / TicTacToe-AI-Game
TicTacToe is a fun game, implemented using Minimax algorithm
Language:Python 1Shukti042 / Artificial-Intelligence
Artificial Intelligence
Language:Java 1SheidaAbedpour / Pacman-Multi-Agent-Search
This project implements a Pacman agent using the minimax algorithm with alpha-beta pruning and a custom evaluation function.
Language:Python 0- Language:Python 0
Caknoooo / FP_Kecerdasan_Buatan_D06
Kami dari kelas Kecerdasan Buatan D Kelompok 6 akan mengimplementasikan algoritma-algoritma yang telah diajarkan pada Final Project ETS kali ini
Language:Pythonmr-amirfazel / AI_Pacman
this repository contains my codes for fundamentals of AI course projects
Language:Pythonnikashahabi / othello-game-with-adversarial-search
Implements an agent to play Othello with adversarial search
Language:Pythonshambakey1 / MCTS_adversial_search
Implementation of Udacity Nanodegree adversial search project using Monte Carlo Tree Search (MCTS). My implementation is a modification of the MCTS at "https://github.com/int8/monte-carlo-tree-search" to suit the project's knights isolation game. My implementation is in the "my_custom_player.py" file
Language:Python
