best-first-search

harisankar95/pathfinding3D

Python implementation of common pathfinding algorithms in 3D grid space

devangi2000/Artificial-Intelligence-Algorithms

A repository containing codes and algorithms for the AI course 18CSC305J.

Gerard097/Pathfinding

Common pathfinding algorithms

shushrutsharma/18CSC305J-AI

All Lab experiments of 18CSC305J Artificial Intelligence.

ahmedadamji/PathPlanning

C++ Implementation of Path Planning Algorithms based on the Python Implementation by Huiming Zhou (https://github.com/zhm-real)

GurkNathe/Pathfinding-Algorithms

A Python implementation and visualization of various pathfinding and graph search algorithms.

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

AradAshrafi/graphsearchalgorithms_geneticalgorithm_hillclimbing

Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics

NodiraTillayeva/IntroToAI

CS50’s Introduction to Artificial Intelligence with Python. This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation.

Leonardpepa/Freecell-solitaire-AI-Solver

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

cocolico14/8Puzzle

solving 8 Puzzle with A*, Recursive Best First Search and BFS

diegothucao/react-native-javascript-redux-saga-template

This is an essential example to build react-native app using Javascript and Redux Saga

VedantKhairnar/The-Maze-Runner

AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze

Adamouization/AI-Search-Flight-Route-Planner

:airplane: Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).

AlfredoFilho/IA-Learning-Search

Ferramenta para visualizar buscas da Inteligência Artificial - A-star (A estrela), Best-first (Melhor-primeiro), Depth-First (Profundidade) e Breadth-First (Amplitude / Busca em Largura)

claud32/Rush-Hour-Puzzle-Solver

An AI Solver for Puzzle "Rush Hour"

luisalejandrobf/Prolog_BestFirst-A-Algorithm-BreadthFirstSearch

Implementation of the Best First/A* Algorithm and Breadth-first Search Algorithm for room and box manipulation. Efficient algorithms for solving room and box manipulation problems.

MinaKhamesi/Sudoku-Solver-Visualizer

Visualizes how three different algorithms(Backtracking, Best first search and algorithmX with dancing links) solve a sudoku puzzle.

ronaldosvieira/reinforced-greediness

Legends of Code and Magic bot submitted to the IEEE CEC 2020's Strategy Card Game AI Competition

saurabh1907/2d-rpg-game-cpp

2D RPG horror game in C++ utilizing OpenGL and SFML multimedia library

amit-sarker/GBFS_AI_Final_Assignment

AI Final Assignment, paper link: tinyurl.com/last-choice-ai

camargodev/n-tile-puzzle

fzehracetin/Find-Path-in-Map-with-Search-Algorithms-

Finding path in a map which consist of cities using A*, Best First Search, Breadth First Search and Depth First Search.

K-Konstantinidis/Freecell-Solitaire-Solver

Solve any FreeCell Solitaire puzzle with 1 of the 4 different path finding algorithms: Breadth 1st Search, Depth 1st Search, Best 1st Search, Astar Search.

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.

bryangamas/el-oso

Game in which you must form as many “OSO” words as possible before the computer beats you. Can you beat it?

CristianCosci/15puzzleGame_OCaml

Implementing A-star(A*) to solve 15-Puzzle game in OCaml

din0s/n-puzzle-solver

n-tile puzzle solver in C++ using DFS, BFS and BestFS

fzehracetin/A-Star-and-Best-First-Search

This is the implementation of A* and Best First Search Algorithms in python language. The project comprimise two data structures: stack and heap.

hansinahuja/Marsquake-Rover

A visualisation tool for various pathfinding algorithms.

khasmamad99/9-puzzle-solver

salmiyounes/snake-game

Snake game solver

ShivPrashant777/graph-visualization

Create custom graphs, generate BFS, DFS animations and find path between nodes using best first search or A* Algorithm.

vikasgola/graph-search-algorithms

This repo contains all the search algorithms of graph.

IgnacioGameolay/8-Puzzle-Solver

A C-based 8 puzzle solver using graphs and Abstract Data Types and 3 search-algorithms: DFS, BFS, Best-First with Manhattan Distance