Data Structures and Algorithms Coding question as part of the AIMS AI for Science Masters Application 2023
-
Updated
Apr 3, 2023 - Python
#
depth-first-search-backtracking
Here are 9 public repositories matching this topic...
A project comparing the execution speed of pathfinding algorithms on mazes for video game agents.
graph-algorithms maze pathfinding npc dijkstra maze-algorithms depth-first-search dijkstra-algorithm maze-solver dijkstra-shortest-path maze-explorer depth-first-search-backtracking
-
Updated
Jan 18, 2023 - C++
Recursive solution to the knapsack problem. Written in C.
recursion recursive-functions dfs recursive subset recursive-algorithm depth-first-search knapsack-problem dfs-algorithm knapsack subset-sum recursion-problem recursive-algorithms knapsack-solver knapsack-solution depth-first-search-backtracking dfs-search recursion-algorithm knapsack-recursive depth-first-search-algorithm
-
Updated
Mar 17, 2025 - C
This program creates a maze using the backtracking or DFT (Depth First Traversal) Algorithm
-
Updated
Apr 27, 2025 - JavaScript
A codeword puzzle solver using computer vision, deep learning, depth-first search and a trie data structure
python computer-vision deep-learning keras-tensorflow codebreaker data-structures-and-algorithms open-cv codeword depth-first-search-backtracking trie-data-structure word-puzzles
-
Updated
Aug 16, 2023 - Python
This script uses the p5.js to generate a random maze by a modified version of Depth First Search Algorithm.
-
Updated
Jul 27, 2020 - JavaScript
Homework Assignments for CSE 537 - Artificial Intelligence Spring 2018 in Stony Brook University under Prof. Niranjan Balasubramanian
text-classification constraint-satisfaction-problem stony-brook mrv-heuristic scikitlearn-machine-learning moving-tiles a-star-search lcv-heuristic depth-first-search-backtracking niranjan-balasubramanian
-
Updated
Jun 11, 2018 - Python
Your ant colony must move from one point to another. But how to make it the shortest path possible? This project introduces you to graphing algorithms: your program will have to intelligently select the precise paths and movements that these ants must take.
-
Updated
Jun 16, 2019 - C
This Repository consists of all programming tasks given as a Term Work for Artificial Intelligence ELL703 in BE Electronics R-19 C- Scheme Syllabus.
prolog artificial-intelligence searching-algorithms breadth-first-search hill-climbing-search depth-first-search min-max prolog-programming-language adversarial-machine-learning prolog-application depth-first-search-backtracking hill-climbing-algorithm
-
Updated
Oct 1, 2022 - Jupyter Notebook
Improve this page
Add a description, image, and links to the depth-first-search-backtracking topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the depth-first-search-backtracking topic, visit your repo's landing page and select "manage topics."