This is the collection of solutions to some computer problems, mainly leetcode

Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.

Eight Puzzle solver using BFS, DFS & A* search algorithms

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

Sliding Puzzle solver and utilities

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.

classical search algorithms are used in AI | AI course - Fall 2018

A collection of some of the most frequently used Algorithms in C++ and Python

Principles Of AI Lab Exercises

8 puzzle solver using BFS, DFS and A star

Path Finding Visualizer 🏁

Breadth-first search (BFS) is an algorithm for searching a tree data structure that searches the tree one depth at a time. It will explore all nodes at depth 1 then depth 2 and so on. Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followe…

CIT-316 (Artificial Intelligence Sessional)

Implementation of various algorithms

Breadth First Search and Depth First Search implementation in python.

Depth First Search and Breadth First Search Implementation in Python

While studying for an exam, I made these two small projects that show animation of both DFS(Depth-First-Search) and BFS(Breadth-First-Search. After the exam, I have decided to merge these two projects and annotate them so others can study off what I made for myself.)