42 Algorithm project that solve n-puzzle
-
Updated
Aug 2, 2024 - Python
42 Algorithm project that solve n-puzzle
GPU-Accelerated Cosine Similarity for Tandem Mass Spectrometry
🐦 | Cogito retro game clone featuring Search Problem algorithm implementations
This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach
This package is developed as part of a ROS (Robot Operating System) project for path planning. It includes implementations of A* (A star), Dijkstra, and Greedy algorithms for path planning in robotic applications.
Sliding Puzzle solver and utilities
Solving sudoku puzzles using a variation of search algorithms
A java program that solves the Eight Puzzle problem using five different search algorithms.
Academic Assignment on Search Algorithms Presented in the Fundamentals of Intelligent Systems Course (2023/1).
8 puzzle solver, a python program that solves the modified version of Expense 8 puzzle problem using different algorithms,
An artificial intelligence software designed to simulate the character Neo from the matrix movie escaping the matrix under different circumstances
Simulation of a cleaning robot in a castle
🔍🤖An informative visualization of the different search types used by AI agents.
A project for Fundamental of Optimization class at HUST, Winter 2022
A limited-capacity rescue boat rescues passengers, retrieves black boxes, and drops off passengers at a station with 5 actions (Pick-up, Drop, Retrieve, Movement) using BFS, DFS, Iterative deepening, Greedy with 2 heuristics, and A* with 2 admissible heuristics.
PyTorch implementation of transformer with greedy search algorithm for calculating accuracy metrics
AA First Assignment - The objective of this project was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. Exhaustive Search and Greedy Algorithms were used to solve this problem, and both approaches were compared in terms of execution time, as well as time complexity.
First project of Introduction to AI at Universidad del Valle. Mario's goal is to find the princess using artificial intelligence algorithms. Uninformed (Breadth-First Search, Uniform-Cost Search and Depth-First Search) and Informed (Greedy Search and A* Search) search algorithms are used.
Add a description, image, and links to the greedy-search topic page so that developers can more easily learn about it.
To associate your repository with the greedy-search topic, visit your repo's landing page and select "manage topics."