idfs
There are 8 repositories under idfs topic.
AradAshrafi/graphsearchalgorithms_geneticalgorithm_hillclimbing
Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics
AliDev-ir/Grid-World-Shortest-Path-Solver
Explore Python implementations of BFS and IDFS algorithms for solving shortest path problems in grid environments. Find the optimal route through obstacles efficiently.
pkazmierski/n-puzzle-solver
A simple command-line Java program for solving the n-puzzle using various search strategies.
hamidrnaseri/sort_array_with_min_number_of_swaps
Given an array of n distinct elements, find the minimum number of swaps required to sort the array.
kacpwoja/EARIN_Bridges
Bridges (hashi)
ShaunJorstad/Number-Puzzle-Solver
Python script leverage AI search techniques to solve a number puzzle.
ranimeshehata/8-Puzzle-AI-Agent
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..