Skip to main content

A Python package implementing various search algorithms for maze solving

Project description

PathFinder

PathFinder is a Python package that provides classic pathfinding algorithms such as:

  • Breadth-First Search (BFS)

  • Depth-First Search (DFS)

  • Uniform Cost Search (UCS)

  • A-Star Search (A*)

These algorithms work on 2D mazes represented as grids, and are designed to help with visualization, teaching, or solving pathfinding problems programmatically.

💾 Installation

pip install PathWise

📝 Features

  • Supports 2D grid mazes with customizable start, goal, and wall positions

  • Clear API to run any algorithm and get the path, cost, and visited nodes

  • Easily extendable for diagonal movement or custom cost functions

  • Suitable for AI projects, teaching, and maze-solving

⚖️ Algorithms Included

BFS

  • Explores nodes level by level

  • Guarantees shortest path if all moves have equal cost

DFS

  • Explores deep into one branch before backtracking

  • May not find the shortest path

UCS

  • Uses a priority queue (cost-based)

  • Always finds the lowest-cost path

A*

  • Uses cost + heuristic (e.g. Manhattan distance)

  • Highly efficient for large or complex mazes

💡 Usage

1. Representing the Maze

A maze is a 2D list of characters:

maze = [ ["S", " ", " ", "#", "G"], ["#", "#", " ", "#", " "], [" ", " ", " ", " ", " "], [" ", "#", "#", "#", " "], [" ", " ", " ", " ", " "] ]

S = Start

G = Goal

# = Wall (Represented by 1)

' ' = Open path (Represented by 0)

2. Running an Algorithm

import numpy as np
from PathWise import BFS, DFS, UCS, A_Star

Maze = [[...], [...], ...]
Maze = np.array(Maze).astype('str')

path, nodesExpanded = DFS(Maze, start, end)         #   or BFS
path, cost, nodesExpanded = UCS(Maze, start, end)   #   or A_Star

print("Path:", path)
print("Visited:", visited)
print("Cost: ", cost)                               #   if UCS or A_Star has been used

📁 Project Structure

./
├── PathWise/
│   ├── __init__.py
│   ├── A_Star.py
│   ├── BFS.py
│   ├── DFS.py
│   ├── Helper.py
│   └── UCS.py
├── .gitignore
├── LICENSE
├── README.md
└── setup.py

📃 License

This project is licensed under the MIT License.

Author

Developed by Mahdi Jaffery

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

pathwise-1.2.0.tar.gz (4.8 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

pathwise-1.2.0-py3-none-any.whl (6.3 kB view details)

Uploaded Python 3

File details

Details for the file pathwise-1.2.0.tar.gz.

File metadata

  • Download URL: pathwise-1.2.0.tar.gz
  • Upload date:
  • Size: 4.8 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.12.3

File hashes

Hashes for pathwise-1.2.0.tar.gz
Algorithm Hash digest
SHA256 15ae1d10f155719c5370c121590868e8284917e949c6244844637cd70d323fdd
MD5 00f2adaee2aaa07042792939923b95f9
BLAKE2b-256 1437995b098ee96c8a2a10affddfaf40d241b8896b91fe15b6c5bdd3a9e3be06

See more details on using hashes here.

File details

Details for the file pathwise-1.2.0-py3-none-any.whl.

File metadata

  • Download URL: pathwise-1.2.0-py3-none-any.whl
  • Upload date:
  • Size: 6.3 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.12.3

File hashes

Hashes for pathwise-1.2.0-py3-none-any.whl
Algorithm Hash digest
SHA256 88bbcfb72c1f4743db4204ea1aee3b3ef523135c9a0d3fa6f08ce5c6cd21741f
MD5 ba507e6aa7987eb23123942fc575a6a1
BLAKE2b-256 c38a7c0bba5c6f61e62c4837d8f09757e37b482f0993102cbc3544969193a119

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page