PathFinding

Path Finding project for the AI course implementing different heuristics search algorithms such as:

Team Members:

Waseem Tannous - Github: waseemtannous

Saji Assi - Github: SajiAssi

The objective is to calculate and get the path with minimum cost from given points A to B with given grid and different step cost for each area.

We also implemented a GUI to see how each algorithm runs on a given grid and obstacles.

Name		Name	Last commit message	Last commit date
Latest commit History 41 Commits
.idea		.idea
__pycache__		__pycache__
input		input
submission		submission
venv		venv
.gitattributes		.gitattributes
ASTAR.py		ASTAR.py
AlgorithmType.py		AlgorithmType.py
BIASTAR.py		BIASTAR.py
Heuristics.py		Heuristics.py
IDASTAR.py		IDASTAR.py
IDS.py		IDS.py
Maze.py		Maze.py
Node.py		Node.py
README.md		README.md
UCS.py		UCS.py
main.py		main.py
output.txt		output.txt