-
Updated
Mar 10, 2017 - Python
iterative-deepening-search
Here are 60 public repositories matching this topic...
Term 1 Project 1 Build a Game-Playing Agent by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
-
Updated
Apr 21, 2017 - Python
-
Updated
May 31, 2017 - Python
Gameplay, minmax, alpha beta pruning
-
Updated
Jun 5, 2017 - Python
project submitted at AIND (May cohort)
-
Updated
Jun 21, 2017 - Python
☁️ Simple Sokoban Solver written in Python along with AI logic implementation
-
Updated
Aug 2, 2017 - Python
Udacity AI Nanodegree's Project for a Game playing agent for Isolation. This project uses algorithms like minimax search, alpha beta pruning and iterative deepening to create a game playing agent for a zero sum board game like Isolation.
-
Updated
Aug 7, 2017 - Python
An Artificial Intelligence that beats human opponents in the game of Isolation in Python
-
Updated
Aug 28, 2017 - Python
-
Updated
Oct 6, 2017 - Python
Game-Playing Agent
-
Updated
Oct 10, 2017 - Python
an adversarial search agent to play the game "Isolation"
-
Updated
Oct 18, 2017 - Python
Connect4 game implementation and AI with MiniMax, Alpha-Beta Pruning, Iterative Deepening
-
Updated
Nov 11, 2017 - Python
Adverserial agent for isolation game
-
Updated
Dec 17, 2017 - Python
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
-
Updated
Feb 17, 2018 - Python
Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place.
-
Updated
Feb 17, 2018 - Python
A generic python class that carries out IterativeDeepening
-
Updated
Mar 4, 2018 - Python
Numerical tic-tac-toe is similar to normal tic-tac-toe, except instead of X's and O's, the two players are given the numbers 1 - size of game board. For a 4x4 board, the goal is to have 4 numbers in a line sum to 34 (the average of numbers 1 - 16 multiplied by 4).
-
Updated
Mar 4, 2018 - Python
Eight puzzle solver using iterative deepening
-
Updated
Mar 25, 2018 - Python
Adversarial search agent to play the game "Isolation": minimax search, minimax + alpha-beta pruning + iterative deepening
-
Updated
Apr 21, 2018 - Python
simple solver for a pocket cube
-
Updated
Apr 22, 2018 - Python
Improve this page
Add a description, image, and links to the iterative-deepening-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the iterative-deepening-search topic, visit your repo's landing page and select "manage topics."