This is an educational repository containing implementation of some search algorithms in Artificial Intelligence.

This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies

This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity

Desktop app for visualizing graph search algorithms

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

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.

Repositori untuk mata kuliah Artificial Intelligence & Machine Learning di Universitas Al Azhar Indonesia

An Implementation of Blocks World problem with python. The blocks world is one of the most famous planning domains in artificial intelligence for more info (https://en.wikipedia.org/wiki/Blocks_world)

implementation of informed and uninformed search algorithms: UCS, IDS, A*, Bi directional A* and IDA*.

The Single Queue Simulation is an implementation of a simulation model with multiple servers and queue priority.

Solving the n-puzzle problem using informed and uninformed search strategies

8 puzzle solver using: BFS, DFS, A* (Manhattan, Euclidean)

The first assignment of CS106 (Artifitial Intelligent) of UIT.

A monitor program using Qt Quick Application for monitoring Blocking Car (Rush Hour) game: A project to learn Uninformed and Informed AI Search

Visualizer for graph algorithms

This program solves a 2D maze with the help of several search algorithms like BFS, DFS, A* (A-Star) etc.

Different algorithms of AI implemented in Python.

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