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

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

Smart Vacuum Cleaner Agent

分别基于BFS，Uniform-Cost，A*算法的3D路径检索

This repository provides the implementaion of data structures in Java programming langauge

solve 8-puzzle with BFS Search

A music recommendation app based on danceability data from Spotify. It recommends songs based on similarity in genre and danceability score

Design Analysis Algorithm Course Project 2023 - UNIVERSITAS MARITIM RAJA ALI HAJI FAKULTAS TEKNIK DAN TEKNOLOGI KEMARITIMAN PROGRAM STUDI TEKNIK INFORMATIKA

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.

Puzzle 8 Game Environment & BFS Agent to solve the game, with time and space analysis

A Data Structure-focused example on how to implement a family tree in Java. Good for university students ;)

Breadth First 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.

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)

Maze Runner, which consists of multiple levels of increasing difficulty levels for the users to play and compete against the computers and themselves. Features: random maze generation on run-time, visualization of the shortest path using BFS, and is made user-friendly by the inclusion and application of UI.

This code exercise is (very loosely) based on some of the ideas in old school text adventure games.

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