Demonstrating a Variety of Classic AI Search Algorithms to Solve the Classic 8-Puzzle Problem.
-
Updated
Jun 8, 2024 - Python
Demonstrating a Variety of Classic AI Search Algorithms to Solve the Classic 8-Puzzle Problem.
This project focuses on implementing and comparing various search algorithms for navigating a drill robot in a grid world. The drill robot's goal is to find the most efficient path from a starting point to a target location, avoiding obstacles and exploring the grid effectively.
Application to create tree structured data
Java library for various data structures and graph algorithms. Includes implementations for linked lists, stacks, queues, trees, sorting and searching algorithms, and graph traversal algorithms.
A general-purpose lightweight C++ graph library
Header-Only C++ Library for Graph Representation and Algorithms
An implementation of graph traversal algorithms in Prolog, focusing on breadth-first search (BFS). The project finds the shortest path between nodes in a graph, covering both directed and undirected graphs with extensive test cases.
Maze solver using bfs search in c language
Short introduction into BFS, DFS and A* algorithms with case-studies.
Animal Chess
Building and Solving Sokoban game using AI
Visualization of maze pathfinding algorithm
Prácticas para la materia de Inteligencia Artificial - FI UNAM 2024-2
This repository contains Java implementations of Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms.
An experimental library for starting and stopping multi-service environments correctly and efficiently based on declared dependencies between them
Obligatorio Algoritmo y Estrucutra de Datos 2
practice the understanding of Undirected Graphs and Adjacency Lists.
using python to implement 2 search algorithms (BFS and A*) to find the shortest path in a maze
Add a description, image, and links to the bfs-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the bfs-algorithm topic, visit your repo's landing page and select "manage topics."