Skip to content

danielleandal/Constraint-Based-Pathfinding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Constraint-Based-Pathfinding

Implemented a solution for solving a maze using Breadth-First Search (BFS), accommodating various restrictions and incorporating teleportation mechanics under specific conditions. This project highlights strong algorithmic design skills and the ability to adapt classical search techniques to complex, constraint-driven scenarios

About

Implemented a solution for solving a maze using Breadth-First Search (BFS), accommodating various restrictions and incorporating teleportation mechanics under specific conditions. This project highlights strong algorithmic design skills and the ability to adapt classical search techniques to complex, constraint-driven scenarios

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages