Skip to content
#

astar-search-algorithm

Here are 54 public repositories matching this topic...

Berkeley Pacman Projects (1 and 2), Depth First Search, Breadth First Search, Uniform Cost Search ,A* Search , Heuristic Functions ,Suboptimal Search, Minimax Algorithm, Alpha-Beta Pruning, Expectimax, Constraint Santisfaction Problems, RLFA CSP problem, Propositional Logic, First-order Logic

  • Updated Mar 24, 2022
  • Python

A simple search agent of an autonomous vacuum cleaner, trying to reach dirt spilled in different parts of a randomly generated room in the most efficient way possible. The project utilizes various search algorithms including, but not limited to; Greedy Search, Uniform Cost Search, and A* Search utilizing both path cost and a Manhattan heuristic.

  • Updated Apr 25, 2024
  • Python

Improve this page

Add a description, image, and links to the astar-search-algorithm 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 astar-search-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more