depth-first-search-backtracking

Here are 7 public repositories matching this topic...

bren007pie / NPC_Racer

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++

jessicastow / AIMS_Masters_Application

Star

Data Structures and Algorithms Coding question as part of the AIMS AI for Science Masters Application 2023

python depth-first-search algorithms-and-data-structures depth-first-search-backtracking

Updated Apr 3, 2023
Python

sandeepkv93 / CSE537-Artificial-Intelligence-Stonybrook-University

Star

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

Shivank1006 / Maze-Generator

Star

This script uses the p5.js to generate a random maze by a modified version of Depth First Search Algorithm.

maze-generator dfs-algorithm p5-js depth-first-search-backtracking

Updated Jul 27, 2020
JavaScript

rg1990 / cv-codeword-solver

Star

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

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.

c algorithms graph-algorithms depth-first-search-backtracking

Updated Jun 16, 2019
C

ADVAIT135 / Artificial-Intelligence-ELL703_TW

Star

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.

Curate this topic

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."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

depth-first-search-backtracking

Here are 7 public repositories matching this topic...

bren007pie / NPC_Racer

jessicastow / AIMS_Masters_Application

sandeepkv93 / CSE537-Artificial-Intelligence-Stonybrook-University

Shivank1006 / Maze-Generator

rg1990 / cv-codeword-solver

ioleksiuk / Lem_in

ADVAIT135 / Artificial-Intelligence-ELL703_TW

Improve this page

Add this topic to your repo