This repository contains implementations of various algorithms, primarily focused on search techniques, optimization methods, and problem-solving strategies in Python. These algorithms are suitable for educational purposes, reference, or integration into larger projects.
- Breadth-First Search (BFS) & Depth-First Search (DFS): Classic graph traversal algorithms.
- Maximum Region & Alien Affected Area: A custom problem-solving algorithm.
- A Search Algorithm*: A heuristic-based search algorithm for finding the shortest path.
- Alpha-Beta Pruning: Optimizes decision-making in minimax-based AI systems.
- Genetic Algorithm (8-Queens): Solves the 8-Queens problem using genetic algorithms.
- Bidirectional Search: Efficiently finds the shortest path by searching from both the source and destination.
- Clone this repository:
git clone https://github.com/S18-Niloy/Algorithms.git
- Navigate to the repository directory:
cd Algorithms - Run any algorithm by executing the corresponding Python file. For example:
python A_star_Search.py
BFS & DFS.py: Implements both BFS and DFS for graph traversal.Max_region_&_Alien_Affected.py: Solves a custom problem involving maximum region detection and alien-affected areas.A_star_Search.py: Contains the implementation of the A* search algorithm, widely used in AI for pathfinding.Alpha_beta_pruning_using_array.py: Demonstrates the Alpha-Beta pruning technique for decision-making in games.Genetic_algo_8_queen.py: Uses a genetic algorithm to solve the 8-Queens puzzle, an optimization problem.bidirectional_search.py: Implements bidirectional search for finding paths efficiently.
Contributions are welcome! To contribute:
- Fork the repository.
- Create a new branch for your changes.
- Commit your changes with clear descriptions.
- Submit a pull request for review.
This repository is maintained by S18-Niloy. If you have questions or suggestions, feel free to open an issue.
Happy Coding! 🚀