Project for developing autonomous agents with AI, using both reactive and deliberative architectures
-
Updated
Jul 30, 2024 - TeX
Project for developing autonomous agents with AI, using both reactive and deliberative architectures
8-puzzle implementation in Python using State space search algorithms
Experimenting with intelligent agents utilizing a variety of different algorithmic methods to develop an expert level bot for the card game of Schnapsen.
a board game called Barjees ("برجيس or برسيس" in Arabic), better viewed on computers & tablets
Another take at Sudoku solving
XLOX board game, can be solved by user or by computer using state space search algorithms
Artificial Intelligence Course at Parul University taught in Spring 2023 by Mr Smaranjit Ghose
A toy implementation of search-based planning on the river crossing problem.
We have solved famous Travelling Salesman Problem using an AI algorithm Simulated Annealing
ECOM 031 - Instituto de Computação UFAL
Algorithms for searching the state space (The basics of artificial intelligence)
The shortest path algorithm is an implementation of state space search and A*
CSCI-4202 - Artificial Intelligence - Programming Assignment 1 – Problem Solving Using Search
Project of an intelligent autonomous garbage truck that implements most important learning methods in artificial intelligence. Created for Artificial Intelligence classes in the summer semester of 2020/2021 at Adam Mickiewicz University in Poznań with @HondaPL, @SmoothCrimminal and @Maciasty15.
Programs, reports, and documentation for the coursework on Artificial Intelligence
Arrange a 3x3 grid containing the numbers 1-8 so that the numbers are displayed in order. Compares search algorithms that solve this puzzle, including Random Search, Breadth First Search, Depth First Search, Greedy Search, and A* Search. See README file and result.txt.
This program runs in console. It lets the user choose an algorithm to try to solve the 8-square problem with a random starting state. The algorithms included are depth-limited search, uniform-cost search, (greedy) best-first search, and A* search.
Finds the optimal solution path with DFS, BFS and A* Algorithm in an indonesian dot puzzle.
Add a description, image, and links to the state-space-search topic page so that developers can more easily learn about it.
To associate your repository with the state-space-search topic, visit your repo's landing page and select "manage topics."