GitHub - gmortensen/dungeon-puzzle: Solution to finding the shortest path in a dungeon from entered start and end points, navigating around obstacles within the dungeon. Uses Breadth-First Search to find the shortest path, and then utilizes backtracking to return the graph coordinates of the path taken.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Puzzle.py		Puzzle.py

About

Solution to finding the shortest path in a dungeon from entered start and end points, navigating around obstacles within the dungeon. Uses Breadth-First Search to find the shortest path, and then utilizes backtracking to return the graph coordinates of the path taken.