Fundamental Search Algorithms ( Problem Set 1 )

This project is a collection of fundamental search algorithms used to solve pathfinding problems in graphs. It is part of our Intro to Artificial Intelligence course.

Implemented Algorithms

• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Greedy Best-First Search (GBFS)
• A*

Purpose

These implementations demonstrate the foundations of AI problem-solving, highlighting different strategies for exploring graphs.
They help in understanding:

• Search strategies
• Optimality
• Efficiency

Technologies Used

• Python 3 (main programming language)

Usage

Clone the repository and run the program:

git clone https://github.com/jksalcedo/search-algorithm-py.git
cd search-algorithm-py
python main.py

License

MIT - Feel free to use this for learning.