Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.
-
Updated
Sep 28, 2021 - Python
Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.
🏰 The Maze Game offers straightforward maze navigation challenges, built with Prim's & DFS Algorithms. Featuring responsive design for easy play on any device, including mobile, with intuitive on-screen controls for movement, it's ideal for quick gaming sessions, providing both casual and challenging experiences!
This is the collection of solutions to some computer problems, mainly leetcode
Eight Puzzle solver using BFS, DFS & A* search algorithms
A program to solve a maze using Breadth First Search (BFS) and Depth First Search (DFS).
Simulation of swarm of robots used to explore and search for a target, done using Webots software.
Sliding Puzzle solver and utilities
CIT-316 (Artificial Intelligence Sessional)
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.
Robot that cleans room from dirts. Finds the optimum path eventually. Same algorithms are applied as in finding path to escape a maze.
[ACL 2025] Repository for our paper "DRS: Deep Question Reformulation With Structured Output".
Principles Of AI Lab Exercises
A collection of some of the most frequently used Algorithms in C++ and Python
classical search algorithms are used in AI | AI course - Fall 2018
Breadth First Search and Depth First Search implementation in python.
8 puzzle solver using BFS, DFS and A star
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…
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
Add a description, image, and links to the dfs-search topic page so that developers can more easily learn about it.
To associate your repository with the dfs-search topic, visit your repo's landing page and select "manage topics."