You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing
CS50’s Introduction to Artificial Intelligence with Python. This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation.
Solve any FreeCell Solitaire puzzle with 1 of the 4 different path finding algorithms: Breadth 1st Search, Depth 1st Search, Best 1st Search, Astar Search.
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.
This repository demonstrates work completed as part of the University of St Andrews, CS5011 Artificial Intelligence Practice module. Specifically, four different AI practice domains were considered: Search, Uncertainty, Logic, and Learning.