Example lecture for Constraint Satisfaction Problems in an interactive jupyter notebook. With python code to solve CSPs, with visualization of Sudoku and NQueens problems.
-
Updated
Dec 7, 2018 - Jupyter Notebook
#
forward-checking
Here are 3 public repositories matching this topic...
Contains notebook implementations for the AI based assignments using graph based algorithms that are commonly used in solving AI based problems. Algorithms include BFS, DFS, Hill Climbing, Differential Evolution, Genetic, Back Tracking..
neural-network
algorithms
genetic-algorithm
artificial-intelligence
sudoku-solver
dfs
dynamic-programming
bfs
hill-climbing-search
othello-game
forward-checking
heuristic-search-algorithms
backtracking-algorithm
travelling-salesman-problem
-
Updated
Feb 4, 2020 - Jupyter Notebook
Implementation of a Forward-Planning Agent for Udacity's Artificial Intelligence Nanodegree (v3.0). This project is the solution for the notebook from the classroom (topic: Classical Planning).
-
Updated
Jun 6, 2019 - Python
Improve this page
Add a description, image, and links to the forward-checking topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the forward-checking topic, visit your repo's landing page and select "manage topics."