There are 0 repository under state-space-search topic.
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. :gear:
Artificial Intelligence Course at Parul University taught in Spring 2023 by Mr Smaranjit Ghose
A BFS and A* implementation to the classic 8-puzzle problem
Solving RGB Puzzle via State Space Search Algorithms
CSCI-4202 - Artificial Intelligence - Programming Assignment 1 – Problem Solving Using Search
Lab solutions for Artificial Intelligence ("Umjetna inteligencija") course at FER 2019/20 led by izv. prof. dr. sc. Jan Šnajder and doc. dr. sc. Marko Čupić
A* and IDA* search implemented in Java.
Another take at Sudoku solving
⚙️ A library providing searches on state space
Programs, reports, and documentation for the coursework on Artificial Intelligence
Eight puzzle solver using iterative deepening
The shortest path algorithm is an implementation of state space search and A*
Parallel Sudoku Implementation using Charm++
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
A toy implementation of search-based planning on the river crossing problem.
A simulation of the state space search techniques using OpenGL.
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.
This Project is an implementation of A* Search Algorithm and a comparison between this algorithm with BFS and DFS Algorithms.
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.
A State Space Search Vacuum Cleaner
Project with reactive architecture, state space search, markov decision process and reinforcement learning
Repository containing solutions to given assignments as a part of the Introduction to Artificial Intelligence university course.
Classification of items with a Line, Decision Tree. State-Space Search, Genetic Algorithms, Case-Based Reasoning, Self-Organising Maps and much more!
Pac-Man game implementation using some foundational AI concepts, such as informed state-space search, probabilistic inference, and reinforcement learning.
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.
a board game called Barjees ("برجيس or برسيس" in Arabic), better viewed on computers & tablets
XLOX board game, can be solved by user or by computer using state space search algorithms
After creating an optimized state space tree, Breadth First Search can be used to solve the famous Tower of Hanoi (TOH) problem. I have used simple c++ language in this case.
This repository contains a State Space Search project where differente search algorithms are implemented
We have solved famous Travelling Salesman Problem using an AI algorithm Simulated Annealing