aind
Here are 30 public repositories matching this topic...
-
Updated
Nov 29, 2018 - Python
Solving Sudoku using constraint propagation and depth-first state-space search
-
Updated
Apr 27, 2017 - Python
State-Space Planning using A* Progression Search with Planning Graph Heuristics
-
Updated
Jun 18, 2017 - Python
Part of Artificial Intelligence Nanodegree (AIND) from Udacity. Second project in Term 1 in the subject of the minimax algorithm.
-
Updated
Feb 4, 2017 - Python
This is the second project for Artificial Intelligence Nanodegree @udacity . This is the game Isolation playing agent.
-
Updated
Jul 22, 2017 - Python
projects for Udacity's AI nanodegree
-
Updated
Nov 9, 2023 - Python
This is the Pacman AI agent implemented as a search problem with DFS, UCS, BFS, A* with different heuristic functions. This project was a part of Artificial Intelligence Nanodegree @udacity.
-
Updated
Jul 23, 2017 - Python
🤖 Classical Planning with AI, from Udacity AI Nanodegree
-
Updated
Aug 21, 2018 - Python
This is the first project for Artificial Intelligence Nanodegree @udacity. Sudoku solver.
-
Updated
Jul 21, 2017 - Python
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
-
Updated
Nov 29, 2018 - Python
Machine Learning Engineer Capstone Project. Multi-Class Deep Learning Classification (CNN) to classify images in the Amazon Rainforest. Kaggle Competition.
-
Updated
Aug 19, 2018 - Python
My version of the udacity AI nanodegree isolation project
-
Updated
Nov 26, 2017 - Python
-
Updated
Feb 23, 2017 - Python
🤖 Solve Sudoku with AI, from Udacity AI Nanodegree
-
Updated
Aug 21, 2018 - Python
-
Updated
Jun 3, 2018 - Python
Python(Flask-ask) version of Udacity's Alexa Project https://github.com/udacity/AIND-VUI-Alexa
-
Updated
Aug 9, 2017 - Python
My implementation of the AIND classical planning project. The required modifications are included in the "my_planning_graph.py". The comparison results among different algorithms (e.g., depth-first, breadth-first, A*, greedy, uniform-cost) with different heuristics (e.g., unmet goals, max-level, level-sum, set-level) in terms of actions, expansi…
-
Updated
Nov 29, 2018 - Python
Improve this page
Add a description, image, and links to the aind topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the aind topic, visit your repo's landing page and select "manage topics."