best-first-search

There are 104 repositories under best-first-search topic.

  • pathfinding

    Language:JavaScript1

  • AI

    Language:Jupyter Notebook1

  • Path-Search-Algorithm

    Language:Python1

  • maze-solver

    Language:Python

  • AI-Assignments

    Language:Jupyter Notebook

  • Register_AI_Search

    Breadth-first search, Depth-first search, Best-first search,A-Star search and AVL Trees algorithms implemented in C

    Language:C1

  • ArtificialIntelligence02180

    DTU course 02180 Introduction to Artificial Intelligence, Spring 2024

    Language:HTML1

  • Search-algorithms

    implementing different search algorithms on graphs

    Language:Jupyter Notebook1

  • CS5011-AIPractice

    Various assignments relating to the practice of AI concepts, specifically: search, logic, learning, and uncertainty.

    Language:Java1

  • jade-swarm

    Implementation of uninformed and informed AI search algorithms in Rust. Search algorithms include BFS, DFS, A*, RBFS, IDS, IDA*, and GBFS.

    Language:Rust1
  • Pac-Man

    Pac-Man

    🕹 A recreation of the classic Pac-Man game with better AI for the ghosts.

    Language:JavaScript1

  • AsuPathFinder

    A pretty cliche project... I know. I saw my friend building his own pathfinder and I decide to flex my own graph theory skills. In a week's time of work, I present to you AsuPathFinder, a fun-sized pathfinding / maze generating sandbox with a ton of playful features. Check it out here: https://asdera.github.io/AsuPathFinder/

    Language:JavaScript1

  • n-puzzle-solver

    A simple command-line Java program for solving the n-puzzle using various search strategies.

    Language:Java1

  • AIR-assignments

    Artificial Intelligence and Robotics Assignments

    Language:Jupyter Notebook1

  • Shortest-Path-Problem

    A command line Java program developed for an artificial intelligence college course. It applies the Shortest Path Problem to a graph of fictitious cities. It uses either Best First Search or Uniform Cost Search to provide the shortest path from one city in the graph to another.

    Language:Java1

  • Basic_Modules_Operating_Systems

    This Repo contains basic modules like Use of Kernel level Libraries, Random Number generation, Heap Memory Module implementation via best-fit,first-fit,Buddy Systems,Virtual Memory Mechanisms FIFO,LFU,MFU, Process deadlock Mechanism Detection

    Language:Makefile1

  • Maizal

    Search algorithm framework to find and expand trees.

    Language:JavaScript1

  • Search_Algorithms

    implementation of search algorithms

    Language:Java1

  • Artificial_intelligence_coursework_1

    Travelling salesman problem: Artificial Inteligence, Computer Science, Middlesex University, London

    Language:Java1

  • repeated-a-star-gridworld

    Repeated Forward A* search in a Gridworld

    Language:Java1

  • SearchAlgorithms-TreeVisualizer

    It creates and visualizes trees and supports various search algorithms such as BFS, DFS, UCS, A*, Best-First Search, IDS, and Backtracking

    Language:C++

  • 8-puzzle

    8-puzzle implementation in Python using State space search algorithms

    Language:Python

  • railway-station-puzzle

    Optimization of railway station placement to minimize the number of stations and average travel cost for families using A* algorithm.

    Language:Java

  • Shortest-Flight-Path

    Shortest flight path using searching algorithms

    Language:Java

  • 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).

    Language:Python

  • Building_Evacuation

    Undergraduate

    Language:Python

  • PATHWAY

    A pathfinding visualizer with speed control, highlighting the count of visited cells and path length.

    Language:JavaScript

  • NPuzzle-Solver-AI-Algorithms

    Solves a N-Dimension Puzzle with one of the 4 different path algorithms : Breadth 1st Search, Depth 1st Search, Best 1st Search and A* Search.

    Language:Java

  • mapOfRomania

    This repository contains codes that demonstrate BFS and DFS traversals on the map of romania, using frontier and explored lists

    Language:Python

  • CS5011-Artificial-Intelligence-Practice

    This repository demonstrates work completed as part of the University of St Andrews, CS5011 Artificial Intelligence Practice module. Specifically, four different AI practice domains were considered: Search, Uncertainty, Logic, and Learning.

    Language:Java

  • AI-searching-techniques-using-Python-and-Tkinter-for-graphical-user-interface

    This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

    Language:Python

  • Artificial-Inteligence-Project

    Project for IA Subject where we study Geographics Networks and Search Algorithms

    Language:Jupyter Notebook

  • CS2223-Programming-Principles

    Solving TACI 8-Puzzle using heuristic search

    Language:C++

  • Fundamentals-of-Automated-Planning

    Deliverables relating to the Fundamentals of Automated Planning University Unit

    Language:Jupyter Notebook

  • Romanian-Problem-Algorithms

    Best-First-Search | Breadth-First-Search | Depth-First-Search | Greedy-Best-First-Search | A-Star-Search

    Language:Python

  • Road-search

    Prolog program for Search of a road-route from any city A to any other city B

    Language:Jupyter Notebook