Skip to content

About

A Breadth-First Search pathfinding algorithm for 2D and 3D spaces

Topics

Resources

Stars

3 stars

Watchers

0 watching

Forks

Latest commit

 

History

36 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Breadth-First Search

A Breadth-First Search pathfinding algorithm for 2D and 3D spaces.

alt text

Requirements

bfs.py:

N/A

bfs_3d.py:

N/A

3d_model.py

- Matplotlib
- NumPy

bfs.py

To-do

  • Solve bug that allows the Node to traverse between two diagonally adjacent obstacles:
P - Player
O - Obstacle

[P][O]    [ ][O]
[O][ ] => [O][P]
  • Allow the algorithm to check a non-rectangular/uneven map

🚀 bfs_3d.py

Let's visit another dimension! How about 3D space?

To-do

  • 🐛 Solve bug in method Pathfinder.check_for_obstacle() that allows the Node to make illegal moves
  • Create a 3D graphing model to aid debugging
  • Export Map.collision_map and Pathfinder.path to be imported by 3d_model.py
  • Cleaned up the code and comments of bfs_3d.py and 3d_model.py
  • Find a way to make Pathfinder.node_look() cleaner

About

A Breadth-First Search pathfinding algorithm for 2D and 3D spaces

Topics

Resources

Stars

3 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages