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

Compute optimal actions for a specific state of the Metin2 fishing jigsaw making use of reinforcement learning principles.

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

Sliding Puzzle solver and utilities

CIT-316 (Artificial Intelligence Sessional)

Calculate currency exchange rate using BFS Breadth First Search Graph extracted from postgres DB

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.

AI maze solving agent to find the shortest path using searching algorithms

Go package providing breadth-first search functions for arbitrary structs

基于Cocos Creator开发的走迷宫游戏

Principles Of AI Lab Exercises

This is a Maze Pathfinding Application that includes the A* Algo as-well as the BFS Algo

Breadth First Search and Depth First Search implementation in python.

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

This is a repo to store codes for the designated project of the car car class in NTUEE. We appreciate for your star to our repo.

Robot that cleans room from dirts. Finds the optimum path eventually. Same algorithms are applied as in finding path to escape a maze.

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…

an animated solver (backtracking - BFS) for rush hour