Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics
Explore Python implementations of BFS and IDFS algorithms for solving shortest path problems in grid environments. Find the optimal route through obstacles efficiently.
A simple command-line Java program for solving the n-puzzle using various search strategies.
Given an array of n distinct elements, find the minimum number of swaps required to sort the array.
This repository contains an 8-Puzzle AI Solver implemented using various search algorithms including Depth-First Search (DFS), Breadth-First Search (BFS), Iterative Deepening Depth-First Search (IDFS), and A* Search. The project also includes a graphical user interface (GUI) built with PyQt5 to visualize the puzzle and the solution steps..
To associate your repository with the idfs topic, visit your repo's landing page and select "manage topics."