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.

Python script leverage AI search techniques to solve a number puzzle.

Bridges (hashi)