This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
-
Updated
Feb 28, 2020 - Python
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
Enumeration (using Python generators) of finite and infinite discrete spaces.
Sokoban level solver w/ bidirectional A* search
Repo for CSc-416 - Artificial Intelligence Programming Languages, for the Fall 2018 semester taught by Prof. Craig Graci
Simple Wordle solver using BFS
XLOX board game, can be solved by user or by computer 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.
Project for developing autonomous agents with AI, using both reactive and deliberative architectures
A simple robotic vacuum cleaner simulator
Solving 8-Puzzle using A* Algorithm
ECOM 031 - Instituto de Computação UFAL
Artificial Intelligence and Machine Learning - Project - Dice Wars
This repository contains a State Space Search project where differente search algorithms are implemented
Assignments submitted for the course FineTech-1
a board game called Barjees ("برجيس or برسيس" in Arabic), better viewed on computers & tablets
Finds the optimal solution path with DFS, BFS and A* Algorithm in an indonesian dot puzzle.
We have solved famous Travelling Salesman Problem using an AI algorithm Simulated Annealing
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.
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."