This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

AI searching Algorithms Implementation with Nodejs

Tugas Kecil 3 IF2211 Strategi Algoritma - Word Ladder Solver using UCS, GBFS, and A*

A simple search agent of an autonomous vacuum cleaner, trying to reach dirt spilled in different parts of a randomly generated room in the most efficient way possible. The project utilizes various search algorithms including, but not limited to; Greedy Search, Uniform Cost Search, and A* Search utilizing both path cost and a Manhattan heuristic.

First homework to the subject IZU.

A Sokoban game with different naming style (SokoFarm)

Uniform Cost Search implementation

This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

CSCI 4202 introduction to AI - AI Algorithms

Searching Algorithm Example

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

This repository accompanies a 3-part lecture series: Introduction to Pathfinding

Stanford-CS221 class practical's, Assignments and projects

An assortment of functions for number theory / discrete math type problems

University Course on AI in Python. Learn Different Algorithms Include DFS, BFS,UCS, A*, Hill Climbing and Many More.

A Python application designed for efficient pathfinding in graph-based city networks. Leveraging the Uniform Cost Search algorithm, a staple in AI for complex navigation and optimization problems, this tool calculates the shortest routes between cities with support for real-world geographic positioning through coordinate data.

An Artificial Intelligence Project based on UC Berkeley's Pacman AI course

This repository contains different algorithms to search for the goal state from the initial state in the slide bar puzzle problem

This repository contains codes that demonstrate BFS and DFS traversals on the map of romania, using frontier and explored lists

8 puzzle solver, a python program that solves the modified version of Expense 8 puzzle problem using different algorithms,