A* written in C#, used with LINQ.

Python implementation of common pathfinding algorithms in 3D grid space

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

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

Common pathfinding algorithms

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

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

All Lab experiments of 18CSC305J Artificial Intelligence.

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.

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

🔍🤖An informative visualization of the different search types used by AI agents.

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

This is an essential example to build react-native app using Javascript and Redux Saga

An AI Solver for Puzzle "Rush Hour"

solving 8 Puzzle with A*, Recursive Best First Search and BFS

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

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 Semantic A* Pathfinding agent that navigates Wikipedia using high-dimensional vector space. Built with Python, BeautifulSoup4, and Sentence-Transformers to bridge unrelated concepts through semantic context rather than just keywords.

:airplane: Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).

2D RPG horror game in C++ utilizing OpenGL and SFML multimedia library

Legends of Code and Magic bot; 3rd place @ IEEE CEC 2020's Strategy Card Game AI Competition

Ferramenta para visualizar buscas da Inteligência Artificial - A-star (A estrela), Best-first (Melhor-primeiro), Depth-First (Profundidade) e Breadth-First (Amplitude / Busca em Largura)

Implementation of the Best First/A* Algorithm and Breadth-first Search Algorithm for room and box manipulation. Efficient algorithms for solving room and box manipulation problems.

Visualizes how three different algorithms(Backtracking, Best first search and algorithmX with dancing links) solve a sudoku puzzle.

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

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

The real challenge of efficiently managing memory is seen in the case of a system which has multiple processes running at the same time. Since primary memory can be space-multiplexed, the memory manager can allocate a portion of primary memory to each process for its own use. However, the memory manager must keep track of which processes are running in which memory locations, and it must also determine how to allocate and deallocate available memory when new processes are created and when old processes complete execution. While various different strategies are used to allocate space to processes competing for memory, three of the most popular are Best fit, Worst fit, and First fit.

No description provided.

Snake game solver

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