GraphLab is an application that shows visually how several graph algorithms work

DFS / BFS / IDS / UCS / Bi-directional / A* / IDA* / SMA* / ...

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

java, discrete map search, uniform cost search algorithm

This program solves 2D maze using various uninformed and informed (heuristic) search strategies.

A command line Java program developed for an artificial intelligence college course. It applies the Shortest Path Problem to a graph of fictitious cities. It uses either Best First Search or Uniform Cost Search to provide the shortest path from one city in the graph to another.

Assignment 1 of CSE 440/EEE 333/ETE 333(Artificial Intelligence) course in Northsouth University, under instructor Mirza Mohammad Lutfe Elahi

🔍 A visualization of pathfinding alogrithms (incorporating Uniform cost search, greedy search, and A* search)

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

Práctica de Sistemas Inteligentes ESI UCLM

Project | Artificial Intelligence Tournament

A Java program that uses the uniform-cost search algorithm to find the shortest path between two nodes. The program includes a unit test for building an edge (connection) between two nodes, printing out the collection of edges a node has, figuring out the shortest path between two nodes, and printing the nodes in the shortest path discovered.

Uses UCS and AStar algorithms and PALESTINE map to find the shortest path.

This is a couple different methods for solving "The Travelling Salesmen Problem"

USC 2021 Spring CSCI 561 Artificial Intelligence Score: A-

Texniti Noimosini - Ergasia1

An application that uses A* algorithm and uniform cost search to solve 8-puzzle.

Contains the Programs of Topics study in Artificial Intelligence subject

Finds the best solution path for a maze using artificial intelligence

Fun projects and apps I made to learn about (and play around with!) various algorithms, concepts and technologies!