solving 8 Puzzle with A*, Recursive Best First Search and BFS
-
Updated
Oct 18, 2019 - Java
solving 8 Puzzle with A*, Recursive Best First Search and BFS
Implementation of uninformed and informed AI search algorithms in Rust. Search algorithms include BFS, DFS, A*, RBFS, IDS, IDA*, and GBFS.
This repository contains different algorithms to search for the goal state from the initial state in the slide bar puzzle problem
This is a homework about various Uninformed and Informed search algorithms, implemented for solving a simple game. This homework is a part of many projects in a Fundamentals to AI course @ FUM.
This repository contains codes that demonstrate BFS and DFS traversals on the map of romania, using frontier and explored lists
Add a description, image, and links to the recursive-best-first-search topic page so that developers can more easily learn about it.
To associate your repository with the recursive-best-first-search topic, visit your repo's landing page and select "manage topics."