All Lab experiments of 18CSC305J Artificial Intelligence.

A repository containing codes and algorithms for the AI course 18CSC305J.

A* written in C#, used with LINQ.

Common pathfinding algorithms

Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics

AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze

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.

A Python implementation and visualization of various pathfinding and graph search algorithms.

A visualisation tool for various pathfinding algorithms.

C++ Implementation of Path Planning Algorithms based on the Python Implementation by Huiming Zhou (https://github.com/zhm-real)

n-tile puzzle solver in C++ using DFS, BFS and BestFS

This repo contains all the search algorithms of graph.

AI Final Assignment, paper link: tinyurl.com/last-choice-ai

Legends of Code and Magic bot submitted to the IEEE CEC 2020's Strategy Card Game AI Competition

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.

Python implementation of common pathfinding algorithms in 3D grid space

Comparative Approach to solve Sudoku | "Depth-first Search", "Iterative deepening depth-first search" and "Best-first search"

Create custom graphs, generate BFS, DFS animations and find path between nodes using best first search or A* Algorithm.

Finding path in a map which consist of cities using A*, Best First Search, Breadth First Search and Depth First Search.

Various assignments relating to the practice of AI concepts, specifically: search, logic, learning, and uncertainty.