Recursive solution to the knapsack problem. Written in C.
-
Updated
Mar 17, 2025 - C
Recursive solution to the knapsack problem. Written in C.
Data Structures and Algorithms Coding question as part of the AIMS AI for Science Masters Application 2023
A project comparing the execution speed of pathfinding algorithms on mazes for video game agents.
This program creates a maze using the backtracking or DFT (Depth First Traversal) Algorithm
This Repository consists of all programming tasks given as a Term Work for Artificial Intelligence ELL703 in BE Electronics R-19 C- Scheme Syllabus.
This script uses the p5.js to generate a random maze by a modified version of Depth First Search Algorithm.
Homework Assignments for CSE 537 - Artificial Intelligence Spring 2018 in Stony Brook University under Prof. Niranjan Balasubramanian
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.
A codeword puzzle solver using computer vision, deep learning, depth-first search and a trie data structure
Add a description, image, and links to the depth-first-search-backtracking topic page so that developers can more easily learn about it.
To associate your repository with the depth-first-search-backtracking topic, visit your repo's landing page and select "manage topics."