Here are
26 public repositories
matching this topic...
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
Updated
Jun 1, 2020
Python
A BFS and A* implementation to the classic 8-puzzle problem
⚙️ A library providing searches on state space
Updated
Mar 11, 2021
Rust
A* and IDA* search implemented in Java.
Solving RGB Puzzle via State Space Search Algorithms
Eight puzzle solver using iterative deepening
Updated
Mar 25, 2018
Python
Implementation of the 8-Puzzle problem using A* Search Algorithm
Updated
Feb 9, 2019
Python
Parallel Sudoku Implementation using Charm++
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
Assignments submitted for the course FineTech-1
Repository containing solutions to given assignments as a part of the Introduction to Artificial Intelligence university course.
Updated
May 26, 2021
Java
Enumeration (using Python generators) of finite and infinite discrete spaces.
Updated
Nov 3, 2020
Python
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
Updated
Feb 28, 2020
Python
Sokoban level solver w/ bidirectional A* search
Updated
Dec 24, 2018
Python
Repo for CSc-416 - Artificial Intelligence Programming Languages, for the Fall 2018 semester taught by Prof. Craig Graci
Updated
Dec 17, 2018
Common Lisp
ECOM 031 - Instituto de Computação UFAL
Artificial Intelligence and Machine Learning - Project - Dice Wars
Updated
Dec 20, 2020
Python
Finds the optimal solution path with DFS, BFS and A* Algorithm in an indonesian dot puzzle.
Updated
Mar 10, 2020
Python
Updated
Jul 4, 2021
Prolog
A simple robotic vacuum cleaner simulator
Updated
Sep 14, 2017
Python
Solving 8-Puzzle using A* Algorithm
Updated
Dec 27, 2019
Python
This python code implements the game connect four. The AI uses state-space search min-max to make it's best move against the player.
Updated
Apr 25, 2021
Python
Programs for Design And Analysis of Algorithms SEM - IV
Updated
Mar 15, 2020
Python
Implemented Min-max algorithm to assist the AI agent to make its next move.
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.
A repository containing all files used for assignments of Machine Intelligence - UE18CS303
Updated
Nov 29, 2020
Python
Improve this page
Add a description, image, and links to the
state-space-search
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
state-space-search
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.