dfs-algorithm

Projects done during Artificial Intelligence course at SBU

An experimental library for starting and stopping multi-service environments correctly and efficiently based on declared dependencies between them

Visualizes the searching process of a user-created environment using A*, BFS, and DFS search algorithms

Implementation and visualization of path finding algorithms in Python/Pygame.

Big task 1 solution for Algorithms and Data Structures classes at Uni

🎲Berkeley Project 1

Mangala is a Turkish strategy game played by two players. The game board consists of 12 small pits, 6 for each player, and a large storehouse where each player collects their stones. The game is played with a total of 48 stones.

Programa en Python que utiliza pygame para generación (con el algoritmo DFS) y solución de laberintos (DFS, BFS y A*)

A Python repository for Binary Tree Inversion

App that finds a connection between two actors bases on the movies they have starred in, using BFS algorithm.

A modular Python toolkit implementing foundational AI search algorithms (DFS, BFS, UCS, A*) for solving grid-based maze problems

Player vs AI to reach the destination city. Enemy uses DFS algorithm to move. For each move will play games. The first game is using KNN algorithm to guess whether it will rain or not. The second game one will use word to vactor algorithm to guess the closest word. They can remove one city, bot(AI) will use A-star algorithm to remove a city.

CISC 3410 AI project

Python app for solving mazes using A*, BFS, and DFS algos.

Artificial Intelligence project developed with Python, Jupyter Notebook, python-constraint, and Depth-First Search (DFS), featuring constraint satisfaction modelling, staff allocation problem-solving, rule-based role assignment, backtracking search, and GenAI comparison for the L8_CA_2_AI module at CCT College Dublin.

capped dfs traversal that returns output in descending order ranging from best done through bfs

University Algorithm Course Project

BFS/DFS/UCS/A* search agent with admissible Manhattan/Euclidean heuristics and a Pygame visualizer

A Java-based experimental study of search algorithms applied to the 15-Puzzle, evaluating their performance in terms of time, memory consumption, and path optimality.