Simple Python implementation of a Hamiltonian Path finder algorithm using backtracking, built as an assignment for the Foundations of Algorithm Design and Analysis course at PUC Minas university. You ...
Terminal-based Maze Solver using BFS algorithm and Python's curses library. This project visually demonstrates how the Breadth-First Search (BFS) algorithm finds the shortest path through a maze.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results