PyPI package for traversing extremely large FTP directory trees
2D maze path solver visualizer implemented with python
We optimize SIEP algorithm in multiple intelligent agents scenario and comparatively research A*, DFS, BFS, Dijkstra, PFP and PRM.
8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing
🚗 AI-powered Rush Hour puzzle solver with Pygame GUI. Features BFS, DFS, UCS & A algorithms to solve traffic jam puzzles. Compare AI performance metrics, play manually, or watch automated solutions. Educational tool for learning search algorithms.
Six Tetris Artificial Intelligence Algorithms Showdown
N-Puzzle implementation with BFS, DFS, Greedy and A*
A simple tkinter GUI for illustrating DFS and BFS.
Simulation of swarm of robots used to explore and search for a target, done using Webots software.
A program to solve a maze using Breadth First Search (BFS) and Depth First Search (DFS).
SUSTech CS course artificial intelligence, including 4 seperated project
Evaluating different algorithms on the same fruit spawn seed in snake game. Genetic Algorithm vs BFS vs A* vs DFS.
Search Engine Implemented in Python. Components : Web Crawler. Indexer. Parser. Page Ranking Algorithm
Improved Multi-Robot Depth First Search Algorithm implementation using iris drones using PX4.
This repository has all of the programming assignments in the Foundations of Artificial Intelligence class at the University of Southern California in the Fall 2021 semester.
All Artificial Intelligence Search algorithms. Depth first search, Breadth first search, uniform cost search, Greedy search, A star search, Minimax and Alpha beta pruning. Implemented in Python 3.
PySiteCrawler is a Python library for web crawling and data extraction. It's designed for exploring web pages, extracting text, and managing links efficiently. You can easily store scraped data in .txt files for analysis. Future updates will add more traversal strategies.
This is a variation of the classical river crossing puzzle. In these kinds of puzzles, the limitations to the solution is defined by the constraints placed on the different objects involved.
This repository contains the solution to Missionaries and Cannibal Problem using BFS and DFS search.
Add a description, image, and links to the dfs-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dfs-algorithm topic, visit your repo's landing page and select "manage topics."