Code for a Computer Vision Based Pick up Bot

A program to compare a path to escape in a maze created by implementing Breadth First Search (BFS) algorithm with a path to escape in a maze created by implementing A* algorithm

Visualization of the A* search algorithm, made with python3 & Tkinter

My Solutions to Programming Assignments of Artificial Intelligence, Machine Learning and Digital Image Processing

The stupid 8-puzzle game using several search techniques

A pathfinder in python using the A* algorithm.

Efficient A* 8-Puzzle solver utilizing a combination of cost and heuristic estimates for intelligent search. Handles both number and image-based scenarios, providing visual representation and optional step-saving.

Implementation of different search algorithms for the Pacman game.

This project implements two nature-inspired optimization algorithms: Moth Flame Optimization (MFO) and Honey Badger Optimization (HBO). Both algorithms are designed to solve complex optimization problems by mimicking behaviors observed in nature. also it includes a path finding algorithm, A-star

Finding optimised path between source and destination using A-star algorithm.

Domain independent planner

A Collection of Puzzle Solvers. Includes a Sudoku Solver with forward checking and a K-Puzzle Solver which utilises the A* algorithm.

This repository contains a Python implementation of the A* algorithm for solving the n-puzzle problem. The code was developed as a homework assignment and includes detailed comments and explanations. With this implementation, you can solve n-puzzle problems of various sizes and explore the algorithm's behavior and performance.

A star pathfinding algorithm

Controlling a Turtlebot in ROS and implemented path planning using the A-Star algorithm

This project uses A-Star search to solve the 8-board puzzle

A twist on the popular 8 Puzzle problem in AI

A Bresenham's line based global path planning algorithm. A recursive path planning algorithm was developed that operates on the grid maps represented by a masked array and solves potential looping problems using a state machine-based loop breaking mechanism.