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

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

Smart Vacuum Cleaner Agent

Maze solver Using DFS as it's Searching method

Solution to some classic AI Search Problems implemented in java

This is a practice for AI Search Algorithm. Grocery Bagging is a Constraint Satisfaction Problem (CSP). I used Backtracking search algorithm (Depth-First-Search) along with arc-consistency, Most Restrictive Value (MRV) and Least Constraining Value (LCV) heuristics for prioritizing and pruning to solve the problem as efficiently as possible.

This project simulates a Type ahead feature with an in memory database(using Redis) which is similar to google's auto suggestion feature when typing in a search command. It is a complete standalone project which consists of backend which implements Trie and prefixweb which is used to call backend logic using REST API. --

The most popular Artificial Intelligence problem, the Water Jug poblem. There are two jugs of volume A litre and B litre. Neither has any measuring mark on it. There is a pump that can be used to fill the jugs with water. How can you get exactly x litre of water into the A litre jug. Assuming that we have unlimited supply of water.

Using search algorithms to find the best possible way for "n" people to cross a bridge (within some constraints)

This repo contains my research project "Solving the N-Queens Problem with Exhaustive Search and Genetic Algorithms". It includes four distinct algorithms for solving the N-Queens problem: Depth-First Search (DFS), Hill Climbing (HC), Simulated Annealing (SA), Genetic Algorithms (GA)

My implementation of a not so common challenge: implement an efficient weighted graph traversal algorithm.

As I submitted the assignment and no-longer be updated, I archived this repository. If you have any question or comments, please send me an email. (Assignment Webpage: http://pages.cs.wisc.edu/~yw/CS540P5S20E.htm)

Visualization of DFS tree from General Graph. After taking the General Graph from the user. The application then draws the DFS tree using the DFS search strategy.

A console-based AI Algorithm Simulator for learning and visualizing core search algorithms used in Artificial Intelligence.

A simple Java program to demonstrate how to perform DFS and BFS on a graph.

Use DFS algorithm to perform traverse tree and blind search

Solves a N-Dimension Puzzle with one of the 4 different path algorithms : Breadth 1st Search, Depth 1st Search, Best 1st Search and A* Search.

DFS implementation for solving the water-pouring jug problem

A DFS algorithm based on both recursion and iteration to solve a chess like board game.

exploring diffrent search algorithms, in order to solve graph coloring problem