An open API service indexing awesome lists of open source software.

Projects in Awesome Lists tagged with best-first-search

A curated list of projects in awesome lists tagged with best-first-search .

https://github.com/leonardpepa/pathfinding-visualizer

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

astar astar-algorithm astar-pathfinding astar-search-algorithm best-first-search bfs breadth-first-search depth-first-search dfs dsa-algorithm java leonard leonardpepa pathfinder pathfinding pepa shortest-path-algorithm shortest-paths visualization visualizer

Last synced: 14 Feb 2025

https://github.com/mehul2205/memoryallocation

The real challenge of efficiently managing memory is seen in the case of a system which has multiple processes running at the same time. Since primary memory can be space-multiplexed, the memory manager can allocate a portion of primary memory to each process for its own use. However, the memory manager must keep track of which processes are running in which memory locations, and it must also determine how to allocate and deallocate available memory when new processes are created and when old processes complete execution. While various different strategies are used to allocate space to processes competing for memory, three of the most popular are Best fit, Worst fit, and First fit.

best-first-search best-fit c-plus-plus first-fit memory-allocation memory-management worst-fit

Last synced: 05 Apr 2025

https://github.com/aveek-saha/pac-man

πŸ•Ή A recreation of the classic Pac-Man game with better AI for the ghosts.

a-star-search best-first-search dijkstra-shortest-path game-2d pac-man pacman phaserjs

Last synced: 10 Apr 2025

https://github.com/jaiswalchitransh/ucs-with-best-first-search

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

artificial-intelligence best-first-search heuristic-search-algorithms heuristics project python python-3 python3 searching-algorithms ucs uniform-cost-search

Last synced: 10 Apr 2025

https://github.com/a-tokyo/help-r2-d2-escape

πŸ”πŸ€–An informative visualization of the different search types used by AI agents.

a-star-search ai best-first-search bfs dfs greedy-search ids informative informed-search search simulator stimulation ucs uninformed-search

Last synced: 30 Mar 2025

https://github.com/amyanchen/tower-of-hanoi

EECS 348: Intro to Artificial Intelligence, Assignment 1 (Python)

best-first-search breadth-first-search depth-first-search

Last synced: 19 Feb 2025